./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:35:56,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:35:56,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:35:56,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:35:56,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:35:56,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:35:56,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:35:56,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:35:56,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:35:56,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:35:56,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:35:56,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:35:56,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:35:56,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:35:56,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:35:56,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:56,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:35:56,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:35:56,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:35:56,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:35:56,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:35:56,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd [2025-02-05 15:35:56,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:35:56,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:35:56,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:35:56,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:35:56,529 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:35:56,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2025-02-05 15:35:57,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810c49777/4c2d65c010ff420da7a856bee9f8c736/FLAG3e3631f4f [2025-02-05 15:35:58,300 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:35:58,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2025-02-05 15:35:58,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810c49777/4c2d65c010ff420da7a856bee9f8c736/FLAG3e3631f4f [2025-02-05 15:35:58,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810c49777/4c2d65c010ff420da7a856bee9f8c736 [2025-02-05 15:35:58,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:35:58,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:35:58,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:58,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:35:58,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:35:58,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:58" (1/1) ... [2025-02-05 15:35:58,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:58, skipping insertion in model container [2025-02-05 15:35:58,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:58" (1/1) ... [2025-02-05 15:35:58,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:35:58,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2025-02-05 15:35:58,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:58,945 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:35:58,953 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:35:58,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2025-02-05 15:35:58,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2025-02-05 15:35:58,956 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2025-02-05 15:35:58,957 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1220] [2025-02-05 15:35:58,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1574] [2025-02-05 15:35:58,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1586] [2025-02-05 15:35:58,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1706] [2025-02-05 15:35:58,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1890] [2025-02-05 15:35:58,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1899] [2025-02-05 15:35:59,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2025-02-05 15:35:59,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:59,125 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:35:59,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59 WrapperNode [2025-02-05 15:35:59,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:59,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:59,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:35:59,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:35:59,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,223 INFO L138 Inliner]: procedures = 92, calls = 339, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 857 [2025-02-05 15:35:59,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:59,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:35:59,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:35:59,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:35:59,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,287 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:35:59,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:35:59,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:35:59,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:35:59,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:35:59,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (1/1) ... [2025-02-05 15:35:59,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:59,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:35:59,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:35:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:35:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:35:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:35:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:35:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:35:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:35:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:35:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:35:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:35:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:35:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:35:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:35:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:35:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:35:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:35:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:35:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:35:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:35:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:35:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:35:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:35:59,428 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:35:59,428 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:35:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:35:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:35:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:35:59,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:35:59,630 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:35:59,681 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: #res := ~retValue_acc~12; [2025-02-05 15:35:59,700 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1625: #res := ~retValue_acc~10; [2025-02-05 15:35:59,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1971: #res := ~retValue_acc~13; [2025-02-05 15:35:59,719 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: #res := ~retValue_acc~14; [2025-02-05 15:35:59,962 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-02-05 15:35:59,962 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2704: #res#1 := ~retValue_acc~22#1; [2025-02-05 15:36:00,051 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: #res := ~retValue_acc~26; [2025-02-05 15:36:00,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: #res := ~retValue_acc~11; [2025-02-05 15:36:00,097 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: #res := ~retValue_acc~16; [2025-02-05 15:36:00,210 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-02-05 15:36:00,210 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2313-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-02-05 15:36:00,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-02-05 15:36:00,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2822-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-02-05 15:36:00,429 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: #res := ~retValue_acc~6; [2025-02-05 15:36:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2665: #res := ~retValue_acc~21; [2025-02-05 15:36:00,615 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:36:00,615 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571-1: main_#res#1 := main_~retValue_acc~9#1; [2025-02-05 15:36:00,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~5; [2025-02-05 15:36:00,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2137: #res := ~retValue_acc~15; [2025-02-05 15:36:00,632 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res := ~retValue_acc~7; [2025-02-05 15:36:00,808 INFO L? ?]: Removed 448 outVars from TransFormulas that were not future-live. [2025-02-05 15:36:00,808 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:36:00,838 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:36:00,838 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:36:00,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:00 BoogieIcfgContainer [2025-02-05 15:36:00,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:36:00,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:36:00,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:36:00,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:36:00,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:35:58" (1/3) ... [2025-02-05 15:36:00,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102f990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:00, skipping insertion in model container [2025-02-05 15:36:00,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:59" (2/3) ... [2025-02-05 15:36:00,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102f990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:00, skipping insertion in model container [2025-02-05 15:36:00,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:00" (3/3) ... [2025-02-05 15:36:00,847 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2025-02-05 15:36:00,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:36:00,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product21.cil.c that has 25 procedures, 563 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:36:00,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:36:00,951 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32573e12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:36:00,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:36:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 441 states have (on average 1.6938775510204083) internal successors, (747), 463 states have internal predecessors, (747), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-02-05 15:36:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:36:00,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:00,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:00,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:00,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 93730742, now seen corresponding path program 1 times [2025-02-05 15:36:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335984662] [2025-02-05 15:36:00,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:36:01,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:36:01,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:01,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335984662] [2025-02-05 15:36:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335984662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983098123] [2025-02-05 15:36:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:01,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:01,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:01,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:01,740 INFO L87 Difference]: Start difference. First operand has 563 states, 441 states have (on average 1.6938775510204083) internal successors, (747), 463 states have internal predecessors, (747), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:01,914 INFO L93 Difference]: Finished difference Result 1106 states and 1848 transitions. [2025-02-05 15:36:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-05 15:36:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:01,938 INFO L225 Difference]: With dead ends: 1106 [2025-02-05 15:36:01,938 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:36:01,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:01,955 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 5 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:01,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2747 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:36:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:36:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 435 states have (on average 1.6873563218390804) internal successors, (734), 454 states have internal predecessors, (734), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 919 transitions. [2025-02-05 15:36:02,053 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 919 transitions. Word has length 106 [2025-02-05 15:36:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:02,053 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 919 transitions. [2025-02-05 15:36:02,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 919 transitions. [2025-02-05 15:36:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:36:02,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:02,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:36:02,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:02,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1420092515, now seen corresponding path program 1 times [2025-02-05 15:36:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986637099] [2025-02-05 15:36:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:02,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:36:02,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:36:02,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:02,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986637099] [2025-02-05 15:36:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986637099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903533643] [2025-02-05 15:36:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:02,365 INFO L87 Difference]: Start difference. First operand 554 states and 919 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:02,447 INFO L93 Difference]: Finished difference Result 1090 states and 1815 transitions. [2025-02-05 15:36:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:36:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:02,457 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 15:36:02,458 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:36:02,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:02,464 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 4 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:02,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2720 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:36:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:36:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 435 states have (on average 1.6850574712643678) internal successors, (733), 454 states have internal predecessors, (733), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 918 transitions. [2025-02-05 15:36:02,508 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 918 transitions. Word has length 107 [2025-02-05 15:36:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:02,508 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 918 transitions. [2025-02-05 15:36:02,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 918 transitions. [2025-02-05 15:36:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:36:02,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:02,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:02,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:36:02,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1030121395, now seen corresponding path program 1 times [2025-02-05 15:36:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:02,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126652567] [2025-02-05 15:36:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:36:02,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:36:02,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:02,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126652567] [2025-02-05 15:36:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126652567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696521594] [2025-02-05 15:36:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:02,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:02,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:02,765 INFO L87 Difference]: Start difference. First operand 554 states and 918 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:02,864 INFO L93 Difference]: Finished difference Result 1090 states and 1814 transitions. [2025-02-05 15:36:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-05 15:36:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:02,873 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 15:36:02,873 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:36:02,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:02,880 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 3 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:02,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2720 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:36:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:36:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 435 states have (on average 1.6827586206896552) internal successors, (732), 454 states have internal predecessors, (732), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 917 transitions. [2025-02-05 15:36:02,914 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 917 transitions. Word has length 108 [2025-02-05 15:36:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:02,915 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 917 transitions. [2025-02-05 15:36:02,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 917 transitions. [2025-02-05 15:36:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:36:02,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:02,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:36:02,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1811435898, now seen corresponding path program 1 times [2025-02-05 15:36:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773929028] [2025-02-05 15:36:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:36:02,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:36:02,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:02,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773929028] [2025-02-05 15:36:03,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773929028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:03,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:03,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738962794] [2025-02-05 15:36:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:03,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:03,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:03,173 INFO L87 Difference]: Start difference. First operand 554 states and 917 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:03,226 INFO L93 Difference]: Finished difference Result 1090 states and 1813 transitions. [2025-02-05 15:36:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-05 15:36:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:03,230 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 15:36:03,231 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:36:03,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:03,235 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 2 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:03,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2720 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:36:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:36:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 435 states have (on average 1.6804597701149426) internal successors, (731), 454 states have internal predecessors, (731), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 916 transitions. [2025-02-05 15:36:03,269 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 916 transitions. Word has length 109 [2025-02-05 15:36:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 916 transitions. [2025-02-05 15:36:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 916 transitions. [2025-02-05 15:36:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:36:03,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:03,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:03,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:36:03,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:03,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1898490960, now seen corresponding path program 1 times [2025-02-05 15:36:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548537947] [2025-02-05 15:36:03,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:03,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:36:03,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:36:03,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:03,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548537947] [2025-02-05 15:36:03,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548537947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:03,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:03,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110593406] [2025-02-05 15:36:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:03,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:03,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:03,452 INFO L87 Difference]: Start difference. First operand 554 states and 916 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:03,503 INFO L93 Difference]: Finished difference Result 1090 states and 1812 transitions. [2025-02-05 15:36:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-02-05 15:36:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:03,511 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 15:36:03,511 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:36:03,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:03,514 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 1 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:03,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2720 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:36:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:36:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 435 states have (on average 1.6781609195402298) internal successors, (730), 454 states have internal predecessors, (730), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 915 transitions. [2025-02-05 15:36:03,547 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 915 transitions. Word has length 110 [2025-02-05 15:36:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 915 transitions. [2025-02-05 15:36:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 915 transitions. [2025-02-05 15:36:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:36:03,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:03,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:36:03,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:03,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1191988055, now seen corresponding path program 1 times [2025-02-05 15:36:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387490524] [2025-02-05 15:36:03,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:03,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:36:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:36:03,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:03,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387490524] [2025-02-05 15:36:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387490524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:36:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978873030] [2025-02-05 15:36:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:03,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:36:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:03,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:36:03,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:03,887 INFO L87 Difference]: Start difference. First operand 554 states and 915 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,050 INFO L93 Difference]: Finished difference Result 1056 states and 1744 transitions. [2025-02-05 15:36:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:36:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,056 INFO L225 Difference]: With dead ends: 1056 [2025-02-05 15:36:04,056 INFO L226 Difference]: Without dead ends: 569 [2025-02-05 15:36:04,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:04,060 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 91 mSDsluCounter, 6238 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7141 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7141 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-05 15:36:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 567. [2025-02-05 15:36:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6741573033707866) internal successors, (745), 466 states have internal predecessors, (745), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-02-05 15:36:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 934 transitions. [2025-02-05 15:36:04,093 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 934 transitions. Word has length 111 [2025-02-05 15:36:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,094 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 934 transitions. [2025-02-05 15:36:04,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 934 transitions. [2025-02-05 15:36:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:36:04,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:04,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:36:04,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash 382500598, now seen corresponding path program 1 times [2025-02-05 15:36:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043165100] [2025-02-05 15:36:04,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:36:04,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:36:04,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:04,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:04,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043165100] [2025-02-05 15:36:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043165100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056179347] [2025-02-05 15:36:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:04,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:04,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:04,247 INFO L87 Difference]: Start difference. First operand 567 states and 934 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,293 INFO L93 Difference]: Finished difference Result 1108 states and 1838 transitions. [2025-02-05 15:36:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-02-05 15:36:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,299 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 15:36:04,300 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:36:04,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:04,303 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 0 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2722 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:36:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:36:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.668997668997669) internal successors, (716), 448 states have internal predecessors, (716), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 901 transitions. [2025-02-05 15:36:04,329 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 901 transitions. Word has length 111 [2025-02-05 15:36:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,330 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 901 transitions. [2025-02-05 15:36:04,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 901 transitions. [2025-02-05 15:36:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:36:04,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:04,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:36:04,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1643754494, now seen corresponding path program 1 times [2025-02-05 15:36:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390101862] [2025-02-05 15:36:04,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:36:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:36:04,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390101862] [2025-02-05 15:36:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390101862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:04,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:04,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169805253] [2025-02-05 15:36:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:04,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:04,546 INFO L87 Difference]: Start difference. First operand 548 states and 901 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,771 INFO L93 Difference]: Finished difference Result 1053 states and 1736 transitions. [2025-02-05 15:36:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-02-05 15:36:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,779 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:36:04,780 INFO L226 Difference]: Without dead ends: 557 [2025-02-05 15:36:04,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:04,783 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 55 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4261 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4261 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:36:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-05 15:36:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-02-05 15:36:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.6596736596736597) internal successors, (712), 448 states have internal predecessors, (712), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 897 transitions. [2025-02-05 15:36:04,814 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 897 transitions. Word has length 112 [2025-02-05 15:36:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,815 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 897 transitions. [2025-02-05 15:36:04,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 897 transitions. [2025-02-05 15:36:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:36:04,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:36:04,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1975926002, now seen corresponding path program 1 times [2025-02-05 15:36:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884474523] [2025-02-05 15:36:04,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:36:04,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:36:04,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884474523] [2025-02-05 15:36:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884474523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131348766] [2025-02-05 15:36:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:05,008 INFO L87 Difference]: Start difference. First operand 548 states and 897 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,216 INFO L93 Difference]: Finished difference Result 1053 states and 1732 transitions. [2025-02-05 15:36:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-05 15:36:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,221 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:36:05,222 INFO L226 Difference]: Without dead ends: 557 [2025-02-05 15:36:05,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:05,228 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 54 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4261 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4261 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:36:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-05 15:36:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-02-05 15:36:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.6503496503496504) internal successors, (708), 448 states have internal predecessors, (708), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 893 transitions. [2025-02-05 15:36:05,255 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 893 transitions. Word has length 113 [2025-02-05 15:36:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,257 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 893 transitions. [2025-02-05 15:36:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 893 transitions. [2025-02-05 15:36:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:36:05,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:05,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:36:05,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -834268923, now seen corresponding path program 1 times [2025-02-05 15:36:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498307177] [2025-02-05 15:36:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:36:05,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:36:05,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498307177] [2025-02-05 15:36:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498307177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678340871] [2025-02-05 15:36:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:05,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:05,439 INFO L87 Difference]: Start difference. First operand 548 states and 893 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,615 INFO L93 Difference]: Finished difference Result 1053 states and 1728 transitions. [2025-02-05 15:36:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-02-05 15:36:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,621 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:36:05,621 INFO L226 Difference]: Without dead ends: 557 [2025-02-05 15:36:05,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:05,624 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 53 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4243 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-05 15:36:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-02-05 15:36:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.641025641025641) internal successors, (704), 448 states have internal predecessors, (704), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 889 transitions. [2025-02-05 15:36:05,650 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 889 transitions. Word has length 114 [2025-02-05 15:36:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,650 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 889 transitions. [2025-02-05 15:36:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 889 transitions. [2025-02-05 15:36:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:36:05,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:05,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:36:05,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1289753332, now seen corresponding path program 1 times [2025-02-05 15:36:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939856847] [2025-02-05 15:36:05,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:36:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:36:05,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939856847] [2025-02-05 15:36:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939856847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042778879] [2025-02-05 15:36:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:05,856 INFO L87 Difference]: Start difference. First operand 548 states and 889 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,930 INFO L93 Difference]: Finished difference Result 1044 states and 1710 transitions. [2025-02-05 15:36:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:05,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2025-02-05 15:36:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,937 INFO L225 Difference]: With dead ends: 1044 [2025-02-05 15:36:05,937 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 15:36:05,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:05,940 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 84 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5195 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5195 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 15:36:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-02-05 15:36:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 408 states have (on average 1.642156862745098) internal successors, (670), 427 states have internal predecessors, (670), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 855 transitions. [2025-02-05 15:36:05,962 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 855 transitions. Word has length 114 [2025-02-05 15:36:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,962 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 855 transitions. [2025-02-05 15:36:05,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 855 transitions. [2025-02-05 15:36:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:36:05,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:05,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:36:05,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1248565903, now seen corresponding path program 1 times [2025-02-05 15:36:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900157960] [2025-02-05 15:36:05,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:36:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:36:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:06,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900157960] [2025-02-05 15:36:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900157960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700835600] [2025-02-05 15:36:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:06,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:06,124 INFO L87 Difference]: Start difference. First operand 527 states and 855 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,222 INFO L93 Difference]: Finished difference Result 1023 states and 1676 transitions. [2025-02-05 15:36:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-05 15:36:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,228 INFO L225 Difference]: With dead ends: 1023 [2025-02-05 15:36:06,228 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 15:36:06,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:06,230 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 17 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4181 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 15:36:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-02-05 15:36:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 408 states have (on average 1.6397058823529411) internal successors, (669), 427 states have internal predecessors, (669), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 854 transitions. [2025-02-05 15:36:06,250 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 854 transitions. Word has length 115 [2025-02-05 15:36:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,250 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 854 transitions. [2025-02-05 15:36:06,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 854 transitions. [2025-02-05 15:36:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:36:06,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:06,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:36:06,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1642168840, now seen corresponding path program 1 times [2025-02-05 15:36:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027249759] [2025-02-05 15:36:06,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:06,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:36:06,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:36:06,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027249759] [2025-02-05 15:36:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027249759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80138633] [2025-02-05 15:36:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:06,413 INFO L87 Difference]: Start difference. First operand 527 states and 854 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,485 INFO L93 Difference]: Finished difference Result 1023 states and 1675 transitions. [2025-02-05 15:36:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-02-05 15:36:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,490 INFO L225 Difference]: With dead ends: 1023 [2025-02-05 15:36:06,490 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 15:36:06,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:06,493 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 16 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4181 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 15:36:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-02-05 15:36:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 408 states have (on average 1.6372549019607843) internal successors, (668), 427 states have internal predecessors, (668), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 853 transitions. [2025-02-05 15:36:06,513 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 853 transitions. Word has length 116 [2025-02-05 15:36:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,513 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 853 transitions. [2025-02-05 15:36:06,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 853 transitions. [2025-02-05 15:36:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:36:06,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:36:06,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash -385295404, now seen corresponding path program 1 times [2025-02-05 15:36:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860555558] [2025-02-05 15:36:06,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:36:06,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:36:06,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:06,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860555558] [2025-02-05 15:36:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860555558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:36:06,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180862915] [2025-02-05 15:36:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:36:06,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:36:06,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:06,831 INFO L87 Difference]: Start difference. First operand 527 states and 853 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,950 INFO L93 Difference]: Finished difference Result 1017 states and 1663 transitions. [2025-02-05 15:36:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2025-02-05 15:36:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,956 INFO L225 Difference]: With dead ends: 1017 [2025-02-05 15:36:06,956 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 15:36:06,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:06,959 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 6 mSDsluCounter, 6674 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7511 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7511 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 15:36:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-02-05 15:36:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 408 states have (on average 1.6348039215686274) internal successors, (667), 427 states have internal predecessors, (667), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 852 transitions. [2025-02-05 15:36:06,979 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 852 transitions. Word has length 117 [2025-02-05 15:36:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 852 transitions. [2025-02-05 15:36:06,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 852 transitions. [2025-02-05 15:36:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:36:06,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:06,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:36:06,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -863540421, now seen corresponding path program 1 times [2025-02-05 15:36:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800127361] [2025-02-05 15:36:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:07,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:07,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:07,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800127361] [2025-02-05 15:36:07,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800127361] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:07,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456530484] [2025-02-05 15:36:07,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:07,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:07,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:36:07,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:07,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:07,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:07,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:07,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456530484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:07,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:07,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:36:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189845447] [2025-02-05 15:36:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:07,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:36:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:07,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:36:07,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:07,736 INFO L87 Difference]: Start difference. First operand 527 states and 852 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:07,815 INFO L93 Difference]: Finished difference Result 1486 states and 2463 transitions. [2025-02-05 15:36:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:36:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:36:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:07,826 INFO L225 Difference]: With dead ends: 1486 [2025-02-05 15:36:07,827 INFO L226 Difference]: Without dead ends: 1004 [2025-02-05 15:36:07,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:07,832 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 792 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:07,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2351 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-02-05 15:36:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 984. [2025-02-05 15:36:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 765 states have (on average 1.6601307189542485) internal successors, (1270), 797 states have internal predecessors, (1270), 176 states have call successors, (176), 42 states have call predecessors, (176), 42 states have return successors, (177), 170 states have call predecessors, (177), 171 states have call successors, (177) [2025-02-05 15:36:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1623 transitions. [2025-02-05 15:36:07,888 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1623 transitions. Word has length 118 [2025-02-05 15:36:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:07,891 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1623 transitions. [2025-02-05 15:36:07,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1623 transitions. [2025-02-05 15:36:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:36:07,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:07,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:07,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:36:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:36:08,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1312237060, now seen corresponding path program 1 times [2025-02-05 15:36:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608255097] [2025-02-05 15:36:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:08,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:08,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:08,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608255097] [2025-02-05 15:36:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608255097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748883451] [2025-02-05 15:36:08,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:08,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:08,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:36:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:08,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:08,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:08,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:08,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:36:08,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:08,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748883451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:08,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:08,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:36:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661274620] [2025-02-05 15:36:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:08,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:08,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:08,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:08,826 INFO L87 Difference]: Start difference. First operand 984 states and 1623 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:08,891 INFO L93 Difference]: Finished difference Result 1929 states and 3208 transitions. [2025-02-05 15:36:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:08,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:36:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:08,901 INFO L225 Difference]: With dead ends: 1929 [2025-02-05 15:36:08,901 INFO L226 Difference]: Without dead ends: 990 [2025-02-05 15:36:08,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:08,908 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 0 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-02-05 15:36:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-02-05 15:36:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 771 states have (on average 1.6549935149156938) internal successors, (1276), 803 states have internal predecessors, (1276), 176 states have call successors, (176), 42 states have call predecessors, (176), 42 states have return successors, (177), 170 states have call predecessors, (177), 171 states have call successors, (177) [2025-02-05 15:36:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1629 transitions. [2025-02-05 15:36:08,955 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1629 transitions. Word has length 118 [2025-02-05 15:36:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:08,955 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1629 transitions. [2025-02-05 15:36:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1629 transitions. [2025-02-05 15:36:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:36:08,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:08,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:08,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:36:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:36:09,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2037077929, now seen corresponding path program 1 times [2025-02-05 15:36:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712305277] [2025-02-05 15:36:09,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:36:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:36:09,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:09,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:09,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712305277] [2025-02-05 15:36:09,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712305277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:09,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:09,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873889169] [2025-02-05 15:36:09,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:09,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:09,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:09,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:09,349 INFO L87 Difference]: Start difference. First operand 990 states and 1629 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:12,408 INFO L93 Difference]: Finished difference Result 3359 states and 5664 transitions. [2025-02-05 15:36:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 121 [2025-02-05 15:36:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:12,431 INFO L225 Difference]: With dead ends: 3359 [2025-02-05 15:36:12,431 INFO L226 Difference]: Without dead ends: 2414 [2025-02-05 15:36:12,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:12,439 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 3230 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 4125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:12,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 1798 Invalid, 4125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 15:36:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2025-02-05 15:36:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2335. [2025-02-05 15:36:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 1752 states have (on average 1.639840182648402) internal successors, (2873), 1840 states have internal predecessors, (2873), 490 states have call successors, (490), 79 states have call predecessors, (490), 92 states have return successors, (550), 487 states have call predecessors, (550), 485 states have call successors, (550) [2025-02-05 15:36:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3913 transitions. [2025-02-05 15:36:12,586 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3913 transitions. Word has length 121 [2025-02-05 15:36:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:12,587 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3913 transitions. [2025-02-05 15:36:12,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3913 transitions. [2025-02-05 15:36:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:36:12,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:12,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:36:12,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 769794426, now seen corresponding path program 1 times [2025-02-05 15:36:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858292426] [2025-02-05 15:36:12,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:12,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:36:12,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:36:12,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:12,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858292426] [2025-02-05 15:36:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858292426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:12,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457256846] [2025-02-05 15:36:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:12,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:12,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:12,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:12,865 INFO L87 Difference]: Start difference. First operand 2335 states and 3913 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:15,860 INFO L93 Difference]: Finished difference Result 8977 states and 15424 transitions. [2025-02-05 15:36:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 122 [2025-02-05 15:36:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:15,920 INFO L225 Difference]: With dead ends: 8977 [2025-02-05 15:36:15,920 INFO L226 Difference]: Without dead ends: 6688 [2025-02-05 15:36:15,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:15,942 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 3243 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 3251 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3286 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 4111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 3251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:15,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3286 Valid, 1811 Invalid, 4111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 3251 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 15:36:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2025-02-05 15:36:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5407. [2025-02-05 15:36:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5407 states, 3952 states have (on average 1.6272773279352226) internal successors, (6431), 4174 states have internal predecessors, (6431), 1254 states have call successors, (1254), 153 states have call predecessors, (1254), 200 states have return successors, (1506), 1261 states have call predecessors, (1506), 1249 states have call successors, (1506) [2025-02-05 15:36:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 9191 transitions. [2025-02-05 15:36:16,310 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 9191 transitions. Word has length 122 [2025-02-05 15:36:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,310 INFO L471 AbstractCegarLoop]: Abstraction has 5407 states and 9191 transitions. [2025-02-05 15:36:16,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 9191 transitions. [2025-02-05 15:36:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:36:16,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:16,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:36:16,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1066105874, now seen corresponding path program 1 times [2025-02-05 15:36:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749243378] [2025-02-05 15:36:16,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:36:16,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:36:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749243378] [2025-02-05 15:36:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749243378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:16,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:16,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174252755] [2025-02-05 15:36:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:16,503 INFO L87 Difference]: Start difference. First operand 5407 states and 9191 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:19,723 INFO L93 Difference]: Finished difference Result 22285 states and 38836 transitions. [2025-02-05 15:36:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 123 [2025-02-05 15:36:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:19,851 INFO L225 Difference]: With dead ends: 22285 [2025-02-05 15:36:19,851 INFO L226 Difference]: Without dead ends: 16926 [2025-02-05 15:36:19,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:19,889 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 3255 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:19,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 1832 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 15:36:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16926 states. [2025-02-05 15:36:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16926 to 13153. [2025-02-05 15:36:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13153 states, 9436 states have (on average 1.6151971174226367) internal successors, (15241), 10002 states have internal predecessors, (15241), 3262 states have call successors, (3262), 301 states have call predecessors, (3262), 454 states have return successors, (4120), 3301 states have call predecessors, (4120), 3257 states have call successors, (4120) [2025-02-05 15:36:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13153 states to 13153 states and 22623 transitions. [2025-02-05 15:36:21,052 INFO L78 Accepts]: Start accepts. Automaton has 13153 states and 22623 transitions. Word has length 123 [2025-02-05 15:36:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 13153 states and 22623 transitions. [2025-02-05 15:36:21,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13153 states and 22623 transitions. [2025-02-05 15:36:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:36:21,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:21,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:21,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:36:21,061 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash 945709599, now seen corresponding path program 1 times [2025-02-05 15:36:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:21,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687491081] [2025-02-05 15:36:21,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:36:21,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:36:21,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:21,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:21,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687491081] [2025-02-05 15:36:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687491081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388600316] [2025-02-05 15:36:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:21,227 INFO L87 Difference]: Start difference. First operand 13153 states and 22623 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,463 INFO L93 Difference]: Finished difference Result 57449 states and 101136 transitions. [2025-02-05 15:36:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:25,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 124 [2025-02-05 15:36:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,894 INFO L225 Difference]: With dead ends: 57449 [2025-02-05 15:36:25,894 INFO L226 Difference]: Without dead ends: 44348 [2025-02-05 15:36:25,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:25,970 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 3267 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 866 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 866 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3312 Valid, 1853 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [866 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:36:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44348 states. [2025-02-05 15:36:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44348 to 33711. [2025-02-05 15:36:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33711 states, 23900 states have (on average 1.604979079497908) internal successors, (38359), 25378 states have internal predecessors, (38359), 8726 states have call successors, (8726), 597 states have call predecessors, (8726), 1084 states have return successors, (11450), 8865 states have call predecessors, (11450), 8721 states have call successors, (11450) [2025-02-05 15:36:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33711 states to 33711 states and 58535 transitions. [2025-02-05 15:36:28,408 INFO L78 Accepts]: Start accepts. Automaton has 33711 states and 58535 transitions. Word has length 124 [2025-02-05 15:36:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:28,409 INFO L471 AbstractCegarLoop]: Abstraction has 33711 states and 58535 transitions. [2025-02-05 15:36:28,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33711 states and 58535 transitions. [2025-02-05 15:36:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:36:28,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:28,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:28,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:36:28,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:28,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1977629747, now seen corresponding path program 1 times [2025-02-05 15:36:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403396233] [2025-02-05 15:36:28,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:28,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:36:28,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:36:28,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:28,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403396233] [2025-02-05 15:36:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403396233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:28,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141894580] [2025-02-05 15:36:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:28,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:28,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:28,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:28,563 INFO L87 Difference]: Start difference. First operand 33711 states and 58535 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:37,257 INFO L93 Difference]: Finished difference Result 154781 states and 274288 transitions. [2025-02-05 15:36:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 125 [2025-02-05 15:36:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:38,283 INFO L225 Difference]: With dead ends: 154781 [2025-02-05 15:36:38,283 INFO L226 Difference]: Without dead ends: 121130 [2025-02-05 15:36:38,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:38,445 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 3279 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3325 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3325 Valid, 1874 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:36:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121130 states. [2025-02-05 15:36:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121130 to 90853. [2025-02-05 15:36:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90853 states, 64084 states have (on average 1.597606266774858) internal successors, (102381), 68050 states have internal predecessors, (102381), 24030 states have call successors, (24030), 1189 states have call predecessors, (24030), 2738 states have return successors, (32448), 24477 states have call predecessors, (32448), 24025 states have call successors, (32448) [2025-02-05 15:36:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90853 states to 90853 states and 158859 transitions. [2025-02-05 15:36:45,946 INFO L78 Accepts]: Start accepts. Automaton has 90853 states and 158859 transitions. Word has length 125 [2025-02-05 15:36:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 90853 states and 158859 transitions. [2025-02-05 15:36:45,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 90853 states and 158859 transitions. [2025-02-05 15:36:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:36:45,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:45,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:36:45,955 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:45,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash -355762891, now seen corresponding path program 1 times [2025-02-05 15:36:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548858409] [2025-02-05 15:36:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:45,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:36:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:36:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:46,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:46,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548858409] [2025-02-05 15:36:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548858409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:36:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932691396] [2025-02-05 15:36:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:36:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:46,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:36:46,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:46,162 INFO L87 Difference]: Start difference. First operand 90853 states and 158859 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:54,830 INFO L93 Difference]: Finished difference Result 191557 states and 334675 transitions. [2025-02-05 15:36:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 15:36:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 125 [2025-02-05 15:36:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:55,531 INFO L225 Difference]: With dead ends: 191557 [2025-02-05 15:36:55,532 INFO L226 Difference]: Without dead ends: 100780 [2025-02-05 15:36:55,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:36:55,857 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2418 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 5545 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2502 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 6076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 5545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:55,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2502 Valid, 3270 Invalid, 6076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 5545 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 15:36:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100780 states.