./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product28.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_spec9_product28.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 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:13,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:13,457 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:48:13,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:13,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:13,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:13,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:13,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:13,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:13,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:13,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:13,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:13,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:13,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:13,493 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:13,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:13,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:13,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:13,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:13,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:13,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:13,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:13,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:13,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:13,498 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 -> 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 [2025-01-09 03:48:13,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:13,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:13,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:13,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:13,765 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:13,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2025-01-09 03:48:15,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b093d46d3/bc73ad0f8c8e441a93b4504f2cbaf9ab/FLAGe44b6292c [2025-01-09 03:48:15,568 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:15,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2025-01-09 03:48:15,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b093d46d3/bc73ad0f8c8e441a93b4504f2cbaf9ab/FLAGe44b6292c [2025-01-09 03:48:15,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b093d46d3/bc73ad0f8c8e441a93b4504f2cbaf9ab [2025-01-09 03:48:15,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:15,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:15,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:15,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:15,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:15,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:15" (1/1) ... [2025-01-09 03:48:15,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:15, skipping insertion in model container [2025-01-09 03:48:15,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:15" (1/1) ... [2025-01-09 03:48:15,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:16,206 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_spec9_product28.cil.c[73050,73063] [2025-01-09 03:48:16,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:16,226 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:16,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-01-09 03:48:16,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2025-01-09 03:48:16,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [837] [2025-01-09 03:48:16,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [875] [2025-01-09 03:48:16,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2483] [2025-01-09 03:48:16,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2849] [2025-01-09 03:48:16,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3009] [2025-01-09 03:48:16,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3361] [2025-01-09 03:48:16,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3373] [2025-01-09 03:48:16,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3464] [2025-01-09 03:48:16,339 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_spec9_product28.cil.c[73050,73063] [2025-01-09 03:48:16,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:16,375 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:16,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16 WrapperNode [2025-01-09 03:48:16,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:16,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:16,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:16,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:16,383 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:48:16" (1/1) ... [2025-01-09 03:48:16,405 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:48:16" (1/1) ... [2025-01-09 03:48:16,455 INFO L138 Inliner]: procedures = 97, calls = 345, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1127 [2025-01-09 03:48:16,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:16,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:16,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:16,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:16,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,497 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 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:48:16,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:16,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:16,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:16,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:16,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:16,614 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:48:16,617 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:48:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:48:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:48:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:48:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:48:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:48:16,642 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:48:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:48:16,642 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:48:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:48:16,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:48:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:48:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:48:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:48:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:48:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:48:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:48:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:48:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:48:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:48:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:48:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:48:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:48:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:48:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-01-09 03:48:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-01-09 03:48:16,860 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:16,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:18,109 INFO L? ?]: Removed 456 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:18,110 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:18,147 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:18,147 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:18,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:18 BoogieIcfgContainer [2025-01-09 03:48:18,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:18,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:18,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:18,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:18,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:15" (1/3) ... [2025-01-09 03:48:18,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83c5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:18, skipping insertion in model container [2025-01-09 03:48:18,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (2/3) ... [2025-01-09 03:48:18,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83c5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:18, skipping insertion in model container [2025-01-09 03:48:18,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:18" (3/3) ... [2025-01-09 03:48:18,157 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2025-01-09 03:48:18,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:18,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product28.cil.c that has 27 procedures, 572 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:18,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:18,257 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;@6d3fee68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:18,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 572 states, 447 states have (on average 1.686800894854586) internal successors, (754), 470 states have internal predecessors, (754), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 03:48:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:48:18,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1013311267, now seen corresponding path program 1 times [2025-01-09 03:48:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534086944] [2025-01-09 03:48:18,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:48:18,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:48:18,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534086944] [2025-01-09 03:48:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534086944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656538004] [2025-01-09 03:48:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:18,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:18,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:18,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:18,903 INFO L87 Difference]: Start difference. First operand has 572 states, 447 states have (on average 1.686800894854586) internal successors, (754), 470 states have internal predecessors, (754), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,074 INFO L93 Difference]: Finished difference Result 1124 states and 1871 transitions. [2025-01-09 03:48:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-01-09 03:48:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,103 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 03:48:19,104 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:19,118 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:48:19,122 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 5 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:19,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6848072562358276) internal successors, (743), 462 states have internal predecessors, (743), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 932 transitions. [2025-01-09 03:48:19,210 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 932 transitions. Word has length 62 [2025-01-09 03:48:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,211 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 932 transitions. [2025-01-09 03:48:19,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 932 transitions. [2025-01-09 03:48:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:48:19,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:19,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash -593538504, now seen corresponding path program 1 times [2025-01-09 03:48:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356825909] [2025-01-09 03:48:19,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:19,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:48:19,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:48:19,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356825909] [2025-01-09 03:48:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356825909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969773606] [2025-01-09 03:48:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:19,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:19,466 INFO L87 Difference]: Start difference. First operand 564 states and 932 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,554 INFO L93 Difference]: Finished difference Result 1110 states and 1841 transitions. [2025-01-09 03:48:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-01-09 03:48:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,560 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 03:48:19,561 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:19,565 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:48:19,566 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 4 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:19,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2759 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6825396825396826) internal successors, (742), 462 states have internal predecessors, (742), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 931 transitions. [2025-01-09 03:48:19,615 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 931 transitions. Word has length 64 [2025-01-09 03:48:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,616 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 931 transitions. [2025-01-09 03:48:19,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 931 transitions. [2025-01-09 03:48:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:48:19,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:19,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1913491818, now seen corresponding path program 1 times [2025-01-09 03:48:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709600657] [2025-01-09 03:48:19,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:19,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:48:19,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:48:19,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709600657] [2025-01-09 03:48:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709600657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941610905] [2025-01-09 03:48:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:19,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:19,841 INFO L87 Difference]: Start difference. First operand 564 states and 931 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,914 INFO L93 Difference]: Finished difference Result 1110 states and 1840 transitions. [2025-01-09 03:48:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,915 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-01-09 03:48:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,923 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 03:48:19,923 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:19,926 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:48:19,929 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 3 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2759 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:48:19,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2759 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6802721088435375) internal successors, (741), 462 states have internal predecessors, (741), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 930 transitions. [2025-01-09 03:48:19,971 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 930 transitions. Word has length 65 [2025-01-09 03:48:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,972 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 930 transitions. [2025-01-09 03:48:19,972 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 930 transitions. [2025-01-09 03:48:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:48:19,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:19,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1735151748, now seen corresponding path program 1 times [2025-01-09 03:48:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059760750] [2025-01-09 03:48:19,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:48:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:48:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059760750] [2025-01-09 03:48:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059760750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21004017] [2025-01-09 03:48:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:20,175 INFO L87 Difference]: Start difference. First operand 564 states and 930 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,234 INFO L93 Difference]: Finished difference Result 1110 states and 1839 transitions. [2025-01-09 03:48:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-01-09 03:48:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,245 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 03:48:20,246 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:20,248 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:48:20,249 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 2 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:20,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2759 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6780045351473922) internal successors, (740), 462 states have internal predecessors, (740), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 929 transitions. [2025-01-09 03:48:20,287 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 929 transitions. Word has length 66 [2025-01-09 03:48:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 929 transitions. [2025-01-09 03:48:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 929 transitions. [2025-01-09 03:48:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:48:20,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:20,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1358809774, now seen corresponding path program 1 times [2025-01-09 03:48:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88931259] [2025-01-09 03:48:20,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:48:20,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:48:20,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88931259] [2025-01-09 03:48:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88931259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240950939] [2025-01-09 03:48:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:20,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:20,444 INFO L87 Difference]: Start difference. First operand 564 states and 929 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,496 INFO L93 Difference]: Finished difference Result 1110 states and 1838 transitions. [2025-01-09 03:48:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-01-09 03:48:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,504 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 03:48:20,504 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:20,507 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:48:20,508 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 1 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:20,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2759 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6757369614512472) internal successors, (739), 462 states have internal predecessors, (739), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 928 transitions. [2025-01-09 03:48:20,541 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 928 transitions. Word has length 67 [2025-01-09 03:48:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 928 transitions. [2025-01-09 03:48:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 928 transitions. [2025-01-09 03:48:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:20,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:20,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1274835776, now seen corresponding path program 1 times [2025-01-09 03:48:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044913556] [2025-01-09 03:48:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:20,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044913556] [2025-01-09 03:48:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044913556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16608280] [2025-01-09 03:48:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:20,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:20,851 INFO L87 Difference]: Start difference. First operand 564 states and 928 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,005 INFO L93 Difference]: Finished difference Result 1076 states and 1770 transitions. [2025-01-09 03:48:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 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:48:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,012 INFO L225 Difference]: With dead ends: 1076 [2025-01-09 03:48:21,012 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 03:48:21,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:21,018 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 91 mSDsluCounter, 6329 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7245 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7245 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 03:48:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2025-01-09 03:48:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 451 states have (on average 1.671840354767184) internal successors, (754), 474 states have internal predecessors, (754), 98 states have call successors, (98), 26 states have call predecessors, (98), 27 states have return successors, (95), 90 states have call predecessors, (95), 93 states have call successors, (95) [2025-01-09 03:48:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 947 transitions. [2025-01-09 03:48:21,052 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 947 transitions. Word has length 68 [2025-01-09 03:48:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 947 transitions. [2025-01-09 03:48:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 947 transitions. [2025-01-09 03:48:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:21,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:21,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -141645183, now seen corresponding path program 1 times [2025-01-09 03:48:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470342480] [2025-01-09 03:48:21,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:21,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:21,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470342480] [2025-01-09 03:48:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470342480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416012854] [2025-01-09 03:48:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:21,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:21,150 INFO L87 Difference]: Start difference. First operand 577 states and 947 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,202 INFO L93 Difference]: Finished difference Result 1128 states and 1864 transitions. [2025-01-09 03:48:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:21,203 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, (9), 2 states have call predecessors, (9), 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:48:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,208 INFO L225 Difference]: With dead ends: 1128 [2025-01-09 03:48:21,208 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 03:48:21,211 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:48:21,212 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 0 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2761 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 03:48:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-01-09 03:48:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6666666666666667) internal successors, (725), 456 states have internal predecessors, (725), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 914 transitions. [2025-01-09 03:48:21,235 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 914 transitions. Word has length 68 [2025-01-09 03:48:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,235 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 914 transitions. [2025-01-09 03:48:21,236 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 914 transitions. [2025-01-09 03:48:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:48:21,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:21,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1748768827, now seen corresponding path program 1 times [2025-01-09 03:48:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353143118] [2025-01-09 03:48:21,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:48:21,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:48:21,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353143118] [2025-01-09 03:48:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353143118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065931603] [2025-01-09 03:48:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:21,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:21,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:21,410 INFO L87 Difference]: Start difference. First operand 558 states and 914 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,612 INFO L93 Difference]: Finished difference Result 1073 states and 1762 transitions. [2025-01-09 03:48:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-01-09 03:48:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,618 INFO L225 Difference]: With dead ends: 1073 [2025-01-09 03:48:21,618 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:21,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:21,622 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 55 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4326 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-01-09 03:48:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.657471264367816) internal successors, (721), 456 states have internal predecessors, (721), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 910 transitions. [2025-01-09 03:48:21,647 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 910 transitions. Word has length 69 [2025-01-09 03:48:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,648 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 910 transitions. [2025-01-09 03:48:21,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 910 transitions. [2025-01-09 03:48:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:48:21,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:21,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1741831133, now seen corresponding path program 1 times [2025-01-09 03:48:21,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694949312] [2025-01-09 03:48:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:48:21,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:48:21,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694949312] [2025-01-09 03:48:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694949312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:21,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483917725] [2025-01-09 03:48:21,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:21,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:21,791 INFO L87 Difference]: Start difference. First operand 558 states and 910 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,973 INFO L93 Difference]: Finished difference Result 1073 states and 1758 transitions. [2025-01-09 03:48:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-01-09 03:48:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,980 INFO L225 Difference]: With dead ends: 1073 [2025-01-09 03:48:21,981 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:21,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:21,986 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 54 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4326 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-01-09 03:48:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6482758620689655) internal successors, (717), 456 states have internal predecessors, (717), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 906 transitions. [2025-01-09 03:48:22,013 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 906 transitions. Word has length 70 [2025-01-09 03:48:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 906 transitions. [2025-01-09 03:48:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 906 transitions. [2025-01-09 03:48:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:22,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:22,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:22,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:22,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 698260310, now seen corresponding path program 1 times [2025-01-09 03:48:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951863486] [2025-01-09 03:48:22,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:22,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951863486] [2025-01-09 03:48:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951863486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937504757] [2025-01-09 03:48:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:22,153 INFO L87 Difference]: Start difference. First operand 558 states and 906 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:22,322 INFO L93 Difference]: Finished difference Result 1073 states and 1754 transitions. [2025-01-09 03:48:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 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:48:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:22,329 INFO L225 Difference]: With dead ends: 1073 [2025-01-09 03:48:22,330 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:22,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:22,333 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 53 mSDsluCounter, 3438 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:22,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4308 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-01-09 03:48:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.639080459770115) internal successors, (713), 456 states have internal predecessors, (713), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 902 transitions. [2025-01-09 03:48:22,381 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 902 transitions. Word has length 71 [2025-01-09 03:48:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 902 transitions. [2025-01-09 03:48:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 902 transitions. [2025-01-09 03:48:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:22,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:22,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2078421290, now seen corresponding path program 1 times [2025-01-09 03:48:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515841968] [2025-01-09 03:48:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:22,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:22,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:22,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515841968] [2025-01-09 03:48:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515841968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:22,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724919221] [2025-01-09 03:48:22,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:22,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:22,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:22,549 INFO L87 Difference]: Start difference. First operand 558 states and 902 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:22,618 INFO L93 Difference]: Finished difference Result 1064 states and 1736 transitions. [2025-01-09 03:48:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2025-01-09 03:48:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:22,624 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:48:22,625 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 03:48:22,627 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:48:22,628 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 84 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5273 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:22,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5273 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 03:48:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-01-09 03:48:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6400966183574879) internal successors, (679), 435 states have internal predecessors, (679), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 868 transitions. [2025-01-09 03:48:22,649 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 868 transitions. Word has length 71 [2025-01-09 03:48:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 868 transitions. [2025-01-09 03:48:22,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 868 transitions. [2025-01-09 03:48:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:48:22,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:22,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:22,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:22,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1878800856, now seen corresponding path program 1 times [2025-01-09 03:48:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:22,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438423806] [2025-01-09 03:48:22,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:22,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:48:22,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:48:22,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438423806] [2025-01-09 03:48:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438423806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:22,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3043642] [2025-01-09 03:48:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:22,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:22,774 INFO L87 Difference]: Start difference. First operand 537 states and 868 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:22,851 INFO L93 Difference]: Finished difference Result 1043 states and 1702 transitions. [2025-01-09 03:48:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 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:48:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:22,857 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:48:22,857 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 03:48:22,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:22,860 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 17 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:22,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4246 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 03:48:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-01-09 03:48:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6376811594202898) internal successors, (678), 435 states have internal predecessors, (678), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 867 transitions. [2025-01-09 03:48:22,881 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 867 transitions. Word has length 72 [2025-01-09 03:48:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 867 transitions. [2025-01-09 03:48:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 867 transitions. [2025-01-09 03:48:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:48:22,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:22,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:22,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1007650191, now seen corresponding path program 1 times [2025-01-09 03:48:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228904189] [2025-01-09 03:48:22,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:22,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:48:22,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:48:22,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228904189] [2025-01-09 03:48:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228904189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340032] [2025-01-09 03:48:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:23,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:23,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:23,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:23,024 INFO L87 Difference]: Start difference. First operand 537 states and 867 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:23,105 INFO L93 Difference]: Finished difference Result 1043 states and 1701 transitions. [2025-01-09 03:48:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:23,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 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:48:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:23,111 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:48:23,112 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 03:48:23,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:23,116 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 16 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:23,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4246 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 03:48:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-01-09 03:48:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6352657004830917) internal successors, (677), 435 states have internal predecessors, (677), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2025-01-09 03:48:23,140 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 73 [2025-01-09 03:48:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:23,140 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2025-01-09 03:48:23,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2025-01-09 03:48:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:48:23,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:23,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:23,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:23,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1121821741, now seen corresponding path program 1 times [2025-01-09 03:48:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894787414] [2025-01-09 03:48:23,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:23,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:48:23,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:48:23,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:23,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894787414] [2025-01-09 03:48:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894787414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:23,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:48:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376248334] [2025-01-09 03:48:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:48:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:23,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:48:23,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:23,363 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:23,469 INFO L93 Difference]: Finished difference Result 1037 states and 1689 transitions. [2025-01-09 03:48:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-01-09 03:48:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:23,475 INFO L225 Difference]: With dead ends: 1037 [2025-01-09 03:48:23,476 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 03:48:23,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:23,478 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 6 mSDsluCounter, 6778 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7628 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:23,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7628 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 03:48:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-01-09 03:48:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6328502415458936) internal successors, (676), 435 states have internal predecessors, (676), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 865 transitions. [2025-01-09 03:48:23,499 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 865 transitions. Word has length 74 [2025-01-09 03:48:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:23,499 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 865 transitions. [2025-01-09 03:48:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 865 transitions. [2025-01-09 03:48:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:48:23,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:23,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:23,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash -463492420, now seen corresponding path program 1 times [2025-01-09 03:48:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92526507] [2025-01-09 03:48:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:23,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:23,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:23,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:23,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:23,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92526507] [2025-01-09 03:48:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92526507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090553952] [2025-01-09 03:48:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:23,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:23,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:23,758 INFO L87 Difference]: Start difference. First operand 537 states and 865 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,034 INFO L93 Difference]: Finished difference Result 1656 states and 2730 transitions. [2025-01-09 03:48:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2025-01-09 03:48:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,047 INFO L225 Difference]: With dead ends: 1656 [2025-01-09 03:48:26,047 INFO L226 Difference]: Without dead ends: 1164 [2025-01-09 03:48:26,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:26,053 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1966 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:26,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2031 Valid, 1253 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:48:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-01-09 03:48:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1032. [2025-01-09 03:48:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 803 states have (on average 1.6537982565379825) internal successors, (1328), 833 states have internal predecessors, (1328), 181 states have call successors, (181), 46 states have call predecessors, (181), 47 states have return successors, (183), 165 states have call predecessors, (183), 176 states have call successors, (183) [2025-01-09 03:48:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1692 transitions. [2025-01-09 03:48:26,145 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1692 transitions. Word has length 75 [2025-01-09 03:48:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1692 transitions. [2025-01-09 03:48:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1692 transitions. [2025-01-09 03:48:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:48:26,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,151 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:26,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:26,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -160758993, now seen corresponding path program 1 times [2025-01-09 03:48:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507886177] [2025-01-09 03:48:26,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:48:26,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:48:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507886177] [2025-01-09 03:48:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507886177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:48:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690092736] [2025-01-09 03:48:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:48:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:48:26,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:26,505 INFO L87 Difference]: Start difference. First operand 1032 states and 1692 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:48:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,033 INFO L93 Difference]: Finished difference Result 3742 states and 6154 transitions. [2025-01-09 03:48:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:48:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2025-01-09 03:48:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,053 INFO L225 Difference]: With dead ends: 3742 [2025-01-09 03:48:32,053 INFO L226 Difference]: Without dead ends: 2755 [2025-01-09 03:48:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:48:32,062 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2239 mSDsluCounter, 3658 mSDsCounter, 0 mSdLazyCounter, 10108 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 10718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 10108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4347 Invalid, 10718 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [610 Valid, 10108 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 03:48:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-01-09 03:48:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2661. [2025-01-09 03:48:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2008 states have (on average 1.624003984063745) internal successors, (3261), 2084 states have internal predecessors, (3261), 524 states have call successors, (524), 111 states have call predecessors, (524), 128 states have return successors, (557), 498 states have call predecessors, (557), 519 states have call successors, (557) [2025-01-09 03:48:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4342 transitions. [2025-01-09 03:48:32,224 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4342 transitions. Word has length 127 [2025-01-09 03:48:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,224 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4342 transitions. [2025-01-09 03:48:32,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:48:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4342 transitions. [2025-01-09 03:48:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:48:32,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,229 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:32,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 111313256, now seen corresponding path program 1 times [2025-01-09 03:48:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649762219] [2025-01-09 03:48:32,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:48:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:48:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649762219] [2025-01-09 03:48:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649762219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022058039] [2025-01-09 03:48:32,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:32,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:32,430 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:48:32,432 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:48:32,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:48:32,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:48:32,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:32,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:32,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022058039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340987359] [2025-01-09 03:48:32,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:32,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:32,836 INFO L87 Difference]: Start difference. First operand 2661 states and 4342 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,976 INFO L93 Difference]: Finished difference Result 6773 states and 11158 transitions. [2025-01-09 03:48:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 03:48:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,009 INFO L225 Difference]: With dead ends: 6773 [2025-01-09 03:48:33,010 INFO L226 Difference]: Without dead ends: 4157 [2025-01-09 03:48:33,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 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:48:33,029 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 850 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:33,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1789 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2025-01-09 03:48:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 4155. [2025-01-09 03:48:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3120 states have (on average 1.6192307692307693) internal successors, (5052), 3242 states have internal predecessors, (5052), 835 states have call successors, (835), 169 states have call predecessors, (835), 199 states have return successors, (934), 809 states have call predecessors, (934), 830 states have call successors, (934) [2025-01-09 03:48:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 6821 transitions. [2025-01-09 03:48:33,350 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 6821 transitions. Word has length 128 [2025-01-09 03:48:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:33,350 INFO L471 AbstractCegarLoop]: Abstraction has 4155 states and 6821 transitions. [2025-01-09 03:48:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 6821 transitions. [2025-01-09 03:48:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:48:33,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:33,355 INFO L218 NwaCegarLoop]: trace histogram [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, 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:33,366 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:48:33,558 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,SelfDestructingSolverStorable16 [2025-01-09 03:48:33,559 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:33,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -844533593, now seen corresponding path program 1 times [2025-01-09 03:48:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479661800] [2025-01-09 03:48:33,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:48:33,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:48:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479661800] [2025-01-09 03:48:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479661800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494022589] [2025-01-09 03:48:33,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:33,711 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:48:33,714 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:48:33,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:48:34,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:48:34,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:34,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:34,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:34,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:34,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494022589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:34,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456026992] [2025-01-09 03:48:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:34,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:34,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:34,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:34,108 INFO L87 Difference]: Start difference. First operand 4155 states and 6821 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:34,392 INFO L93 Difference]: Finished difference Result 11257 states and 18708 transitions. [2025-01-09 03:48:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-01-09 03:48:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:34,448 INFO L225 Difference]: With dead ends: 11257 [2025-01-09 03:48:34,448 INFO L226 Difference]: Without dead ends: 7147 [2025-01-09 03:48:34,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 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:48:34,479 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 849 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:34,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1745 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2025-01-09 03:48:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 7144. [2025-01-09 03:48:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 5345 states have (on average 1.6151543498596819) internal successors, (8633), 5559 states have internal predecessors, (8633), 1457 states have call successors, (1457), 285 states have call predecessors, (1457), 341 states have return successors, (1756), 1431 states have call predecessors, (1756), 1452 states have call successors, (1756) [2025-01-09 03:48:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11846 transitions. [2025-01-09 03:48:34,924 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11846 transitions. Word has length 129 [2025-01-09 03:48:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11846 transitions. [2025-01-09 03:48:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11846 transitions. [2025-01-09 03:48:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:48:34,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:34,930 INFO L218 NwaCegarLoop]: trace histogram [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, 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:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:48:35,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 03:48:35,134 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:35,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash -411010934, now seen corresponding path program 1 times [2025-01-09 03:48:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017201313] [2025-01-09 03:48:35,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:35,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:48:35,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:48:35,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017201313] [2025-01-09 03:48:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017201313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628498581] [2025-01-09 03:48:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:35,286 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:48:35,289 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:48:35,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:48:35,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:48:35,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:35,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:35,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:35,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628498581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:35,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:35,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:35,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988305534] [2025-01-09 03:48:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:35,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:35,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:35,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:35,701 INFO L87 Difference]: Start difference. First operand 7144 states and 11846 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:36,214 INFO L93 Difference]: Finished difference Result 20226 states and 34118 transitions. [2025-01-09 03:48:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-01-09 03:48:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:36,305 INFO L225 Difference]: With dead ends: 20226 [2025-01-09 03:48:36,305 INFO L226 Difference]: Without dead ends: 13127 [2025-01-09 03:48:36,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 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:48:36,338 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 848 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:36,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1738 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13127 states. [2025-01-09 03:48:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13127 to 13123. [2025-01-09 03:48:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13123 states, 9796 states have (on average 1.611371988566762) internal successors, (15785), 10194 states have internal predecessors, (15785), 2701 states have call successors, (2701), 517 states have call predecessors, (2701), 625 states have return successors, (3610), 2675 states have call predecessors, (3610), 2696 states have call successors, (3610) [2025-01-09 03:48:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13123 states to 13123 states and 22096 transitions. [2025-01-09 03:48:37,167 INFO L78 Accepts]: Start accepts. Automaton has 13123 states and 22096 transitions. Word has length 130 [2025-01-09 03:48:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 13123 states and 22096 transitions. [2025-01-09 03:48:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 13123 states and 22096 transitions. [2025-01-09 03:48:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:48:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:37,174 INFO L218 NwaCegarLoop]: trace histogram [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, 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:37,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:48:37,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:37,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 143293513, now seen corresponding path program 1 times [2025-01-09 03:48:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210503731] [2025-01-09 03:48:37,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:48:37,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:48:37,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:37,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210503731] [2025-01-09 03:48:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210503731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:37,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968914494] [2025-01-09 03:48:37,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:37,541 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:48:37,544 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:48:37,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:48:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:48:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1728 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:37,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:37,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968914494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469261132] [2025-01-09 03:48:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:37,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:37,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:37,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:37,917 INFO L87 Difference]: Start difference. First operand 13123 states and 22096 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:38,852 INFO L93 Difference]: Finished difference Result 38165 states and 65955 transitions. [2025-01-09 03:48:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:38,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 03:48:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:39,031 INFO L225 Difference]: With dead ends: 38165 [2025-01-09 03:48:39,032 INFO L226 Difference]: Without dead ends: 25087 [2025-01-09 03:48:39,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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:48:39,091 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 847 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:39,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1728 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25087 states. [2025-01-09 03:48:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25087 to 25082. [2025-01-09 03:48:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25082 states, 18699 states have (on average 1.6076260762607626) internal successors, (30061), 19465 states have internal predecessors, (30061), 5189 states have call successors, (5189), 981 states have call predecessors, (5189), 1193 states have return successors, (8008), 5163 states have call predecessors, (8008), 5184 states have call successors, (8008) [2025-01-09 03:48:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25082 states to 25082 states and 43258 transitions. [2025-01-09 03:48:40,672 INFO L78 Accepts]: Start accepts. Automaton has 25082 states and 43258 transitions. Word has length 131 [2025-01-09 03:48:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:40,673 INFO L471 AbstractCegarLoop]: Abstraction has 25082 states and 43258 transitions. [2025-01-09 03:48:40,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25082 states and 43258 transitions. [2025-01-09 03:48:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:48:40,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:40,679 INFO L218 NwaCegarLoop]: trace histogram [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, 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:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:40,880 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:40,881 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:40,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 146866092, now seen corresponding path program 1 times [2025-01-09 03:48:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:40,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8980413] [2025-01-09 03:48:40,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:40,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:48:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:48:40,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:40,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8980413] [2025-01-09 03:48:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8980413] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546415263] [2025-01-09 03:48:41,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:41,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:41,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:41,151 INFO L229 MonitoredProcess]: Starting monitored process 6 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:48:41,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:48:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:48:41,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:48:41,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:41,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:41,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:41,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:41,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546415263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354111571] [2025-01-09 03:48:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:41,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:41,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:41,568 INFO L87 Difference]: Start difference. First operand 25082 states and 43258 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:43,147 INFO L93 Difference]: Finished difference Result 74044 states and 133171 transitions. [2025-01-09 03:48:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-01-09 03:48:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:43,637 INFO L225 Difference]: With dead ends: 74044 [2025-01-09 03:48:43,637 INFO L226 Difference]: Without dead ends: 48999 [2025-01-09 03:48:43,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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:48:43,792 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 846 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1744 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48999 states. [2025-01-09 03:48:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48999 to 48993. [2025-01-09 03:48:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48993 states, 36499 states have (on average 1.6033315981259761) internal successors, (58520), 38001 states have internal predecessors, (58520), 10165 states have call successors, (10165), 1909 states have call predecessors, (10165), 2328 states have return successors, (19185), 10138 states have call predecessors, (19185), 10160 states have call successors, (19185) [2025-01-09 03:48:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48993 states to 48993 states and 87870 transitions. [2025-01-09 03:48:47,355 INFO L78 Accepts]: Start accepts. Automaton has 48993 states and 87870 transitions. Word has length 132 [2025-01-09 03:48:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,355 INFO L471 AbstractCegarLoop]: Abstraction has 48993 states and 87870 transitions. [2025-01-09 03:48:47,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 03:48:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48993 states and 87870 transitions. [2025-01-09 03:48:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 03:48:47,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,383 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:47,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:47,584 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1633341290, now seen corresponding path program 1 times [2025-01-09 03:48:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186379858] [2025-01-09 03:48:47,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 03:48:47,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 03:48:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:48:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186379858] [2025-01-09 03:48:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186379858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349678697] [2025-01-09 03:48:47,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:47,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:47,757 INFO L87 Difference]: Start difference. First operand 48993 states and 87870 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:48:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:50,733 INFO L93 Difference]: Finished difference Result 98469 states and 186050 transitions. [2025-01-09 03:48:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 204 [2025-01-09 03:48:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,132 INFO L225 Difference]: With dead ends: 98469 [2025-01-09 03:48:51,132 INFO L226 Difference]: Without dead ends: 49521 [2025-01-09 03:48:51,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:51,533 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 859 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:51,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3167 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:48:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49521 states. [2025-01-09 03:48:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49521 to 49521. [2025-01-09 03:48:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49521 states, 36895 states have (on average 1.5968559425396396) internal successors, (58916), 38397 states have internal predecessors, (58916), 10165 states have call successors, (10165), 2041 states have call predecessors, (10165), 2460 states have return successors, (19284), 10138 states have call predecessors, (19284), 10160 states have call successors, (19284) [2025-01-09 03:48:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49521 states to 49521 states and 88365 transitions. [2025-01-09 03:48:54,163 INFO L78 Accepts]: Start accepts. Automaton has 49521 states and 88365 transitions. Word has length 204 [2025-01-09 03:48:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:54,163 INFO L471 AbstractCegarLoop]: Abstraction has 49521 states and 88365 transitions. [2025-01-09 03:48:54,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:48:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 49521 states and 88365 transitions. [2025-01-09 03:48:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 03:48:54,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:54,187 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:48:54,188 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 476135564, now seen corresponding path program 1 times [2025-01-09 03:48:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684644551] [2025-01-09 03:48:54,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:54,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 03:48:54,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 03:48:54,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:54,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:48:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684644551] [2025-01-09 03:48:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684644551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17882759] [2025-01-09 03:48:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:54,350 INFO L87 Difference]: Start difference. First operand 49521 states and 88365 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:48:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:57,149 INFO L93 Difference]: Finished difference Result 99657 states and 187007 transitions. [2025-01-09 03:48:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 205 [2025-01-09 03:48:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:57,647 INFO L225 Difference]: With dead ends: 99657 [2025-01-09 03:48:57,647 INFO L226 Difference]: Without dead ends: 50181 [2025-01-09 03:48:58,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:58,239 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 858 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:58,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3173 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:48:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50181 states. [2025-01-09 03:49:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50181 to 50181. [2025-01-09 03:49:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50181 states, 37423 states have (on average 1.5884349197017877) internal successors, (59444), 38925 states have internal predecessors, (59444), 10165 states have call successors, (10165), 2173 states have call predecessors, (10165), 2592 states have return successors, (19383), 10138 states have call predecessors, (19383), 10160 states have call successors, (19383) [2025-01-09 03:49:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50181 states to 50181 states and 88992 transitions. [2025-01-09 03:49:00,976 INFO L78 Accepts]: Start accepts. Automaton has 50181 states and 88992 transitions. Word has length 205 [2025-01-09 03:49:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:00,977 INFO L471 AbstractCegarLoop]: Abstraction has 50181 states and 88992 transitions. [2025-01-09 03:49:00,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 50181 states and 88992 transitions. [2025-01-09 03:49:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 03:49:00,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:00,993 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:49:00,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 916113618, now seen corresponding path program 1 times [2025-01-09 03:49:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332970144] [2025-01-09 03:49:00,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 03:49:01,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 03:49:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:49:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332970144] [2025-01-09 03:49:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332970144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:49:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083240411] [2025-01-09 03:49:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:01,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:01,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:01,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:01,171 INFO L87 Difference]: Start difference. First operand 50181 states and 88992 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:03,969 INFO L93 Difference]: Finished difference Result 101109 states and 188228 transitions. [2025-01-09 03:49:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 206 [2025-01-09 03:49:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:04,459 INFO L225 Difference]: With dead ends: 101109 [2025-01-09 03:49:04,460 INFO L226 Difference]: Without dead ends: 50973 [2025-01-09 03:49:04,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:04,940 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 858 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3173 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:04,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3173 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:49:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50973 states.