./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_product24.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 8333bf118d61dc3e3ddedc658c9d6fef28fa288c9b6abdc361c7a0f5f6e109b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:01,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:01,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:01,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:01,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:01,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:01,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:01,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:01,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:01,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:01,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:01,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:01,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:01,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:01,574 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:01,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:01,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:01,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:01,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:01,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:01,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:01,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:01,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:01,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:01,577 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 -> 8333bf118d61dc3e3ddedc658c9d6fef28fa288c9b6abdc361c7a0f5f6e109b7 [2025-03-03 14:18:01,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:01,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:01,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:01,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:01,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:01,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product24.cil.c [2025-03-03 14:18:02,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673b4fa0a/3130933054264af78df8de962d511a8c/FLAG2501153ea [2025-03-03 14:18:03,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:03,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product24.cil.c [2025-03-03 14:18:03,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673b4fa0a/3130933054264af78df8de962d511a8c/FLAG2501153ea [2025-03-03 14:18:03,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673b4fa0a/3130933054264af78df8de962d511a8c [2025-03-03 14:18:03,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:03,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:03,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:03,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:03,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:03,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f67c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03, skipping insertion in model container [2025-03-03 14:18:03,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:03,732 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_product24.cil.c[75121,75134] [2025-03-03 14:18:03,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:03,748 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:03,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-03 14:18:03,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [67] [2025-03-03 14:18:03,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [425] [2025-03-03 14:18:03,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [545] [2025-03-03 14:18:03,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [641] [2025-03-03 14:18:03,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2290] [2025-03-03 14:18:03,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2951] [2025-03-03 14:18:03,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3138] [2025-03-03 14:18:03,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3504] [2025-03-03 14:18:03,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3539] [2025-03-03 14:18:03,852 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_product24.cil.c[75121,75134] [2025-03-03 14:18:03,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:03,877 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:03,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03 WrapperNode [2025-03-03 14:18:03,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:03,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:03,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:03,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:03,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,948 INFO L138 Inliner]: procedures = 96, calls = 359, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 962 [2025-03-03 14:18:03,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:03,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:03,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:03,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:03,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,992 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:18:03,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:03,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:04,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:04,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:04,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:04,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (1/1) ... [2025-03-03 14:18:04,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:04,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:04,063 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-03 14:18:04,069 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-03 14:18:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:18:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:18:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:18:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:18:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:18:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:18:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-03 14:18:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-03 14:18:04,255 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:04,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:04,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600: #res#1 := ~retValue_acc~18#1; [2025-03-03 14:18:04,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1572-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~17#1; [2025-03-03 14:18:04,331 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: #res := ~retValue_acc~9; [2025-03-03 14:18:04,362 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L464: #res := ~retValue_acc~2; [2025-03-03 14:18:04,396 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: #res := ~retValue_acc~22; [2025-03-03 14:18:04,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1516-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~16#1; [2025-03-03 14:18:04,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~14#1; [2025-03-03 14:18:04,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: #res#1 := ~retValue_acc~15#1; [2025-03-03 14:18:04,500 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1645: #res := ~retValue_acc~20; [2025-03-03 14:18:04,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L885-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-03-03 14:18:04,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-03 14:18:04,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-03 14:18:04,639 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2948: #res := ~retValue_acc~26; [2025-03-03 14:18:04,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: #res := ~retValue_acc~4; [2025-03-03 14:18:04,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: #res := ~retValue_acc~5; [2025-03-03 14:18:04,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L876: #res := ~retValue_acc~6; [2025-03-03 14:18:04,783 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: #res := ~retValue_acc~3; [2025-03-03 14:18:04,810 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L919: #res := ~retValue_acc~8; [2025-03-03 14:18:04,878 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2637: #res := ~retValue_acc~25; [2025-03-03 14:18:04,995 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1413: #res := ~retValue_acc~13; [2025-03-03 14:18:05,061 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L422-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:18:05,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536-1: valid_product_#res#1 := valid_product_~retValue_acc~31#1; [2025-03-03 14:18:05,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: #res := ~retValue_acc~24; [2025-03-03 14:18:05,177 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~19#1; [2025-03-03 14:18:05,311 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:05,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:05,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:05,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:05,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:05 BoogieIcfgContainer [2025-03-03 14:18:05,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:05,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:05,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:05,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:05,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:03" (1/3) ... [2025-03-03 14:18:05,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d25025b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:05, skipping insertion in model container [2025-03-03 14:18:05,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:03" (2/3) ... [2025-03-03 14:18:05,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d25025b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:05, skipping insertion in model container [2025-03-03 14:18:05,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:05" (3/3) ... [2025-03-03 14:18:05,347 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product24.cil.c [2025-03-03 14:18:05,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:05,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product24.cil.c that has 30 procedures, 619 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:05,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:05,436 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;@1716a4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:05,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 619 states, 473 states have (on average 1.657505285412262) internal successors, (784), 493 states have internal predecessors, (784), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 14:18:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:18:05,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:05,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1682411385, now seen corresponding path program 1 times [2025-03-03 14:18:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384342632] [2025-03-03 14:18:05,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:18:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:18:05,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384342632] [2025-03-03 14:18:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384342632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094891690] [2025-03-03 14:18:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:06,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:06,081 INFO L87 Difference]: Start difference. First operand has 619 states, 473 states have (on average 1.657505285412262) internal successors, (784), 493 states have internal predecessors, (784), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,321 INFO L93 Difference]: Finished difference Result 1235 states and 2040 transitions. [2025-03-03 14:18:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-03-03 14:18:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,345 INFO L225 Difference]: With dead ends: 1235 [2025-03-03 14:18:06,345 INFO L226 Difference]: Without dead ends: 624 [2025-03-03 14:18:06,357 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-03 14:18:06,360 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 91 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5903 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-03 14:18:06,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5903 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-03 14:18:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2025-03-03 14:18:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 476 states have (on average 1.6512605042016806) internal successors, (786), 496 states have internal predecessors, (786), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-03-03 14:18:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1017 transitions. [2025-03-03 14:18:06,451 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1017 transitions. Word has length 67 [2025-03-03 14:18:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,451 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1017 transitions. [2025-03-03 14:18:06,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1017 transitions. [2025-03-03 14:18:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:06,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:06,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1192345766, now seen corresponding path program 1 times [2025-03-03 14:18:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747532854] [2025-03-03 14:18:06,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:06,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:06,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747532854] [2025-03-03 14:18:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747532854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946455667] [2025-03-03 14:18:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:06,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:06,740 INFO L87 Difference]: Start difference. First operand 622 states and 1017 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,888 INFO L93 Difference]: Finished difference Result 1239 states and 2037 transitions. [2025-03-03 14:18:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-03-03 14:18:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,896 INFO L225 Difference]: With dead ends: 1239 [2025-03-03 14:18:06,896 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 14:18:06,902 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-03 14:18:06,903 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 90 mSDsluCounter, 4899 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5898 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-03 14:18:06,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5898 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 14:18:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 622. [2025-03-03 14:18:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 476 states have (on average 1.6512605042016806) internal successors, (786), 496 states have internal predecessors, (786), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-03-03 14:18:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1017 transitions. [2025-03-03 14:18:06,949 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1017 transitions. Word has length 68 [2025-03-03 14:18:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1017 transitions. [2025-03-03 14:18:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1017 transitions. [2025-03-03 14:18:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:06,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:06,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -464887103, now seen corresponding path program 1 times [2025-03-03 14:18:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887633164] [2025-03-03 14:18:06,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:06,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:06,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887633164] [2025-03-03 14:18:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887633164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003564034] [2025-03-03 14:18:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:07,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:07,117 INFO L87 Difference]: Start difference. First operand 622 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,175 INFO L93 Difference]: Finished difference Result 1226 states and 2015 transitions. [2025-03-03 14:18:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-03 14:18:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,181 INFO L225 Difference]: With dead ends: 1226 [2025-03-03 14:18:07,182 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:18:07,185 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-03 14:18:07,186 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 14 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2956 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-03 14:18:07,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2956 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:18:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:18:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 449 states have (on average 1.6347438752783965) internal successors, (734), 467 states have internal predecessors, (734), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 961 transitions. [2025-03-03 14:18:07,216 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 961 transitions. Word has length 68 [2025-03-03 14:18:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:07,216 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 961 transitions. [2025-03-03 14:18:07,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 961 transitions. [2025-03-03 14:18:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:18:07,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:07,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:07,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:07,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:07,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash -309931661, now seen corresponding path program 1 times [2025-03-03 14:18:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944301111] [2025-03-03 14:18:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:18:07,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:18:07,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:07,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944301111] [2025-03-03 14:18:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944301111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216906983] [2025-03-03 14:18:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:07,426 INFO L87 Difference]: Start difference. First operand 592 states and 961 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,506 INFO L93 Difference]: Finished difference Result 1177 states and 1921 transitions. [2025-03-03 14:18:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:07,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 14:18:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,522 INFO L225 Difference]: With dead ends: 1177 [2025-03-03 14:18:07,522 INFO L226 Difference]: Without dead ends: 586 [2025-03-03 14:18:07,524 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-03 14:18:07,525 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 63 mSDsluCounter, 4697 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5648 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-03 14:18:07,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5648 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-03 14:18:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-03 14:18:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 443 states have (on average 1.6275395033860045) internal successors, (721), 461 states have internal predecessors, (721), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 948 transitions. [2025-03-03 14:18:07,560 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 948 transitions. Word has length 69 [2025-03-03 14:18:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 948 transitions. [2025-03-03 14:18:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 948 transitions. [2025-03-03 14:18:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:18:07,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:07,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:07,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:07,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1168963232, now seen corresponding path program 1 times [2025-03-03 14:18:07,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:07,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495709102] [2025-03-03 14:18:07,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:18:07,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:18:07,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:07,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495709102] [2025-03-03 14:18:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495709102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851437723] [2025-03-03 14:18:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:07,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:07,737 INFO L87 Difference]: Start difference. First operand 586 states and 948 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,811 INFO L93 Difference]: Finished difference Result 1165 states and 1895 transitions. [2025-03-03 14:18:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:18:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,815 INFO L225 Difference]: With dead ends: 1165 [2025-03-03 14:18:07,815 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:07,818 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-03 14:18:07,818 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 49 mSDsluCounter, 4649 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5588 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-03 14:18:07,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5588 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.620137299771167) internal successors, (708), 455 states have internal predecessors, (708), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 935 transitions. [2025-03-03 14:18:07,837 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 935 transitions. Word has length 70 [2025-03-03 14:18:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 935 transitions. [2025-03-03 14:18:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 935 transitions. [2025-03-03 14:18:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:18:07,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:07,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:07,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 146169560, now seen corresponding path program 1 times [2025-03-03 14:18:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221035110] [2025-03-03 14:18:07,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:18:07,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:18:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221035110] [2025-03-03 14:18:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221035110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:07,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388750639] [2025-03-03 14:18:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:07,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:07,978 INFO L87 Difference]: Start difference. First operand 580 states and 935 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,034 INFO L93 Difference]: Finished difference Result 1153 states and 1869 transitions. [2025-03-03 14:18:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:18:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,041 INFO L225 Difference]: With dead ends: 1153 [2025-03-03 14:18:08,041 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:08,044 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-03 14:18:08,044 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 24 mSDsluCounter, 4613 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5540 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-03 14:18:08,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5540 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6178489702517163) internal successors, (707), 455 states have internal predecessors, (707), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 934 transitions. [2025-03-03 14:18:08,070 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 934 transitions. Word has length 70 [2025-03-03 14:18:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,071 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 934 transitions. [2025-03-03 14:18:08,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 934 transitions. [2025-03-03 14:18:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:18:08,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:08,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash 574919533, now seen corresponding path program 1 times [2025-03-03 14:18:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066858580] [2025-03-03 14:18:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:18:08,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:18:08,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:08,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066858580] [2025-03-03 14:18:08,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066858580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:08,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526371182] [2025-03-03 14:18:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:08,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:08,191 INFO L87 Difference]: Start difference. First operand 580 states and 934 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,233 INFO L93 Difference]: Finished difference Result 1144 states and 1854 transitions. [2025-03-03 14:18:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-03 14:18:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,237 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 14:18:08,237 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:08,240 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-03 14:18:08,242 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 15 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2742 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-03 14:18:08,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2742 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6155606407322654) internal successors, (706), 455 states have internal predecessors, (706), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 933 transitions. [2025-03-03 14:18:08,265 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 933 transitions. Word has length 71 [2025-03-03 14:18:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 933 transitions. [2025-03-03 14:18:08,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 933 transitions. [2025-03-03 14:18:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:18:08,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:08,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:08,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -920849976, now seen corresponding path program 1 times [2025-03-03 14:18:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045392206] [2025-03-03 14:18:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:18:08,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:18:08,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045392206] [2025-03-03 14:18:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045392206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550986980] [2025-03-03 14:18:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:08,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:08,354 INFO L87 Difference]: Start difference. First operand 580 states and 933 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,398 INFO L93 Difference]: Finished difference Result 1144 states and 1852 transitions. [2025-03-03 14:18:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:08,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-03 14:18:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,404 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 14:18:08,404 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:08,407 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-03 14:18:08,407 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 14 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2744 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-03 14:18:08,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2744 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6132723112128147) internal successors, (705), 455 states have internal predecessors, (705), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 932 transitions. [2025-03-03 14:18:08,428 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 932 transitions. Word has length 72 [2025-03-03 14:18:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 932 transitions. [2025-03-03 14:18:08,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 932 transitions. [2025-03-03 14:18:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:18:08,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:08,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:08,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash 404059216, now seen corresponding path program 1 times [2025-03-03 14:18:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552513862] [2025-03-03 14:18:08,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:18:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:18:08,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552513862] [2025-03-03 14:18:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552513862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017775081] [2025-03-03 14:18:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:08,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:08,502 INFO L87 Difference]: Start difference. First operand 580 states and 932 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,533 INFO L93 Difference]: Finished difference Result 1144 states and 1850 transitions. [2025-03-03 14:18:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:08,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-03 14:18:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,539 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 14:18:08,539 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:08,542 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-03 14:18:08,542 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 13 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2746 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-03 14:18:08,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2746 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6109839816933638) internal successors, (704), 455 states have internal predecessors, (704), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 931 transitions. [2025-03-03 14:18:08,560 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 931 transitions. Word has length 73 [2025-03-03 14:18:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,560 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 931 transitions. [2025-03-03 14:18:08,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 931 transitions. [2025-03-03 14:18:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:18:08,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:08,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:08,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1024305077, now seen corresponding path program 1 times [2025-03-03 14:18:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043566745] [2025-03-03 14:18:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:18:08,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:18:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043566745] [2025-03-03 14:18:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043566745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144320655] [2025-03-03 14:18:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:08,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:08,668 INFO L87 Difference]: Start difference. First operand 580 states and 931 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,706 INFO L93 Difference]: Finished difference Result 1144 states and 1848 transitions. [2025-03-03 14:18:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-03 14:18:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,711 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 14:18:08,711 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 14:18:08,714 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-03 14:18:08,714 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 12 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2748 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-03 14:18:08,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2748 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 14:18:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-03 14:18:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.608695652173913) internal successors, (703), 455 states have internal predecessors, (703), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 930 transitions. [2025-03-03 14:18:08,734 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 930 transitions. Word has length 74 [2025-03-03 14:18:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,734 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 930 transitions. [2025-03-03 14:18:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 930 transitions. [2025-03-03 14:18:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:18:08,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:08,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:08,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801485, now seen corresponding path program 1 times [2025-03-03 14:18:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996379707] [2025-03-03 14:18:08,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:18:08,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:18:08,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996379707] [2025-03-03 14:18:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996379707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637091767] [2025-03-03 14:18:08,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:08,875 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-03 14:18:08,877 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-03 14:18:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:18:09,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:18:09,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:09,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:09,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637091767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199888898] [2025-03-03 14:18:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:09,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:09,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:09,195 INFO L87 Difference]: Start difference. First operand 580 states and 930 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:09,244 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2025-03-03 14:18:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-03 14:18:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:09,251 INFO L225 Difference]: With dead ends: 1651 [2025-03-03 14:18:09,252 INFO L226 Difference]: Without dead ends: 1089 [2025-03-03 14:18:09,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:09,255 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 891 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2404 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-03 14:18:09,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-03 14:18:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1074. [2025-03-03 14:18:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 816 states have (on average 1.6200980392156863) internal successors, (1322), 851 states have internal predecessors, (1322), 205 states have call successors, (205), 53 states have call predecessors, (205), 52 states have return successors, (207), 197 states have call predecessors, (207), 202 states have call successors, (207) [2025-03-03 14:18:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1734 transitions. [2025-03-03 14:18:09,291 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1734 transitions. Word has length 75 [2025-03-03 14:18:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:09,291 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1734 transitions. [2025-03-03 14:18:09,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1734 transitions. [2025-03-03 14:18:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:18:09,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:09,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:09,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:18:09,497 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-03 14:18:09,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -95777477, now seen corresponding path program 1 times [2025-03-03 14:18:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614064613] [2025-03-03 14:18:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:09,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:09,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614064613] [2025-03-03 14:18:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614064613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830536165] [2025-03-03 14:18:09,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:09,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:09,664 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-03 14:18:09,665 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-03 14:18:09,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:09,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:09,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:09,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830536165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:09,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081743758] [2025-03-03 14:18:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:09,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:09,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:09,994 INFO L87 Difference]: Start difference. First operand 1074 states and 1734 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:10,065 INFO L93 Difference]: Finished difference Result 2639 states and 4288 transitions. [2025-03-03 14:18:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:10,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-03 14:18:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:10,076 INFO L225 Difference]: With dead ends: 2639 [2025-03-03 14:18:10,076 INFO L226 Difference]: Without dead ends: 1583 [2025-03-03 14:18:10,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:10,083 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 893 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2454 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-03 14:18:10,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-03 14:18:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1535. [2025-03-03 14:18:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1168 states have (on average 1.6309931506849316) internal successors, (1905), 1220 states have internal predecessors, (1905), 292 states have call successors, (292), 74 states have call predecessors, (292), 74 states have return successors, (299), 282 states have call predecessors, (299), 289 states have call successors, (299) [2025-03-03 14:18:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2496 transitions. [2025-03-03 14:18:10,144 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2496 transitions. Word has length 76 [2025-03-03 14:18:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:10,144 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2496 transitions. [2025-03-03 14:18:10,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2496 transitions. [2025-03-03 14:18:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:18:10,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:10,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:10,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:18:10,347 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-03 14:18:10,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1281936583, now seen corresponding path program 1 times [2025-03-03 14:18:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906744569] [2025-03-03 14:18:10,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:10,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:18:10,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:18:10,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906744569] [2025-03-03 14:18:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906744569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:10,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281662919] [2025-03-03 14:18:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:10,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:10,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:10,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:10,485 INFO L87 Difference]: Start difference. First operand 1535 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:11,054 INFO L93 Difference]: Finished difference Result 4529 states and 7519 transitions. [2025-03-03 14:18:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:11,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-03-03 14:18:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:11,082 INFO L225 Difference]: With dead ends: 4529 [2025-03-03 14:18:11,082 INFO L226 Difference]: Without dead ends: 3012 [2025-03-03 14:18:11,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:11,094 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 920 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:11,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 4872 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-03-03 14:18:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2965. [2025-03-03 14:18:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2257 states have (on average 1.6304829419583518) internal successors, (3680), 2357 states have internal predecessors, (3680), 563 states have call successors, (563), 142 states have call predecessors, (563), 144 states have return successors, (661), 549 states have call predecessors, (661), 559 states have call successors, (661) [2025-03-03 14:18:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4904 transitions. [2025-03-03 14:18:11,241 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4904 transitions. Word has length 78 [2025-03-03 14:18:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:11,241 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4904 transitions. [2025-03-03 14:18:11,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4904 transitions. [2025-03-03 14:18:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:11,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:11,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:18:11,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1994506374, now seen corresponding path program 1 times [2025-03-03 14:18:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387366780] [2025-03-03 14:18:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:11,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:11,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:11,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387366780] [2025-03-03 14:18:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387366780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590850154] [2025-03-03 14:18:11,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:11,399 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-03 14:18:11,401 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-03 14:18:11,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:11,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:18:11,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:11,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590850154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 14:18:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007765037] [2025-03-03 14:18:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:11,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:11,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:11,761 INFO L87 Difference]: Start difference. First operand 2965 states and 4904 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:12,513 INFO L93 Difference]: Finished difference Result 8048 states and 13578 transitions. [2025-03-03 14:18:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-03-03 14:18:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:12,554 INFO L225 Difference]: With dead ends: 8048 [2025-03-03 14:18:12,554 INFO L226 Difference]: Without dead ends: 5101 [2025-03-03 14:18:12,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:18:12,576 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 790 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 4377 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:12,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 4377 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:18:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2025-03-03 14:18:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5058. [2025-03-03 14:18:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 3844 states have (on average 1.5837669094693028) internal successors, (6088), 4010 states have internal predecessors, (6088), 950 states have call successors, (950), 256 states have call predecessors, (950), 263 states have return successors, (1253), 931 states have call predecessors, (1253), 944 states have call successors, (1253) [2025-03-03 14:18:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 8291 transitions. [2025-03-03 14:18:12,864 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 8291 transitions. Word has length 79 [2025-03-03 14:18:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:12,865 INFO L471 AbstractCegarLoop]: Abstraction has 5058 states and 8291 transitions. [2025-03-03 14:18:12,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 8291 transitions. [2025-03-03 14:18:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:12,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:12,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:12,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:18:13,066 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-03 14:18:13,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1272238644, now seen corresponding path program 1 times [2025-03-03 14:18:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435920313] [2025-03-03 14:18:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:13,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:13,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:13,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:13,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435920313] [2025-03-03 14:18:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435920313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667646859] [2025-03-03 14:18:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:13,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:13,151 INFO L87 Difference]: Start difference. First operand 5058 states and 8291 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:13,359 INFO L93 Difference]: Finished difference Result 10122 states and 16757 transitions. [2025-03-03 14:18:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-03 14:18:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:13,399 INFO L225 Difference]: With dead ends: 10122 [2025-03-03 14:18:13,400 INFO L226 Difference]: Without dead ends: 5082 [2025-03-03 14:18:13,432 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-03 14:18:13,433 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 12 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:13,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2712 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2025-03-03 14:18:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 5066. [2025-03-03 14:18:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5066 states, 3850 states have (on average 1.5823376623376624) internal successors, (6092), 4016 states have internal predecessors, (6092), 950 states have call successors, (950), 260 states have call predecessors, (950), 265 states have return successors, (1242), 929 states have call predecessors, (1242), 944 states have call successors, (1242) [2025-03-03 14:18:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8284 transitions. [2025-03-03 14:18:13,709 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8284 transitions. Word has length 79 [2025-03-03 14:18:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:13,709 INFO L471 AbstractCegarLoop]: Abstraction has 5066 states and 8284 transitions. [2025-03-03 14:18:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8284 transitions. [2025-03-03 14:18:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:18:13,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:13,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:13,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:18:13,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash -535342406, now seen corresponding path program 1 times [2025-03-03 14:18:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791995716] [2025-03-03 14:18:13,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:13,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:18:13,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:18:13,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:13,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:18:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791995716] [2025-03-03 14:18:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791995716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:13,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023909623] [2025-03-03 14:18:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:13,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:13,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:13,831 INFO L87 Difference]: Start difference. First operand 5066 states and 8284 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:14,557 INFO L93 Difference]: Finished difference Result 15131 states and 25733 transitions. [2025-03-03 14:18:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-03 14:18:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:14,640 INFO L225 Difference]: With dead ends: 15131 [2025-03-03 14:18:14,640 INFO L226 Difference]: Without dead ends: 10083 [2025-03-03 14:18:14,665 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-03 14:18:14,666 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 918 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:14,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 4616 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2025-03-03 14:18:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 10014. [2025-03-03 14:18:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10014 states, 7612 states have (on average 1.5781660535995796) internal successors, (12013), 7938 states have internal predecessors, (12013), 1872 states have call successors, (1872), 514 states have call predecessors, (1872), 529 states have return successors, (2976), 1841 states have call predecessors, (2976), 1862 states have call successors, (2976) [2025-03-03 14:18:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10014 states to 10014 states and 16861 transitions. [2025-03-03 14:18:15,088 INFO L78 Accepts]: Start accepts. Automaton has 10014 states and 16861 transitions. Word has length 87 [2025-03-03 14:18:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:15,088 INFO L471 AbstractCegarLoop]: Abstraction has 10014 states and 16861 transitions. [2025-03-03 14:18:15,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 10014 states and 16861 transitions. [2025-03-03 14:18:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:18:15,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:15,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:15,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:15,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -623128512, now seen corresponding path program 1 times [2025-03-03 14:18:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774861987] [2025-03-03 14:18:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:15,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:18:15,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:18:15,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:18:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774861987] [2025-03-03 14:18:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774861987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773154183] [2025-03-03 14:18:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:15,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:15,155 INFO L87 Difference]: Start difference. First operand 10014 states and 16861 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:15,649 INFO L93 Difference]: Finished difference Result 20082 states and 34295 transitions. [2025-03-03 14:18:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:15,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-03 14:18:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:15,724 INFO L225 Difference]: With dead ends: 20082 [2025-03-03 14:18:15,724 INFO L226 Difference]: Without dead ends: 10086 [2025-03-03 14:18:15,774 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-03 14:18:15,775 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 12 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:15,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2703 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10086 states. [2025-03-03 14:18:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10086 to 10054. [2025-03-03 14:18:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10054 states, 7648 states have (on average 1.5759675732217573) internal successors, (12053), 7966 states have internal predecessors, (12053), 1872 states have call successors, (1872), 530 states have call predecessors, (1872), 533 states have return successors, (2960), 1837 states have call predecessors, (2960), 1862 states have call successors, (2960) [2025-03-03 14:18:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 16885 transitions. [2025-03-03 14:18:16,223 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 16885 transitions. Word has length 88 [2025-03-03 14:18:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:16,225 INFO L471 AbstractCegarLoop]: Abstraction has 10054 states and 16885 transitions. [2025-03-03 14:18:16,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 16885 transitions. [2025-03-03 14:18:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:18:16,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:16,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:18:16,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1177289767, now seen corresponding path program 1 times [2025-03-03 14:18:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151092349] [2025-03-03 14:18:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:18:16,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:18:16,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:16,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151092349] [2025-03-03 14:18:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151092349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:16,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:16,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318478175] [2025-03-03 14:18:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:16,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:16,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:16,357 INFO L87 Difference]: Start difference. First operand 10054 states and 16885 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:17,319 INFO L93 Difference]: Finished difference Result 30173 states and 53637 transitions. [2025-03-03 14:18:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:17,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-03 14:18:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:17,483 INFO L225 Difference]: With dead ends: 30173 [2025-03-03 14:18:17,483 INFO L226 Difference]: Without dead ends: 20137 [2025-03-03 14:18:17,541 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-03 14:18:17,542 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 912 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:17,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 4626 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20137 states. [2025-03-03 14:18:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20137 to 20036. [2025-03-03 14:18:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20036 states, 15244 states have (on average 1.572487536079769) internal successors, (23971), 15874 states have internal predecessors, (23971), 3722 states have call successors, (3722), 1054 states have call predecessors, (3722), 1069 states have return successors, (7491), 3667 states have call predecessors, (7491), 3704 states have call successors, (7491) [2025-03-03 14:18:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20036 states to 20036 states and 35184 transitions. [2025-03-03 14:18:18,380 INFO L78 Accepts]: Start accepts. Automaton has 20036 states and 35184 transitions. Word has length 97 [2025-03-03 14:18:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:18,380 INFO L471 AbstractCegarLoop]: Abstraction has 20036 states and 35184 transitions. [2025-03-03 14:18:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 20036 states and 35184 transitions. [2025-03-03 14:18:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:18:18,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:18,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:18,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:18,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2101523720, now seen corresponding path program 1 times [2025-03-03 14:18:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398811035] [2025-03-03 14:18:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:18,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:18:18,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:18:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:18,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:18:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:18,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398811035] [2025-03-03 14:18:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398811035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:18,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20785176] [2025-03-03 14:18:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:18,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:18,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:18,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:18,557 INFO L87 Difference]: Start difference. First operand 20036 states and 35184 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:19,503 INFO L93 Difference]: Finished difference Result 40198 states and 72152 transitions. [2025-03-03 14:18:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-03 14:18:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:19,705 INFO L225 Difference]: With dead ends: 40198 [2025-03-03 14:18:19,705 INFO L226 Difference]: Without dead ends: 20180 [2025-03-03 14:18:19,850 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-03 14:18:19,851 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 11 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:19,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2703 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20180 states. [2025-03-03 14:18:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20180 to 20116. [2025-03-03 14:18:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20116 states, 15316 states have (on average 1.5703186210498825) internal successors, (24051), 15946 states have internal predecessors, (24051), 3722 states have call successors, (3722), 1070 states have call predecessors, (3722), 1077 states have return successors, (7471), 3659 states have call predecessors, (7471), 3704 states have call successors, (7471) [2025-03-03 14:18:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20116 states to 20116 states and 35244 transitions. [2025-03-03 14:18:20,804 INFO L78 Accepts]: Start accepts. Automaton has 20116 states and 35244 transitions. Word has length 98 [2025-03-03 14:18:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:20,805 INFO L471 AbstractCegarLoop]: Abstraction has 20116 states and 35244 transitions. [2025-03-03 14:18:20,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 20116 states and 35244 transitions. [2025-03-03 14:18:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:18:20,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:20,807 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:20,808 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:20,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1691228903, now seen corresponding path program 1 times [2025-03-03 14:18:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236618399] [2025-03-03 14:18:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:18:20,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:18:20,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:20,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:18:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236618399] [2025-03-03 14:18:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236618399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:20,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733586335] [2025-03-03 14:18:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:20,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:20,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:20,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:20,933 INFO L87 Difference]: Start difference. First operand 20116 states and 35244 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:22,578 INFO L93 Difference]: Finished difference Result 60485 states and 115379 transitions. [2025-03-03 14:18:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-03 14:18:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:22,871 INFO L225 Difference]: With dead ends: 60485 [2025-03-03 14:18:22,871 INFO L226 Difference]: Without dead ends: 40387 [2025-03-03 14:18:22,984 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-03 14:18:22,987 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 909 mSDsluCounter, 3747 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:22,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 4781 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40387 states. [2025-03-03 14:18:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40387 to 40222. [2025-03-03 14:18:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40222 states, 30628 states have (on average 1.5678790649079273) internal successors, (48021), 31882 states have internal predecessors, (48021), 7428 states have call successors, (7428), 2134 states have call predecessors, (7428), 2165 states have return successors, (19862), 7325 states have call predecessors, (19862), 7394 states have call successors, (19862) [2025-03-03 14:18:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40222 states to 40222 states and 75311 transitions. [2025-03-03 14:18:25,003 INFO L78 Accepts]: Start accepts. Automaton has 40222 states and 75311 transitions. Word has length 108 [2025-03-03 14:18:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:25,005 INFO L471 AbstractCegarLoop]: Abstraction has 40222 states and 75311 transitions. [2025-03-03 14:18:25,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40222 states and 75311 transitions. [2025-03-03 14:18:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:18:25,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:25,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:25,009 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:25,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1777459806, now seen corresponding path program 1 times [2025-03-03 14:18:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704010154] [2025-03-03 14:18:25,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:25,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:25,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:18:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:18:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:18:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704010154] [2025-03-03 14:18:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704010154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931329137] [2025-03-03 14:18:25,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:25,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:25,198 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-03 14:18:25,200 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-03 14:18:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:18:25,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:18:25,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:25,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:25,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:18:25,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:18:25,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931329137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:25,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:18:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99011947] [2025-03-03 14:18:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:18:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:25,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:18:25,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:18:25,886 INFO L87 Difference]: Start difference. First operand 40222 states and 75311 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:18:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:33,428 INFO L93 Difference]: Finished difference Result 143277 states and 289512 transitions. [2025-03-03 14:18:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:18:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2025-03-03 14:18:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:34,271 INFO L225 Difference]: With dead ends: 143277 [2025-03-03 14:18:34,271 INFO L226 Difference]: Without dead ends: 103073 [2025-03-03 14:18:34,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:18:34,557 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 3192 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 6864 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3384 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 7594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 6864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:34,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3384 Valid, 2473 Invalid, 7594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 6864 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 14:18:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103073 states. [2025-03-03 14:18:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103073 to 101800. [2025-03-03 14:18:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101800 states, 77610 states have (on average 1.5624404071640252) internal successors, (121261), 80648 states have internal predecessors, (121261), 18568 states have call successors, (18568), 5286 states have call predecessors, (18568), 5621 states have return successors, (59575), 18601 states have call predecessors, (59575), 18502 states have call successors, (59575) [2025-03-03 14:18:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101800 states to 101800 states and 199404 transitions. [2025-03-03 14:18:40,460 INFO L78 Accepts]: Start accepts. Automaton has 101800 states and 199404 transitions. Word has length 137 [2025-03-03 14:18:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 101800 states and 199404 transitions. [2025-03-03 14:18:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:18:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 101800 states and 199404 transitions. [2025-03-03 14:18:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:18:40,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:40,462 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:40,471 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-03 14:18:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:40,662 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1981473217, now seen corresponding path program 1 times [2025-03-03 14:18:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659591393] [2025-03-03 14:18:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:18:40,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:18:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:18:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659591393] [2025-03-03 14:18:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659591393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187128334] [2025-03-03 14:18:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:40,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:40,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:40,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:40,932 INFO L87 Difference]: Start difference. First operand 101800 states and 199404 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:18:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:46,791 INFO L93 Difference]: Finished difference Result 204478 states and 418339 transitions. [2025-03-03 14:18:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-03 14:18:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:47,680 INFO L225 Difference]: With dead ends: 204478 [2025-03-03 14:18:47,680 INFO L226 Difference]: Without dead ends: 102696 [2025-03-03 14:18:48,531 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-03 14:18:48,533 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 10 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:48,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2703 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102696 states.