./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_spec3_product32.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 d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:47:30,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:47:30,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:47:30,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:47:30,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:47:30,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:47:30,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:47:30,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:47:30,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:47:30,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:47:30,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:47:30,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:47:30,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:47:30,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:47:30,526 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:47:30,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:47:30,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:47:30,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:47:30,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:47:30,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:30,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:30,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:47:30,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:30,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:30,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:30,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:47:30,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:47:30,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:47:30,531 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 -> d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c [2025-01-09 03:47:30,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:47:30,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:47:30,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:47:30,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:47:30,852 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:47:30,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-01-09 03:47:32,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71cbb264f/51513f89d5b8459a9ff3e69c47eab69d/FLAG0e5ce368a [2025-01-09 03:47:32,598 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:47:32,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-01-09 03:47:32,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71cbb264f/51513f89d5b8459a9ff3e69c47eab69d/FLAG0e5ce368a [2025-01-09 03:47:32,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71cbb264f/51513f89d5b8459a9ff3e69c47eab69d [2025-01-09 03:47:32,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:47:32,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:47:32,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:32,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:47:32,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:47:32,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:32" (1/1) ... [2025-01-09 03:47:32,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3febd2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:32, skipping insertion in model container [2025-01-09 03:47:32,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:32" (1/1) ... [2025-01-09 03:47:32,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:47:32,869 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_spec3_product32.cil.c[3233,3246] [2025-01-09 03:47:33,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:33,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:47:33,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-01-09 03:47:33,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [151] [2025-01-09 03:47:33,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [160] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [198] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [564] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [753] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [873] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1540] [2025-01-09 03:47:33,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1558] [2025-01-09 03:47:33,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1907] [2025-01-09 03:47:33,170 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_spec3_product32.cil.c[3233,3246] [2025-01-09 03:47:33,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:33,328 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:47:33,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33 WrapperNode [2025-01-09 03:47:33,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:33,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:33,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:47:33,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:47:33,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,431 INFO L138 Inliner]: procedures = 97, calls = 361, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 1006 [2025-01-09 03:47:33,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:33,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:47:33,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:47:33,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:47:33,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,500 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-01-09 03:47:33,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:47:33,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:47:33,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:47:33,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:47:33,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (1/1) ... [2025-01-09 03:47:33,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:33,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:33,625 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-01-09 03:47:33,628 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-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-01-09 03:47:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:47:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:47:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:47:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:47:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:47:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:47:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:47:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:47:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:47:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:47:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:47:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:47:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:47:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:47:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:47:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:47:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:47:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:47:33,663 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:47:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:47:33,663 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-01-09 03:47:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-01-09 03:47:33,870 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:47:33,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:47:35,194 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2025-01-09 03:47:35,194 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:47:35,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:47:35,232 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:47:35,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:35 BoogieIcfgContainer [2025-01-09 03:47:35,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:47:35,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:47:35,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:47:35,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:47:35,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:32" (1/3) ... [2025-01-09 03:47:35,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a32037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:35, skipping insertion in model container [2025-01-09 03:47:35,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:33" (2/3) ... [2025-01-09 03:47:35,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a32037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:35, skipping insertion in model container [2025-01-09 03:47:35,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:35" (3/3) ... [2025-01-09 03:47:35,242 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product32.cil.c [2025-01-09 03:47:35,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:47:35,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product32.cil.c that has 30 procedures, 628 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:47:35,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:47:35,354 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;@7380db30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:47:35,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:47:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 628 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 502 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 03:47:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:47:35,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:35,375 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] [2025-01-09 03:47:35,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -180585635, now seen corresponding path program 1 times [2025-01-09 03:47:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452837698] [2025-01-09 03:47:35,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:47:35,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:47:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:36,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452837698] [2025-01-09 03:47:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452837698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880769082] [2025-01-09 03:47:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:36,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:36,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:36,276 INFO L87 Difference]: Start difference. First operand has 628 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 502 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:36,587 INFO L93 Difference]: Finished difference Result 1253 states and 2072 transitions. [2025-01-09 03:47:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-01-09 03:47:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:36,614 INFO L225 Difference]: With dead ends: 1253 [2025-01-09 03:47:36,615 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 03:47:36,626 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-01-09 03:47:36,631 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 91 mSDsluCounter, 4980 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5993 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:36,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5993 Invalid, 77 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 03:47:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2025-01-09 03:47:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 485 states have (on average 1.6536082474226803) internal successors, (802), 505 states have internal predecessors, (802), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-01-09 03:47:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1033 transitions. [2025-01-09 03:47:36,751 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1033 transitions. Word has length 67 [2025-01-09 03:47:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1033 transitions. [2025-01-09 03:47:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1033 transitions. [2025-01-09 03:47:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:47:36,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:36,760 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] [2025-01-09 03:47:36,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:47:36,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1539944757, now seen corresponding path program 1 times [2025-01-09 03:47:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100231136] [2025-01-09 03:47:36,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:47:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:47:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:36,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100231136] [2025-01-09 03:47:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100231136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:37,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:37,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644293652] [2025-01-09 03:47:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:37,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:37,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:37,075 INFO L87 Difference]: Start difference. First operand 631 states and 1033 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:37,244 INFO L93 Difference]: Finished difference Result 1257 states and 2069 transitions. [2025-01-09 03:47:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-01-09 03:47:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:37,254 INFO L225 Difference]: With dead ends: 1257 [2025-01-09 03:47:37,254 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 03:47:37,259 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-01-09 03:47:37,260 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 90 mSDsluCounter, 4979 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5994 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:37,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5994 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 03:47:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 631. [2025-01-09 03:47:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 485 states have (on average 1.6536082474226803) internal successors, (802), 505 states have internal predecessors, (802), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-01-09 03:47:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1033 transitions. [2025-01-09 03:47:37,323 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1033 transitions. Word has length 68 [2025-01-09 03:47:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:37,323 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1033 transitions. [2025-01-09 03:47:37,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1033 transitions. [2025-01-09 03:47:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:47:37,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:37,326 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] [2025-01-09 03:47:37,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:47:37,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:37,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1251154025, now seen corresponding path program 1 times [2025-01-09 03:47:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015312612] [2025-01-09 03:47:37,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:37,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:47:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:47:37,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015312612] [2025-01-09 03:47:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015312612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737776837] [2025-01-09 03:47:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:37,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:37,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:37,543 INFO L87 Difference]: Start difference. First operand 631 states and 1033 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:37,638 INFO L93 Difference]: Finished difference Result 1244 states and 2047 transitions. [2025-01-09 03:47:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:37,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-01-09 03:47:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:37,649 INFO L225 Difference]: With dead ends: 1244 [2025-01-09 03:47:37,649 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 03:47:37,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:37,656 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 14 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:37,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3004 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 03:47:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-01-09 03:47:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 458 states have (on average 1.6375545851528384) internal successors, (750), 476 states have internal predecessors, (750), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 977 transitions. [2025-01-09 03:47:37,707 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 977 transitions. Word has length 68 [2025-01-09 03:47:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 977 transitions. [2025-01-09 03:47:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 977 transitions. [2025-01-09 03:47:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:47:37,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:37,710 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] [2025-01-09 03:47:37,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:47:37,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1694698175, now seen corresponding path program 1 times [2025-01-09 03:47:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325354476] [2025-01-09 03:47:37,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:37,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:47:37,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:47:37,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:37,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325354476] [2025-01-09 03:47:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325354476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475929881] [2025-01-09 03:47:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:37,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:37,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:37,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:37,965 INFO L87 Difference]: Start difference. First operand 601 states and 977 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:38,073 INFO L93 Difference]: Finished difference Result 1195 states and 1953 transitions. [2025-01-09 03:47:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-01-09 03:47:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:38,082 INFO L225 Difference]: With dead ends: 1195 [2025-01-09 03:47:38,082 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 03:47:38,086 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-01-09 03:47:38,088 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 63 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5744 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:38,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5744 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 03:47:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-01-09 03:47:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 452 states have (on average 1.6305309734513274) internal successors, (737), 470 states have internal predecessors, (737), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 964 transitions. [2025-01-09 03:47:38,128 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 964 transitions. Word has length 69 [2025-01-09 03:47:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:38,129 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 964 transitions. [2025-01-09 03:47:38,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 964 transitions. [2025-01-09 03:47:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:47:38,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:38,131 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] [2025-01-09 03:47:38,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:47:38,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1133586863, now seen corresponding path program 1 times [2025-01-09 03:47:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462819363] [2025-01-09 03:47:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:47:38,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:47:38,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:38,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462819363] [2025-01-09 03:47:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462819363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082372464] [2025-01-09 03:47:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:38,373 INFO L87 Difference]: Start difference. First operand 595 states and 964 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:38,461 INFO L93 Difference]: Finished difference Result 1183 states and 1927 transitions. [2025-01-09 03:47:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:38,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-01-09 03:47:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:38,468 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 03:47:38,468 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:38,472 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-01-09 03:47:38,473 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 49 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5684 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:38,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5684 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 464 states have internal predecessors, (724), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 951 transitions. [2025-01-09 03:47:38,508 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 951 transitions. Word has length 70 [2025-01-09 03:47:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:38,508 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 951 transitions. [2025-01-09 03:47:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 951 transitions. [2025-01-09 03:47:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:47:38,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:38,510 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] [2025-01-09 03:47:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:47:38,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2028476656, now seen corresponding path program 1 times [2025-01-09 03:47:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022621177] [2025-01-09 03:47:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:38,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:47:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:47:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:38,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022621177] [2025-01-09 03:47:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022621177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:38,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660917226] [2025-01-09 03:47:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:38,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:38,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:38,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:38,698 INFO L87 Difference]: Start difference. First operand 589 states and 951 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:38,773 INFO L93 Difference]: Finished difference Result 1171 states and 1901 transitions. [2025-01-09 03:47:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-01-09 03:47:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:38,778 INFO L225 Difference]: With dead ends: 1171 [2025-01-09 03:47:38,779 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:38,782 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-01-09 03:47:38,782 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 24 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:38,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5636 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6210762331838564) internal successors, (723), 464 states have internal predecessors, (723), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 950 transitions. [2025-01-09 03:47:38,813 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 950 transitions. Word has length 70 [2025-01-09 03:47:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:38,814 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 950 transitions. [2025-01-09 03:47:38,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 950 transitions. [2025-01-09 03:47:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:47:38,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:38,815 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] [2025-01-09 03:47:38,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:47:38,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1946783525, now seen corresponding path program 1 times [2025-01-09 03:47:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:38,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502732432] [2025-01-09 03:47:38,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:38,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:47:38,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:47:38,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:38,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502732432] [2025-01-09 03:47:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502732432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212386234] [2025-01-09 03:47:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:38,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:38,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:38,920 INFO L87 Difference]: Start difference. First operand 589 states and 950 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:38,977 INFO L93 Difference]: Finished difference Result 1162 states and 1886 transitions. [2025-01-09 03:47:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-01-09 03:47:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:38,983 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 03:47:38,983 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:38,986 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-01-09 03:47:38,987 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 15 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:38,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2790 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6188340807174888) internal successors, (722), 464 states have internal predecessors, (722), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 949 transitions. [2025-01-09 03:47:39,013 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 949 transitions. Word has length 71 [2025-01-09 03:47:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:39,013 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 949 transitions. [2025-01-09 03:47:39,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 949 transitions. [2025-01-09 03:47:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:47:39,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:39,015 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] [2025-01-09 03:47:39,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:47:39,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:39,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 96641359, now seen corresponding path program 1 times [2025-01-09 03:47:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138244301] [2025-01-09 03:47:39,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:47:39,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:47:39,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138244301] [2025-01-09 03:47:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138244301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:39,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707656553] [2025-01-09 03:47:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:39,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:39,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:39,120 INFO L87 Difference]: Start difference. First operand 589 states and 949 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:39,172 INFO L93 Difference]: Finished difference Result 1162 states and 1884 transitions. [2025-01-09 03:47:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-01-09 03:47:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:39,178 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 03:47:39,178 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:39,181 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-01-09 03:47:39,181 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 14 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:39,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2792 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.616591928251121) internal successors, (721), 464 states have internal predecessors, (721), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 948 transitions. [2025-01-09 03:47:39,212 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 948 transitions. Word has length 72 [2025-01-09 03:47:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:39,212 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 948 transitions. [2025-01-09 03:47:39,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 948 transitions. [2025-01-09 03:47:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:47:39,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:39,215 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] [2025-01-09 03:47:39,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:47:39,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1741641558, now seen corresponding path program 1 times [2025-01-09 03:47:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106201599] [2025-01-09 03:47:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:39,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:47:39,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:47:39,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:39,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:39,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106201599] [2025-01-09 03:47:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106201599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669877849] [2025-01-09 03:47:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:39,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:39,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:39,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:39,326 INFO L87 Difference]: Start difference. First operand 589 states and 948 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:39,388 INFO L93 Difference]: Finished difference Result 1162 states and 1882 transitions. [2025-01-09 03:47:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-01-09 03:47:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:39,393 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 03:47:39,393 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:39,396 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-01-09 03:47:39,397 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 13 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2794 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-01-09 03:47:39,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2794 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6143497757847534) internal successors, (720), 464 states have internal predecessors, (720), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 947 transitions. [2025-01-09 03:47:39,417 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 947 transitions. Word has length 73 [2025-01-09 03:47:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:39,418 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 947 transitions. [2025-01-09 03:47:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 947 transitions. [2025-01-09 03:47:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:47:39,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:39,420 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] [2025-01-09 03:47:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:47:39,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1082679540, now seen corresponding path program 1 times [2025-01-09 03:47:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249838186] [2025-01-09 03:47:39,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:47:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:47:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249838186] [2025-01-09 03:47:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249838186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265591961] [2025-01-09 03:47:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:39,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:39,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:39,523 INFO L87 Difference]: Start difference. First operand 589 states and 947 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:39,571 INFO L93 Difference]: Finished difference Result 1162 states and 1880 transitions. [2025-01-09 03:47:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-01-09 03:47:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:39,576 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 03:47:39,577 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 03:47:39,579 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-01-09 03:47:39,580 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 12 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:39,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2796 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 03:47:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-09 03:47:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6121076233183858) internal successors, (719), 464 states have internal predecessors, (719), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 03:47:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 946 transitions. [2025-01-09 03:47:39,601 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 946 transitions. Word has length 74 [2025-01-09 03:47:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:39,602 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 946 transitions. [2025-01-09 03:47:39,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 946 transitions. [2025-01-09 03:47:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:47:39,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:39,603 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] [2025-01-09 03:47:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:47:39,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:39,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1876130257, now seen corresponding path program 1 times [2025-01-09 03:47:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173216864] [2025-01-09 03:47:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:47:39,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:47:39,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173216864] [2025-01-09 03:47:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173216864] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863779903] [2025-01-09 03:47:39,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:39,770 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-01-09 03:47:39,771 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-01-09 03:47:39,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:47:40,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:47:40,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:40,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:40,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:40,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863779903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:47:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272197476] [2025-01-09 03:47:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:40,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:40,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:40,197 INFO L87 Difference]: Start difference. First operand 589 states and 946 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:40,271 INFO L93 Difference]: Finished difference Result 1678 states and 2726 transitions. [2025-01-09 03:47:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-01-09 03:47:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:40,283 INFO L225 Difference]: With dead ends: 1678 [2025-01-09 03:47:40,283 INFO L226 Difference]: Without dead ends: 1107 [2025-01-09 03:47:40,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:40,288 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 906 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:40,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2454 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-01-09 03:47:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1092. [2025-01-09 03:47:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 834 states have (on average 1.6235011990407673) internal successors, (1354), 869 states have internal predecessors, (1354), 205 states have call successors, (205), 53 states have call predecessors, (205), 52 states have return successors, (207), 197 states have call predecessors, (207), 202 states have call successors, (207) [2025-01-09 03:47:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1766 transitions. [2025-01-09 03:47:40,336 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1766 transitions. Word has length 75 [2025-01-09 03:47:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1766 transitions. [2025-01-09 03:47:40,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1766 transitions. [2025-01-09 03:47:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:47:40,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:40,338 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] [2025-01-09 03:47:40,349 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-01-09 03:47:40,542 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,SelfDestructingSolverStorable10 [2025-01-09 03:47:40,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2084119951, now seen corresponding path program 1 times [2025-01-09 03:47:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861437567] [2025-01-09 03:47:40,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:40,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:47:40,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:47:40,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:40,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861437567] [2025-01-09 03:47:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861437567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397817726] [2025-01-09 03:47:40,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:40,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:40,747 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-01-09 03:47:40,750 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-01-09 03:47:40,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:47:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:47:41,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:41,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:41,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:41,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:41,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397817726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:41,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:47:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057204994] [2025-01-09 03:47:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:41,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:41,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:41,174 INFO L87 Difference]: Start difference. First operand 1092 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:41,276 INFO L93 Difference]: Finished difference Result 2684 states and 4368 transitions. [2025-01-09 03:47:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-01-09 03:47:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:41,291 INFO L225 Difference]: With dead ends: 2684 [2025-01-09 03:47:41,292 INFO L226 Difference]: Without dead ends: 1610 [2025-01-09 03:47:41,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:41,299 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 908 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:41,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1845 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-01-09 03:47:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1562. [2025-01-09 03:47:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1195 states have (on average 1.6343096234309624) internal successors, (1953), 1247 states have internal predecessors, (1953), 292 states have call successors, (292), 74 states have call predecessors, (292), 74 states have return successors, (299), 282 states have call predecessors, (299), 289 states have call successors, (299) [2025-01-09 03:47:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2544 transitions. [2025-01-09 03:47:41,384 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2544 transitions. Word has length 76 [2025-01-09 03:47:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:41,384 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2544 transitions. [2025-01-09 03:47:41,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2544 transitions. [2025-01-09 03:47:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:47:41,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:41,387 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] [2025-01-09 03:47:41,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:47:41,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:41,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash 557650576, now seen corresponding path program 1 times [2025-01-09 03:47:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111754438] [2025-01-09 03:47:41,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:41,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:47:41,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:47:41,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:41,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111754438] [2025-01-09 03:47:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111754438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094364714] [2025-01-09 03:47:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:41,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:41,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:41,773 INFO L87 Difference]: Start difference. First operand 1562 states and 2544 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:42,585 INFO L93 Difference]: Finished difference Result 4610 states and 7681 transitions. [2025-01-09 03:47:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-01-09 03:47:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:42,621 INFO L225 Difference]: With dead ends: 4610 [2025-01-09 03:47:42,622 INFO L226 Difference]: Without dead ends: 3066 [2025-01-09 03:47:42,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:42,637 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 941 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 4958 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:42,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 4958 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:47:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-01-09 03:47:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3019. [2025-01-09 03:47:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2311 states have (on average 1.6339247079186499) internal successors, (3776), 2411 states have internal predecessors, (3776), 563 states have call successors, (563), 142 states have call predecessors, (563), 144 states have return successors, (679), 549 states have call predecessors, (679), 559 states have call successors, (679) [2025-01-09 03:47:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 5018 transitions. [2025-01-09 03:47:42,838 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 5018 transitions. Word has length 78 [2025-01-09 03:47:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 5018 transitions. [2025-01-09 03:47:42,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 5018 transitions. [2025-01-09 03:47:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:47:42,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:42,841 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] [2025-01-09 03:47:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:47:42,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1058924002, now seen corresponding path program 1 times [2025-01-09 03:47:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805781521] [2025-01-09 03:47:42,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:42,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:42,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:42,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:42,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805781521] [2025-01-09 03:47:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805781521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429424698] [2025-01-09 03:47:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:43,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:43,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:43,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:43,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:47:43,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:43,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:43,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:43,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:47:43,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:43,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429424698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 03:47:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458128711] [2025-01-09 03:47:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:43,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:43,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:43,517 INFO L87 Difference]: Start difference. First operand 3019 states and 5018 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:47:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:44,537 INFO L93 Difference]: Finished difference Result 8192 states and 13882 transitions. [2025-01-09 03:47:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-01-09 03:47:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:44,590 INFO L225 Difference]: With dead ends: 8192 [2025-01-09 03:47:44,590 INFO L226 Difference]: Without dead ends: 5191 [2025-01-09 03:47:44,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:47:44,618 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 805 mSDsluCounter, 3240 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:44,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 4164 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 03:47:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-01-09 03:47:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5148. [2025-01-09 03:47:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 3934 states have (on average 1.5882053889171326) internal successors, (6248), 4100 states have internal predecessors, (6248), 950 states have call successors, (950), 256 states have call predecessors, (950), 263 states have return successors, (1283), 931 states have call predecessors, (1283), 944 states have call successors, (1283) [2025-01-09 03:47:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 8481 transitions. [2025-01-09 03:47:44,898 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 8481 transitions. Word has length 79 [2025-01-09 03:47:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 8481 transitions. [2025-01-09 03:47:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:47:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 8481 transitions. [2025-01-09 03:47:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:47:44,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:44,900 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] [2025-01-09 03:47:44,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:47:45,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:45,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:45,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash 309832731, now seen corresponding path program 1 times [2025-01-09 03:47:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030557270] [2025-01-09 03:47:45,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:45,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:45,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:45,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030557270] [2025-01-09 03:47:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030557270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141762508] [2025-01-09 03:47:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:45,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:45,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:45,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:45,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:45,245 INFO L87 Difference]: Start difference. First operand 5148 states and 8481 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:45,541 INFO L93 Difference]: Finished difference Result 10302 states and 17137 transitions. [2025-01-09 03:47:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-01-09 03:47:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:45,594 INFO L225 Difference]: With dead ends: 10302 [2025-01-09 03:47:45,594 INFO L226 Difference]: Without dead ends: 5172 [2025-01-09 03:47:45,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:45,625 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 12 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:45,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2760 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2025-01-09 03:47:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5156. [2025-01-09 03:47:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 3940 states have (on average 1.5868020304568529) internal successors, (6252), 4106 states have internal predecessors, (6252), 950 states have call successors, (950), 260 states have call predecessors, (950), 265 states have return successors, (1272), 929 states have call predecessors, (1272), 944 states have call successors, (1272) [2025-01-09 03:47:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 8474 transitions. [2025-01-09 03:47:45,931 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 8474 transitions. Word has length 79 [2025-01-09 03:47:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:45,932 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 8474 transitions. [2025-01-09 03:47:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 8474 transitions. [2025-01-09 03:47:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:47:45,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:45,933 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-01-09 03:47:45,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:47:45,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1419786717, now seen corresponding path program 1 times [2025-01-09 03:47:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461437758] [2025-01-09 03:47:45,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:45,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:47:45,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:47:45,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 03:47:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461437758] [2025-01-09 03:47:46,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461437758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634688262] [2025-01-09 03:47:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:46,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:46,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:46,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:46,167 INFO L87 Difference]: Start difference. First operand 5156 states and 8474 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:47:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:47,089 INFO L93 Difference]: Finished difference Result 15401 states and 26333 transitions. [2025-01-09 03:47:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-01-09 03:47:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:47,301 INFO L225 Difference]: With dead ends: 15401 [2025-01-09 03:47:47,301 INFO L226 Difference]: Without dead ends: 10263 [2025-01-09 03:47:47,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:47,326 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 938 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 4698 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:47,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 4698 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:47:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2025-01-09 03:47:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 10194. [2025-01-09 03:47:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10194 states, 7792 states have (on average 1.582777207392197) internal successors, (12333), 8118 states have internal predecessors, (12333), 1872 states have call successors, (1872), 514 states have call predecessors, (1872), 529 states have return successors, (3066), 1841 states have call predecessors, (3066), 1862 states have call successors, (3066) [2025-01-09 03:47:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10194 states to 10194 states and 17271 transitions. [2025-01-09 03:47:47,897 INFO L78 Accepts]: Start accepts. Automaton has 10194 states and 17271 transitions. Word has length 87 [2025-01-09 03:47:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:47,898 INFO L471 AbstractCegarLoop]: Abstraction has 10194 states and 17271 transitions. [2025-01-09 03:47:47,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:47:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 10194 states and 17271 transitions. [2025-01-09 03:47:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:47:47,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:47,901 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-01-09 03:47:47,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:47:47,901 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:47,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1673882320, now seen corresponding path program 1 times [2025-01-09 03:47:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069067360] [2025-01-09 03:47:47,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:47,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:47:47,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:47:47,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:47:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069067360] [2025-01-09 03:47:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069067360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:47,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363632627] [2025-01-09 03:47:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:47,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:47,991 INFO L87 Difference]: Start difference. First operand 10194 states and 17271 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:47:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:48,512 INFO L93 Difference]: Finished difference Result 20442 states and 35115 transitions. [2025-01-09 03:47:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:48,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-01-09 03:47:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:48,611 INFO L225 Difference]: With dead ends: 20442 [2025-01-09 03:47:48,611 INFO L226 Difference]: Without dead ends: 10266 [2025-01-09 03:47:48,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:48,674 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 12 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:48,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2751 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10266 states. [2025-01-09 03:47:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10266 to 10234. [2025-01-09 03:47:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10234 states, 7828 states have (on average 1.5806080735820134) internal successors, (12373), 8146 states have internal predecessors, (12373), 1872 states have call successors, (1872), 530 states have call predecessors, (1872), 533 states have return successors, (3050), 1837 states have call predecessors, (3050), 1862 states have call successors, (3050) [2025-01-09 03:47:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10234 states to 10234 states and 17295 transitions. [2025-01-09 03:47:49,254 INFO L78 Accepts]: Start accepts. Automaton has 10234 states and 17295 transitions. Word has length 88 [2025-01-09 03:47:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:49,256 INFO L471 AbstractCegarLoop]: Abstraction has 10234 states and 17295 transitions. [2025-01-09 03:47:49,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:47:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10234 states and 17295 transitions. [2025-01-09 03:47:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:47:49,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:49,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:47:49,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:47:49,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 166911353, now seen corresponding path program 1 times [2025-01-09 03:47:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49191012] [2025-01-09 03:47:49,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:49,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:47:49,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:47:49,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:49,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:47:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49191012] [2025-01-09 03:47:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49191012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076726736] [2025-01-09 03:47:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:49,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:49,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:49,443 INFO L87 Difference]: Start difference. First operand 10234 states and 17295 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:47:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:50,796 INFO L93 Difference]: Finished difference Result 30713 states and 54978 transitions. [2025-01-09 03:47:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-01-09 03:47:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:51,086 INFO L225 Difference]: With dead ends: 30713 [2025-01-09 03:47:51,086 INFO L226 Difference]: Without dead ends: 20497 [2025-01-09 03:47:51,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:51,159 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 934 mSDsluCounter, 3756 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 4792 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:51,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 4792 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:47:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20497 states. [2025-01-09 03:47:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20497 to 20396. [2025-01-09 03:47:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20396 states, 15604 states have (on average 1.5772237887721097) internal successors, (24611), 16234 states have internal predecessors, (24611), 3722 states have call successors, (3722), 1054 states have call predecessors, (3722), 1069 states have return successors, (7782), 3667 states have call predecessors, (7782), 3704 states have call successors, (7782) [2025-01-09 03:47:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20396 states to 20396 states and 36115 transitions. [2025-01-09 03:47:52,562 INFO L78 Accepts]: Start accepts. Automaton has 20396 states and 36115 transitions. Word has length 97 [2025-01-09 03:47:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:52,563 INFO L471 AbstractCegarLoop]: Abstraction has 20396 states and 36115 transitions. [2025-01-09 03:47:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:47:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20396 states and 36115 transitions. [2025-01-09 03:47:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:47:52,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:52,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:47:52,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:47:52,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:52,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -543583518, now seen corresponding path program 1 times [2025-01-09 03:47:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966878808] [2025-01-09 03:47:52,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:52,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:47:52,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:47:52,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:52,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 03:47:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966878808] [2025-01-09 03:47:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966878808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942690620] [2025-01-09 03:47:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:52,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:52,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:52,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:52,809 INFO L87 Difference]: Start difference. First operand 20396 states and 36115 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:47:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:53,792 INFO L93 Difference]: Finished difference Result 40918 states and 74065 transitions. [2025-01-09 03:47:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:53,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-01-09 03:47:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:54,015 INFO L225 Difference]: With dead ends: 40918 [2025-01-09 03:47:54,015 INFO L226 Difference]: Without dead ends: 20540 [2025-01-09 03:47:54,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:54,159 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 11 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:54,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2751 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20540 states. [2025-01-09 03:47:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20540 to 20476. [2025-01-09 03:47:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20476 states, 15676 states have (on average 1.5750829293187039) internal successors, (24691), 16306 states have internal predecessors, (24691), 3722 states have call successors, (3722), 1070 states have call predecessors, (3722), 1077 states have return successors, (7762), 3659 states have call predecessors, (7762), 3704 states have call successors, (7762) [2025-01-09 03:47:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20476 states to 20476 states and 36175 transitions. [2025-01-09 03:47:55,326 INFO L78 Accepts]: Start accepts. Automaton has 20476 states and 36175 transitions. Word has length 98 [2025-01-09 03:47:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,326 INFO L471 AbstractCegarLoop]: Abstraction has 20476 states and 36175 transitions. [2025-01-09 03:47:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:47:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20476 states and 36175 transitions. [2025-01-09 03:47:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:47:55,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,330 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 03:47:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:47:55,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -732537949, now seen corresponding path program 1 times [2025-01-09 03:47:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165306028] [2025-01-09 03:47:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:47:55,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:47:55,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:47:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165306028] [2025-01-09 03:47:55,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165306028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169227737] [2025-01-09 03:47:55,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:55,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:55,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:47:55,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:47:56,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:47:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:56,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:56,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:47:56,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:47:56,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169227737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:47:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831171569] [2025-01-09 03:47:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:47:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:56,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:47:56,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:47:56,251 INFO L87 Difference]: Start difference. First operand 20476 states and 36175 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:48:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:03,463 INFO L93 Difference]: Finished difference Result 72917 states and 136718 transitions. [2025-01-09 03:48:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:48:03,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 136 [2025-01-09 03:48:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,176 INFO L225 Difference]: With dead ends: 72917 [2025-01-09 03:48:04,176 INFO L226 Difference]: Without dead ends: 52459 [2025-01-09 03:48:04,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:48:04,601 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 2722 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 7038 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2914 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 7601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 7038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2914 Valid, 2457 Invalid, 7601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [563 Valid, 7038 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 03:48:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52459 states. [2025-01-09 03:48:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52459 to 51798. [2025-01-09 03:48:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51798 states, 39708 states have (on average 1.570288103153017) internal successors, (62353), 41234 states have internal predecessors, (62353), 9300 states have call successors, (9300), 2646 states have call predecessors, (9300), 2789 states have return successors, (23574), 9285 states have call predecessors, (23574), 9266 states have call successors, (23574) [2025-01-09 03:48:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51798 states to 51798 states and 95227 transitions. [2025-01-09 03:48:07,686 INFO L78 Accepts]: Start accepts. Automaton has 51798 states and 95227 transitions. Word has length 136 [2025-01-09 03:48:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:07,687 INFO L471 AbstractCegarLoop]: Abstraction has 51798 states and 95227 transitions. [2025-01-09 03:48:07,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:48:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 51798 states and 95227 transitions. [2025-01-09 03:48:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:48:07,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:07,688 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-01-09 03:48:07,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:48:07,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:07,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:07,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1453632346, now seen corresponding path program 1 times [2025-01-09 03:48:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:07,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699266377] [2025-01-09 03:48:07,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:48:07,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:48:07,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:07,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:48:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699266377] [2025-01-09 03:48:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699266377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:08,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:08,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910385811] [2025-01-09 03:48:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:08,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:08,089 INFO L87 Difference]: Start difference. First operand 51798 states and 95227 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:13,302 INFO L93 Difference]: Finished difference Result 155809 states and 320055 transitions. [2025-01-09 03:48:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:48:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,813 INFO L225 Difference]: With dead ends: 155809 [2025-01-09 03:48:14,813 INFO L226 Difference]: Without dead ends: 104029 [2025-01-09 03:48:15,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:15,165 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 931 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:15,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4842 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:48:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104029 states. [2025-01-09 03:48:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104029 to 103672. [2025-01-09 03:48:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103672 states, 79482 states have (on average 1.5675121411137112) internal successors, (124589), 82520 states have internal predecessors, (124589), 18568 states have call successors, (18568), 5286 states have call predecessors, (18568), 5621 states have return successors, (65636), 18601 states have call predecessors, (65636), 18502 states have call successors, (65636) [2025-01-09 03:48:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103672 states to 103672 states and 208793 transitions. [2025-01-09 03:48:21,791 INFO L78 Accepts]: Start accepts. Automaton has 103672 states and 208793 transitions. Word has length 108 [2025-01-09 03:48:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,791 INFO L471 AbstractCegarLoop]: Abstraction has 103672 states and 208793 transitions. [2025-01-09 03:48:21,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 103672 states and 208793 transitions. [2025-01-09 03:48:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:48:21,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-01-09 03:48:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:48:21,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash -122639511, now seen corresponding path program 1 times [2025-01-09 03:48:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680197238] [2025-01-09 03:48:21,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:48:21,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:48:21,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:48:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680197238] [2025-01-09 03:48:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680197238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135175787] [2025-01-09 03:48:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:22,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:22,203 INFO L87 Difference]: Start difference. First operand 103672 states and 208793 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:28,396 INFO L93 Difference]: Finished difference Result 208222 states and 439998 transitions. [2025-01-09 03:48:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:28,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 03:48:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:29,683 INFO L225 Difference]: With dead ends: 208222 [2025-01-09 03:48:29,683 INFO L226 Difference]: Without dead ends: 104568 [2025-01-09 03:48:30,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:30,837 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 10 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:30,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2751 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104568 states. [2025-01-09 03:48:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104568 to 104248. [2025-01-09 03:48:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104248 states, 80010 states have (on average 1.5643669541307337) internal successors, (125165), 83048 states have internal predecessors, (125165), 18568 states have call successors, (18568), 5382 states have call predecessors, (18568), 5669 states have return successors, (65620), 18553 states have call predecessors, (65620), 18502 states have call successors, (65620) [2025-01-09 03:48:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104248 states to 104248 states and 209353 transitions. [2025-01-09 03:48:36,449 INFO L78 Accepts]: Start accepts. Automaton has 104248 states and 209353 transitions. Word has length 109 [2025-01-09 03:48:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 104248 states and 209353 transitions. [2025-01-09 03:48:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 104248 states and 209353 transitions. [2025-01-09 03:48:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:48:36,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:36,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 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] [2025-01-09 03:48:36,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:48:36,451 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:36,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1422951232, now seen corresponding path program 1 times [2025-01-09 03:48:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882782922] [2025-01-09 03:48:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:36,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:48:36,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:48:36,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:36,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:48:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882782922] [2025-01-09 03:48:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882782922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516217163] [2025-01-09 03:48:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:36,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:36,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:36,657 INFO L87 Difference]: Start difference. First operand 104248 states and 209353 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13)