./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:27:30,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:27:30,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:27:30,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:27:30,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:27:30,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:27:30,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:27:30,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:27:30,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:27:30,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:27:30,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:27:30,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:27:30,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:27:30,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:27:30,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:27:30,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:30,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:27:30,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:27:30,895 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/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 -> 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 [2025-03-08 05:27:31,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:27:31,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:27:31,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:27:31,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:27:31,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:27:31,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-03-08 05:27:32,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e523e4/52d02f1e3488407ba5e41cffb94d1d75/FLAGd7e5265c0 [2025-03-08 05:27:32,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:27:32,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-03-08 05:27:32,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e523e4/52d02f1e3488407ba5e41cffb94d1d75/FLAGd7e5265c0 [2025-03-08 05:27:32,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e523e4/52d02f1e3488407ba5e41cffb94d1d75 [2025-03-08 05:27:32,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:27:32,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:27:32,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:32,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:27:32,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:27:32,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:32" (1/1) ... [2025-03-08 05:27:32,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6ba199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:32, skipping insertion in model container [2025-03-08 05:27:32,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:32" (1/1) ... [2025-03-08 05:27:32,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:27:33,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2025-03-08 05:27:33,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:33,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:27:33,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-08 05:27:33,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [408] [2025-03-08 05:27:33,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [423] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [789] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2329] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2447] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2482] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2669] [2025-03-08 05:27:33,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2678] [2025-03-08 05:27:33,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2769] [2025-03-08 05:27:33,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2025-03-08 05:27:33,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:33,441 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:27:33,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33 WrapperNode [2025-03-08 05:27:33,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:33,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:33,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:27:33,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:27:33,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,499 INFO L138 Inliner]: procedures = 92, calls = 346, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1087 [2025-03-08 05:27:33,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:33,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:27:33,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:27:33,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:27:33,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,541 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:27:33,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:27:33,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:27:33,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:27:33,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:27:33,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (1/1) ... [2025-03-08 05:27:33,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:33,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:33,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:27:33,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:27:33,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:27:33,623 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-08 05:27:33,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-08 05:27:33,623 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:27:33,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:27:33,623 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-08 05:27:33,623 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-08 05:27:33,624 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:27:33,624 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:27:33,624 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:27:33,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:27:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:27:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:27:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:27:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:27:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:27:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:27:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:27:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:27:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:27:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:27:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:27:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:27:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:27:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:27:33,790 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:27:33,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:27:33,826 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: #res := ~retValue_acc~9; [2025-03-08 05:27:33,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: #res := ~retValue_acc~22; [2025-03-08 05:27:33,875 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: #res := ~retValue_acc~16; [2025-03-08 05:27:33,910 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2317: #res := ~retValue_acc~20; [2025-03-08 05:27:34,153 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1596: #res#1 := ~retValue_acc~14#1; [2025-03-08 05:27:34,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: stopRequestedInDirection__wrappee__weight_#res#1 := stopRequestedInDirection__wrappee__weight_~retValue_acc~13#1; [2025-03-08 05:27:34,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: #res := ~retValue_acc~18; [2025-03-08 05:27:34,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-08 05:27:34,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-08 05:27:34,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-03-08 05:27:34,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3427: #res := ~retValue_acc~29; [2025-03-08 05:27:34,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: #res := ~retValue_acc~24; [2025-03-08 05:27:34,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: #res := ~retValue_acc~5; [2025-03-08 05:27:34,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: #res := ~retValue_acc~6; [2025-03-08 05:27:34,562 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: #res := ~retValue_acc~23; [2025-03-08 05:27:34,588 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073: #res := ~retValue_acc~8; [2025-03-08 05:27:34,667 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3116: #res := ~retValue_acc~28; [2025-03-08 05:27:34,723 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L405-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-08 05:27:34,723 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-08 05:27:34,732 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: #res := ~retValue_acc~27; [2025-03-08 05:27:34,864 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-03-08 05:27:34,864 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:27:34,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:27:34,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:27:34,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:34 BoogieIcfgContainer [2025-03-08 05:27:34,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:27:34,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:27:34,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:27:34,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:27:34,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:32" (1/3) ... [2025-03-08 05:27:34,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd4d6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:34, skipping insertion in model container [2025-03-08 05:27:34,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:33" (2/3) ... [2025-03-08 05:27:34,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd4d6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:34, skipping insertion in model container [2025-03-08 05:27:34,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:34" (3/3) ... [2025-03-08 05:27:34,890 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2025-03-08 05:27:34,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:27:34,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product19.cil.c that has 28 procedures, 587 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:27:34,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:27:34,970 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;@46433e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:27:34,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:27:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 450 states have (on average 1.6688888888888889) internal successors, (751), 468 states have internal predecessors, (751), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 05:27:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:27:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:34,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:34,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:35,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash -601662832, now seen corresponding path program 1 times [2025-03-08 05:27:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945308868] [2025-03-08 05:27:35,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:35,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:27:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:27:35,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:35,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945308868] [2025-03-08 05:27:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945308868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115158555] [2025-03-08 05:27:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:35,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:35,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:35,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:35,690 INFO L87 Difference]: Start difference. First operand has 587 states, 450 states have (on average 1.6688888888888889) internal successors, (751), 468 states have internal predecessors, (751), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:35,913 INFO L93 Difference]: Finished difference Result 1171 states and 1946 transitions. [2025-03-08 05:27:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-08 05:27:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:35,931 INFO L225 Difference]: With dead ends: 1171 [2025-03-08 05:27:35,931 INFO L226 Difference]: Without dead ends: 592 [2025-03-08 05:27:35,942 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-03-08 05:27:35,945 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 91 mSDsluCounter, 4665 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5615 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:35,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5615 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-08 05:27:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2025-03-08 05:27:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 453 states have (on average 1.6622516556291391) internal successors, (753), 471 states have internal predecessors, (753), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2025-03-08 05:27:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 970 transitions. [2025-03-08 05:27:36,025 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 970 transitions. Word has length 113 [2025-03-08 05:27:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 970 transitions. [2025-03-08 05:27:36,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 970 transitions. [2025-03-08 05:27:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:27:36,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:36,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:36,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:27:36,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 217292093, now seen corresponding path program 1 times [2025-03-08 05:27:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355142182] [2025-03-08 05:27:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:36,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:27:36,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:27:36,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:36,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355142182] [2025-03-08 05:27:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355142182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:36,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051691565] [2025-03-08 05:27:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:36,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:36,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:36,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:36,382 INFO L87 Difference]: Start difference. First operand 590 states and 970 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:36,519 INFO L93 Difference]: Finished difference Result 1175 states and 1943 transitions. [2025-03-08 05:27:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-03-08 05:27:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:36,526 INFO L225 Difference]: With dead ends: 1175 [2025-03-08 05:27:36,527 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 05:27:36,530 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-03-08 05:27:36,531 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 90 mSDsluCounter, 4664 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5616 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5616 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 05:27:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 590. [2025-03-08 05:27:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 453 states have (on average 1.6622516556291391) internal successors, (753), 471 states have internal predecessors, (753), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2025-03-08 05:27:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 970 transitions. [2025-03-08 05:27:36,577 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 970 transitions. Word has length 114 [2025-03-08 05:27:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:36,578 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 970 transitions. [2025-03-08 05:27:36,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 970 transitions. [2025-03-08 05:27:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:27:36,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:36,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:36,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:27:36,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1521397468, now seen corresponding path program 1 times [2025-03-08 05:27:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847833631] [2025-03-08 05:27:36,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:36,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:27:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:27:36,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:36,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847833631] [2025-03-08 05:27:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847833631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846570209] [2025-03-08 05:27:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:36,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:36,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:36,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:36,776 INFO L87 Difference]: Start difference. First operand 590 states and 970 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:36,823 INFO L93 Difference]: Finished difference Result 1162 states and 1921 transitions. [2025-03-08 05:27:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 05:27:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:36,828 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:27:36,828 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 05:27:36,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:36,832 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 14 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:36,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2815 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 05:27:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-08 05:27:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 426 states have (on average 1.6455399061032865) internal successors, (701), 442 states have internal predecessors, (701), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 914 transitions. [2025-03-08 05:27:36,852 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 914 transitions. Word has length 114 [2025-03-08 05:27:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:36,853 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 914 transitions. [2025-03-08 05:27:36,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 914 transitions. [2025-03-08 05:27:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:27:36,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:36,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:36,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:27:36,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:36,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1014677750, now seen corresponding path program 1 times [2025-03-08 05:27:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746019826] [2025-03-08 05:27:36,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:36,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:36,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:27:36,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:27:36,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:36,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746019826] [2025-03-08 05:27:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746019826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:37,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798494119] [2025-03-08 05:27:37,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:37,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:37,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:37,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:37,052 INFO L87 Difference]: Start difference. First operand 560 states and 914 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:37,118 INFO L93 Difference]: Finished difference Result 1113 states and 1827 transitions. [2025-03-08 05:27:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-08 05:27:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:37,122 INFO L225 Difference]: With dead ends: 1113 [2025-03-08 05:27:37,122 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 05:27:37,125 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-03-08 05:27:37,127 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 63 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5366 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:37,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5366 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 05:27:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-08 05:27:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 420 states have (on average 1.638095238095238) internal successors, (688), 436 states have internal predecessors, (688), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 901 transitions. [2025-03-08 05:27:37,148 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 901 transitions. Word has length 115 [2025-03-08 05:27:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 901 transitions. [2025-03-08 05:27:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 901 transitions. [2025-03-08 05:27:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:27:37,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:37,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:27:37,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1400805961, now seen corresponding path program 1 times [2025-03-08 05:27:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664108063] [2025-03-08 05:27:37,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:27:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:27:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664108063] [2025-03-08 05:27:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664108063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757874652] [2025-03-08 05:27:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:37,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:37,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:37,350 INFO L87 Difference]: Start difference. First operand 554 states and 901 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:37,427 INFO L93 Difference]: Finished difference Result 1101 states and 1801 transitions. [2025-03-08 05:27:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:27:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:37,433 INFO L225 Difference]: With dead ends: 1101 [2025-03-08 05:27:37,433 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:37,436 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-03-08 05:27:37,437 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 49 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5306 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:37,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5306 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6304347826086956) internal successors, (675), 430 states have internal predecessors, (675), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 888 transitions. [2025-03-08 05:27:37,464 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 888 transitions. Word has length 116 [2025-03-08 05:27:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:37,464 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 888 transitions. [2025-03-08 05:27:37,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 888 transitions. [2025-03-08 05:27:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:27:37,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:37,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:27:37,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -636670993, now seen corresponding path program 1 times [2025-03-08 05:27:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:37,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376112322] [2025-03-08 05:27:37,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:27:37,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:27:37,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376112322] [2025-03-08 05:27:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376112322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:37,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131237989] [2025-03-08 05:27:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:37,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:37,657 INFO L87 Difference]: Start difference. First operand 548 states and 888 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:37,713 INFO L93 Difference]: Finished difference Result 1089 states and 1775 transitions. [2025-03-08 05:27:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:37,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:27:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:37,717 INFO L225 Difference]: With dead ends: 1089 [2025-03-08 05:27:37,717 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:37,721 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-03-08 05:27:37,722 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 24 mSDsluCounter, 4378 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5258 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:37,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5258 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 430 states have internal predecessors, (674), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 887 transitions. [2025-03-08 05:27:37,744 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 887 transitions. Word has length 116 [2025-03-08 05:27:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:37,745 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 887 transitions. [2025-03-08 05:27:37,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 887 transitions. [2025-03-08 05:27:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:27:37,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:37,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:37,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:27:37,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:37,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1335647356, now seen corresponding path program 1 times [2025-03-08 05:27:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:37,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213900010] [2025-03-08 05:27:37,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:37,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:37,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:27:37,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:27:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213900010] [2025-03-08 05:27:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213900010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:37,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764102121] [2025-03-08 05:27:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:37,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:37,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:37,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:37,861 INFO L87 Difference]: Start difference. First operand 548 states and 887 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:37,903 INFO L93 Difference]: Finished difference Result 1080 states and 1760 transitions. [2025-03-08 05:27:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-08 05:27:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:37,907 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:27:37,907 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:37,910 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-03-08 05:27:37,910 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 15 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:37,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2601 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 430 states have internal predecessors, (673), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 886 transitions. [2025-03-08 05:27:37,929 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 886 transitions. Word has length 117 [2025-03-08 05:27:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:37,929 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 886 transitions. [2025-03-08 05:27:37,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 886 transitions. [2025-03-08 05:27:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:27:37,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:37,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:37,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:27:37,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1369969375, now seen corresponding path program 1 times [2025-03-08 05:27:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174185709] [2025-03-08 05:27:37,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:37,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:27:37,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:27:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174185709] [2025-03-08 05:27:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174185709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672674325] [2025-03-08 05:27:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:38,037 INFO L87 Difference]: Start difference. First operand 548 states and 886 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:38,094 INFO L93 Difference]: Finished difference Result 1080 states and 1758 transitions. [2025-03-08 05:27:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-08 05:27:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:38,099 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:27:38,099 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:38,101 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-03-08 05:27:38,101 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 14 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:38,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2603 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6231884057971016) internal successors, (672), 430 states have internal predecessors, (672), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 885 transitions. [2025-03-08 05:27:38,118 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 885 transitions. Word has length 118 [2025-03-08 05:27:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 885 transitions. [2025-03-08 05:27:38,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 885 transitions. [2025-03-08 05:27:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:27:38,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:38,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:27:38,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 94074663, now seen corresponding path program 1 times [2025-03-08 05:27:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995848833] [2025-03-08 05:27:38,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:38,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:27:38,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:27:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995848833] [2025-03-08 05:27:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995848833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51425389] [2025-03-08 05:27:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:38,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:38,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:38,246 INFO L87 Difference]: Start difference. First operand 548 states and 885 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:38,288 INFO L93 Difference]: Finished difference Result 1080 states and 1756 transitions. [2025-03-08 05:27:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-08 05:27:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:38,293 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:27:38,293 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:38,296 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-03-08 05:27:38,297 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 13 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2605 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-03-08 05:27:38,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2605 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6207729468599035) internal successors, (671), 430 states have internal predecessors, (671), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 884 transitions. [2025-03-08 05:27:38,320 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 884 transitions. Word has length 119 [2025-03-08 05:27:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:38,320 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 884 transitions. [2025-03-08 05:27:38,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 884 transitions. [2025-03-08 05:27:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:27:38,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:38,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:38,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:27:38,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:38,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash -54623198, now seen corresponding path program 1 times [2025-03-08 05:27:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:38,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199733452] [2025-03-08 05:27:38,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:38,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:27:38,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:27:38,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:38,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199733452] [2025-03-08 05:27:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199733452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:38,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311962731] [2025-03-08 05:27:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:38,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:38,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:38,432 INFO L87 Difference]: Start difference. First operand 548 states and 884 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:38,468 INFO L93 Difference]: Finished difference Result 1080 states and 1754 transitions. [2025-03-08 05:27:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-03-08 05:27:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:38,472 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:27:38,472 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 05:27:38,475 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-03-08 05:27:38,476 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 12 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:38,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2607 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 05:27:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 05:27:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 414 states have (on average 1.6183574879227054) internal successors, (670), 430 states have internal predecessors, (670), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 883 transitions. [2025-03-08 05:27:38,493 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 883 transitions. Word has length 120 [2025-03-08 05:27:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:38,494 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 883 transitions. [2025-03-08 05:27:38,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:27:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 883 transitions. [2025-03-08 05:27:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:27:38,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:38,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:38,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:27:38,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 380042954, now seen corresponding path program 1 times [2025-03-08 05:27:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911184048] [2025-03-08 05:27:38,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:38,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:27:38,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:27:38,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:38,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:27:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911184048] [2025-03-08 05:27:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911184048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030313725] [2025-03-08 05:27:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:38,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:27:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:27:38,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:27:38,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:38,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:38,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:38,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:39,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030313725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205335348] [2025-03-08 05:27:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:39,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:39,092 INFO L87 Difference]: Start difference. First operand 548 states and 883 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:39,147 INFO L93 Difference]: Finished difference Result 1555 states and 2537 transitions. [2025-03-08 05:27:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-08 05:27:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:39,153 INFO L225 Difference]: With dead ends: 1555 [2025-03-08 05:27:39,153 INFO L226 Difference]: Without dead ends: 1025 [2025-03-08 05:27:39,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 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-03-08 05:27:39,157 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 806 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:39,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-08 05:27:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1010. [2025-03-08 05:27:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 770 states have (on average 1.6311688311688313) internal successors, (1256), 801 states have internal predecessors, (1256), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 185 states have call predecessors, (193), 188 states have call successors, (193) [2025-03-08 05:27:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1640 transitions. [2025-03-08 05:27:39,191 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1640 transitions. Word has length 121 [2025-03-08 05:27:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:39,191 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1640 transitions. [2025-03-08 05:27:39,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1640 transitions. [2025-03-08 05:27:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:27:39,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:39,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:39,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:27:39,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:27:39,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 684042846, now seen corresponding path program 1 times [2025-03-08 05:27:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947765013] [2025-03-08 05:27:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:27:39,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:27:39,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:39,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:27:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947765013] [2025-03-08 05:27:39,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947765013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940834757] [2025-03-08 05:27:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:39,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:39,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:27:39,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:27:39,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:27:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:39,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:39,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:39,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940834757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:39,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:39,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647556429] [2025-03-08 05:27:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:39,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:39,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:39,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:39,978 INFO L87 Difference]: Start difference. First operand 1010 states and 1640 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:40,041 INFO L93 Difference]: Finished difference Result 2479 states and 4053 transitions. [2025-03-08 05:27:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-03-08 05:27:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:40,050 INFO L225 Difference]: With dead ends: 2479 [2025-03-08 05:27:40,051 INFO L226 Difference]: Without dead ends: 1487 [2025-03-08 05:27:40,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 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-03-08 05:27:40,056 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 807 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:40,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1724 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2025-03-08 05:27:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1439. [2025-03-08 05:27:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1099 states have (on average 1.643312101910828) internal successors, (1806), 1145 states have internal predecessors, (1806), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 264 states have call predecessors, (278), 268 states have call successors, (278) [2025-03-08 05:27:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2355 transitions. [2025-03-08 05:27:40,110 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2355 transitions. Word has length 122 [2025-03-08 05:27:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:40,111 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2355 transitions. [2025-03-08 05:27:40,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:27:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2355 transitions. [2025-03-08 05:27:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:27:40,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:40,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:40,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:27:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:27:40,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:40,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1153054078, now seen corresponding path program 1 times [2025-03-08 05:27:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821546900] [2025-03-08 05:27:40,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:40,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:27:40,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:27:40,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:40,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:27:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821546900] [2025-03-08 05:27:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821546900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922499669] [2025-03-08 05:27:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:40,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:40,471 INFO L87 Difference]: Start difference. First operand 1439 states and 2355 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:40,946 INFO L93 Difference]: Finished difference Result 4253 states and 7066 transitions. [2025-03-08 05:27:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-08 05:27:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:40,965 INFO L225 Difference]: With dead ends: 4253 [2025-03-08 05:27:40,965 INFO L226 Difference]: Without dead ends: 2832 [2025-03-08 05:27:40,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:40,976 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 872 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:40,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 4538 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-03-08 05:27:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2785. [2025-03-08 05:27:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2131 states have (on average 1.646644767714688) internal successors, (3509), 2219 states have internal predecessors, (3509), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (597), 513 states have call predecessors, (597), 517 states have call successors, (597) [2025-03-08 05:27:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4627 transitions. [2025-03-08 05:27:41,108 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4627 transitions. Word has length 124 [2025-03-08 05:27:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4627 transitions. [2025-03-08 05:27:41,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4627 transitions. [2025-03-08 05:27:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:27:41,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:41,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:27:41,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:41,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1126531143, now seen corresponding path program 1 times [2025-03-08 05:27:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933850249] [2025-03-08 05:27:41,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:41,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:27:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:27:41,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:27:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933850249] [2025-03-08 05:27:41,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933850249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688323052] [2025-03-08 05:27:41,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:41,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:41,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:27:41,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:27:41,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:27:41,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:41,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:41,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:27:41,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:41,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:41,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688323052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:41,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20163366] [2025-03-08 05:27:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:41,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:41,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:41,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:41,728 INFO L87 Difference]: Start difference. First operand 2785 states and 4627 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:42,010 INFO L93 Difference]: Finished difference Result 8065 states and 13586 transitions. [2025-03-08 05:27:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-08 05:27:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:42,044 INFO L225 Difference]: With dead ends: 8065 [2025-03-08 05:27:42,045 INFO L226 Difference]: Without dead ends: 5299 [2025-03-08 05:27:42,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-03-08 05:27:42,063 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 718 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:42,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1643 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-03-08 05:27:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5262. [2025-03-08 05:27:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5262 states, 4012 states have (on average 1.6141575274177467) internal successors, (6476), 4186 states have internal predecessors, (6476), 990 states have call successors, (990), 254 states have call predecessors, (990), 259 states have return successors, (1239), 977 states have call predecessors, (1239), 984 states have call successors, (1239) [2025-03-08 05:27:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 8705 transitions. [2025-03-08 05:27:42,309 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 8705 transitions. Word has length 125 [2025-03-08 05:27:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 5262 states and 8705 transitions. [2025-03-08 05:27:42,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 8705 transitions. [2025-03-08 05:27:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:27:42,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:42,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:27:42,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:42,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:42,514 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 636587700, now seen corresponding path program 1 times [2025-03-08 05:27:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976576742] [2025-03-08 05:27:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:42,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976576742] [2025-03-08 05:27:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976576742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238834389] [2025-03-08 05:27:42,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:42,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:27:42,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:42,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:42,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:42,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:42,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:27:42,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:27:42,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238834389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:42,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898106876] [2025-03-08 05:27:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:42,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:42,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:42,979 INFO L87 Difference]: Start difference. First operand 5262 states and 8705 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:43,268 INFO L93 Difference]: Finished difference Result 15672 states and 26248 transitions. [2025-03-08 05:27:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-08 05:27:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:43,343 INFO L225 Difference]: With dead ends: 15672 [2025-03-08 05:27:43,344 INFO L226 Difference]: Without dead ends: 10431 [2025-03-08 05:27:43,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:43,374 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 868 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1741 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10431 states. [2025-03-08 05:27:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10431 to 10328. [2025-03-08 05:27:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10328 states, 7900 states have (on average 1.6175949367088607) internal successors, (12779), 8228 states have internal predecessors, (12779), 1920 states have call successors, (1920), 490 states have call predecessors, (1920), 507 states have return successors, (2472), 1915 states have call predecessors, (2472), 1910 states have call successors, (2472) [2025-03-08 05:27:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10328 states to 10328 states and 17171 transitions. [2025-03-08 05:27:43,852 INFO L78 Accepts]: Start accepts. Automaton has 10328 states and 17171 transitions. Word has length 127 [2025-03-08 05:27:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 10328 states and 17171 transitions. [2025-03-08 05:27:43,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 10328 states and 17171 transitions. [2025-03-08 05:27:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:27:43,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:43,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:27:43,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:27:44,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:27:44,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:44,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 131029075, now seen corresponding path program 1 times [2025-03-08 05:27:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534293822] [2025-03-08 05:27:44,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:44,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:44,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:44,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:44,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534293822] [2025-03-08 05:27:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534293822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790696412] [2025-03-08 05:27:44,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:44,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:44,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:44,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:44,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:27:44,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:44,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:44,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:27:44,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:44,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790696412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:44,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:27:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178614528] [2025-03-08 05:27:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:44,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:44,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:44,599 INFO L87 Difference]: Start difference. First operand 10328 states and 17171 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:27:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:45,452 INFO L93 Difference]: Finished difference Result 19515 states and 32522 transitions. [2025-03-08 05:27:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-08 05:27:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:45,514 INFO L225 Difference]: With dead ends: 19515 [2025-03-08 05:27:45,514 INFO L226 Difference]: Without dead ends: 9205 [2025-03-08 05:27:45,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:45,552 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 738 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:45,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 4255 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:27:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9205 states. [2025-03-08 05:27:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9205 to 9183. [2025-03-08 05:27:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9183 states, 7043 states have (on average 1.60457191537697) internal successors, (11301), 7318 states have internal predecessors, (11301), 1678 states have call successors, (1678), 446 states have call predecessors, (1678), 461 states have return successors, (2138), 1674 states have call predecessors, (2138), 1668 states have call successors, (2138) [2025-03-08 05:27:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9183 states to 9183 states and 15117 transitions. [2025-03-08 05:27:45,864 INFO L78 Accepts]: Start accepts. Automaton has 9183 states and 15117 transitions. Word has length 127 [2025-03-08 05:27:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:45,864 INFO L471 AbstractCegarLoop]: Abstraction has 9183 states and 15117 transitions. [2025-03-08 05:27:45,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:27:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9183 states and 15117 transitions. [2025-03-08 05:27:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:27:45,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:45,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:27:45,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:27:46,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:27:46,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2139137321, now seen corresponding path program 1 times [2025-03-08 05:27:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583493659] [2025-03-08 05:27:46,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:46,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:46,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:46,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:46,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583493659] [2025-03-08 05:27:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583493659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325130437] [2025-03-08 05:27:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:46,193 INFO L87 Difference]: Start difference. First operand 9183 states and 15117 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:46,502 INFO L93 Difference]: Finished difference Result 18396 states and 30629 transitions. [2025-03-08 05:27:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-08 05:27:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:46,550 INFO L225 Difference]: With dead ends: 18396 [2025-03-08 05:27:46,551 INFO L226 Difference]: Without dead ends: 9231 [2025-03-08 05:27:46,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:46,594 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 12 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:46,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2573 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2025-03-08 05:27:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 9199. [2025-03-08 05:27:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9199 states, 7055 states have (on average 1.6029766123316798) internal successors, (11309), 7330 states have internal predecessors, (11309), 1678 states have call successors, (1678), 454 states have call predecessors, (1678), 465 states have return successors, (2112), 1670 states have call predecessors, (2112), 1668 states have call successors, (2112) [2025-03-08 05:27:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 15099 transitions. [2025-03-08 05:27:46,958 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 15099 transitions. Word has length 127 [2025-03-08 05:27:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:46,958 INFO L471 AbstractCegarLoop]: Abstraction has 9199 states and 15099 transitions. [2025-03-08 05:27:46,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 15099 transitions. [2025-03-08 05:27:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:27:46,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:46,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:46,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:27:46,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 305435482, now seen corresponding path program 1 times [2025-03-08 05:27:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518519597] [2025-03-08 05:27:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:46,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:27:46,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:27:46,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:46,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:27:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518519597] [2025-03-08 05:27:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518519597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:47,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188050743] [2025-03-08 05:27:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:47,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:47,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:47,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:47,102 INFO L87 Difference]: Start difference. First operand 9199 states and 15099 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:27:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:48,081 INFO L93 Difference]: Finished difference Result 27543 states and 46395 transitions. [2025-03-08 05:27:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-08 05:27:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:48,183 INFO L225 Difference]: With dead ends: 27543 [2025-03-08 05:27:48,183 INFO L226 Difference]: Without dead ends: 18362 [2025-03-08 05:27:48,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:48,247 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 867 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:48,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 4411 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2025-03-08 05:27:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 18261. [2025-03-08 05:27:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18261 states, 14016 states have (on average 1.5994577625570776) internal successors, (22418), 14557 states have internal predecessors, (22418), 3311 states have call successors, (3311), 902 states have call predecessors, (3311), 933 states have return successors, (4825), 3313 states have call predecessors, (4825), 3293 states have call successors, (4825) [2025-03-08 05:27:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18261 states to 18261 states and 30554 transitions. [2025-03-08 05:27:49,027 INFO L78 Accepts]: Start accepts. Automaton has 18261 states and 30554 transitions. Word has length 135 [2025-03-08 05:27:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:49,028 INFO L471 AbstractCegarLoop]: Abstraction has 18261 states and 30554 transitions. [2025-03-08 05:27:49,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:27:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18261 states and 30554 transitions. [2025-03-08 05:27:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:27:49,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:49,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:49,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:27:49,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:49,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1800829442, now seen corresponding path program 1 times [2025-03-08 05:27:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987780907] [2025-03-08 05:27:49,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:49,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:27:49,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:27:49,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:49,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:27:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987780907] [2025-03-08 05:27:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987780907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208553479] [2025-03-08 05:27:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:49,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:49,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:49,112 INFO L87 Difference]: Start difference. First operand 18261 states and 30554 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:27:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:49,807 INFO L93 Difference]: Finished difference Result 36648 states and 62323 transitions. [2025-03-08 05:27:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 05:27:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:49,878 INFO L225 Difference]: With dead ends: 36648 [2025-03-08 05:27:49,879 INFO L226 Difference]: Without dead ends: 18405 [2025-03-08 05:27:49,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:49,952 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:49,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2567 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18405 states. [2025-03-08 05:27:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18405 to 18341. [2025-03-08 05:27:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18341 states, 14088 states have (on average 1.596961953435548) internal successors, (22498), 14613 states have internal predecessors, (22498), 3311 states have call successors, (3311), 934 states have call predecessors, (3311), 941 states have return successors, (4785), 3305 states have call predecessors, (4785), 3293 states have call successors, (4785) [2025-03-08 05:27:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 30594 transitions. [2025-03-08 05:27:50,492 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 30594 transitions. Word has length 136 [2025-03-08 05:27:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:50,493 INFO L471 AbstractCegarLoop]: Abstraction has 18341 states and 30594 transitions. [2025-03-08 05:27:50,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:27:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 30594 transitions. [2025-03-08 05:27:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:27:50,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:50,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:50,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:27:50,498 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -766844330, now seen corresponding path program 1 times [2025-03-08 05:27:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548313798] [2025-03-08 05:27:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:27:50,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:27:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:27:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548313798] [2025-03-08 05:27:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548313798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:50,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253765728] [2025-03-08 05:27:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:50,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:50,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:50,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:50,744 INFO L87 Difference]: Start difference. First operand 18341 states and 30594 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:27:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,252 INFO L93 Difference]: Finished difference Result 55109 states and 95426 transitions. [2025-03-08 05:27:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-08 05:27:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,517 INFO L225 Difference]: With dead ends: 55109 [2025-03-08 05:27:52,517 INFO L226 Difference]: Without dead ends: 36786 [2025-03-08 05:27:52,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:52,658 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 861 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 4385 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36786 states. [2025-03-08 05:27:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36786 to 36621. [2025-03-08 05:27:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36621 states, 28139 states have (on average 1.5934823554497317) internal successors, (44839), 29180 states have internal predecessors, (44839), 6588 states have call successors, (6588), 1862 states have call predecessors, (6588), 1893 states have return successors, (11427), 6602 states have call predecessors, (11427), 6554 states have call successors, (11427) [2025-03-08 05:27:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36621 states to 36621 states and 62854 transitions. [2025-03-08 05:27:54,477 INFO L78 Accepts]: Start accepts. Automaton has 36621 states and 62854 transitions. Word has length 145 [2025-03-08 05:27:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:54,479 INFO L471 AbstractCegarLoop]: Abstraction has 36621 states and 62854 transitions. [2025-03-08 05:27:54,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:27:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36621 states and 62854 transitions. [2025-03-08 05:27:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:27:54,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:54,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:54,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:27:54,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:54,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2121447049, now seen corresponding path program 1 times [2025-03-08 05:27:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151645062] [2025-03-08 05:27:54,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:27:54,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:27:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:27:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151645062] [2025-03-08 05:27:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151645062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723229135] [2025-03-08 05:27:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:54,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:54,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:54,569 INFO L87 Difference]: Start difference. First operand 36621 states and 62854 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:27:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,171 INFO L93 Difference]: Finished difference Result 73512 states and 129364 transitions. [2025-03-08 05:27:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-03-08 05:27:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,434 INFO L225 Difference]: With dead ends: 73512 [2025-03-08 05:27:56,434 INFO L226 Difference]: Without dead ends: 36909 [2025-03-08 05:27:56,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:56,861 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 11 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2567 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36909 states. [2025-03-08 05:27:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36909 to 36781. [2025-03-08 05:27:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36781 states, 28283 states have (on average 1.591026411625358) internal successors, (44999), 29324 states have internal predecessors, (44999), 6588 states have call successors, (6588), 1894 states have call predecessors, (6588), 1909 states have return successors, (11371), 6586 states have call predecessors, (11371), 6554 states have call successors, (11371) [2025-03-08 05:27:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36781 states to 36781 states and 62958 transitions. [2025-03-08 05:27:58,295 INFO L78 Accepts]: Start accepts. Automaton has 36781 states and 62958 transitions. Word has length 146 [2025-03-08 05:27:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 36781 states and 62958 transitions. [2025-03-08 05:27:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:27:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36781 states and 62958 transitions. [2025-03-08 05:27:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:27:58,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:58,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:27:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:27:58,301 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash -208820629, now seen corresponding path program 1 times [2025-03-08 05:27:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573572663] [2025-03-08 05:27:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:27:58,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:27:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:27:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573572663] [2025-03-08 05:27:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573572663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135277299] [2025-03-08 05:27:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:58,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:58,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:58,456 INFO L87 Difference]: Start difference. First operand 36781 states and 62958 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:28:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:01,806 INFO L93 Difference]: Finished difference Result 110665 states and 200314 transitions. [2025-03-08 05:28:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-03-08 05:28:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:02,403 INFO L225 Difference]: With dead ends: 110665 [2025-03-08 05:28:02,404 INFO L226 Difference]: Without dead ends: 73902 [2025-03-08 05:28:02,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:02,777 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 858 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 4356 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:02,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 4356 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:28:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73902 states. [2025-03-08 05:28:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73902 to 73609. [2025-03-08 05:28:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73609 states, 56610 states have (on average 1.588411941353118) internal successors, (89920), 58683 states have internal predecessors, (89920), 13153 states have call successors, (13153), 3782 states have call predecessors, (13153), 3845 states have return successors, (28385), 13191 states have call predecessors, (28385), 13087 states have call successors, (28385) [2025-03-08 05:28:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73609 states to 73609 states and 131458 transitions. [2025-03-08 05:28:07,093 INFO L78 Accepts]: Start accepts. Automaton has 73609 states and 131458 transitions. Word has length 156 [2025-03-08 05:28:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:07,094 INFO L471 AbstractCegarLoop]: Abstraction has 73609 states and 131458 transitions. [2025-03-08 05:28:07,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:28:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 73609 states and 131458 transitions. [2025-03-08 05:28:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:28:07,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:07,099 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:28:07,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:28:07,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:07,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash 748557595, now seen corresponding path program 1 times [2025-03-08 05:28:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315119700] [2025-03-08 05:28:07,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:07,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:28:07,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:28:07,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:07,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:28:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:07,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315119700] [2025-03-08 05:28:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315119700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016473732] [2025-03-08 05:28:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:07,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:07,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:07,181 INFO L87 Difference]: Start difference. First operand 73609 states and 131458 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:28:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:12,050 INFO L93 Difference]: Finished difference Result 147840 states and 274353 transitions. [2025-03-08 05:28:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2025-03-08 05:28:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:12,614 INFO L225 Difference]: With dead ends: 147840 [2025-03-08 05:28:12,614 INFO L226 Difference]: Without dead ends: 74249 [2025-03-08 05:28:13,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:13,375 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 10 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:13,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2567 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74249 states. [2025-03-08 05:28:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74249 to 73993. [2025-03-08 05:28:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73993 states, 56962 states have (on average 1.5853375934833749) internal successors, (90304), 59035 states have internal predecessors, (90304), 13153 states have call successors, (13153), 3846 states have call predecessors, (13153), 3877 states have return successors, (28321), 13159 states have call predecessors, (28321), 13087 states have call successors, (28321) [2025-03-08 05:28:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73993 states to 73993 states and 131778 transitions. [2025-03-08 05:28:16,851 INFO L78 Accepts]: Start accepts. Automaton has 73993 states and 131778 transitions. Word has length 157 [2025-03-08 05:28:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:16,851 INFO L471 AbstractCegarLoop]: Abstraction has 73993 states and 131778 transitions. [2025-03-08 05:28:16,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:28:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 73993 states and 131778 transitions. [2025-03-08 05:28:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:28:16,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:16,858 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:28:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:28:16,858 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 211866167, now seen corresponding path program 1 times [2025-03-08 05:28:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327567041] [2025-03-08 05:28:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:16,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:16,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:16,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 05:28:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327567041] [2025-03-08 05:28:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327567041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328862809] [2025-03-08 05:28:17,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:17,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:17,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:28:17,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:28:17,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:17,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:17,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:28:17,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:28:17,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328862809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:28:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652001196] [2025-03-08 05:28:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:17,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:17,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:17,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:17,603 INFO L87 Difference]: Start difference. First operand 73993 states and 131778 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20)