./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.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 d2d3aad0694c3b388c0809528dd70602c78583397ee307f7b8ddb787c2822233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:10:27,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:10:27,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:10:27,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:10:27,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:10:27,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:10:27,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:10:27,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:10:27,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:10:27,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:10:27,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:10:27,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:10:27,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:10:27,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:10:27,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:10:27,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:10:27,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:10:27,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:10:27,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:10:27,257 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 -> d2d3aad0694c3b388c0809528dd70602c78583397ee307f7b8ddb787c2822233 [2025-03-08 06:10:27,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:10:27,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:10:27,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:10:27,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:10:27,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:10:27,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c [2025-03-08 06:10:28,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c7b944e/1451871f257345f78ddaa6428e815ff8/FLAG5c3080f53 [2025-03-08 06:10:28,925 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:10:28,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c [2025-03-08 06:10:28,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c7b944e/1451871f257345f78ddaa6428e815ff8/FLAG5c3080f53 [2025-03-08 06:10:28,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c7b944e/1451871f257345f78ddaa6428e815ff8 [2025-03-08 06:10:28,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:10:28,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:10:28,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:10:28,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:10:28,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:10:28,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:28" (1/1) ... [2025-03-08 06:10:28,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:28, skipping insertion in model container [2025-03-08 06:10:28,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:28" (1/1) ... [2025-03-08 06:10:29,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:10:29,126 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/seq-mthreaded/rekh_nxt.1.M1-1.c[1510,1523] [2025-03-08 06:10:29,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:10:29,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:10:29,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.bug1.i","-S") [38] [2025-03-08 06:10:29,426 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/seq-mthreaded/rekh_nxt.1.M1-1.c[1510,1523] [2025-03-08 06:10:29,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:10:29,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:10:29,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29 WrapperNode [2025-03-08 06:10:29,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:10:29,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:10:29,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:10:29,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:10:29,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,795 INFO L138 Inliner]: procedures = 55, calls = 2249, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 4880 [2025-03-08 06:10:29,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:10:29,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:10:29,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:10:29,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:10:29,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,900 INFO L175 MemorySlicer]: Split 1588 memory accesses to 15 slices as follows [2, 2, 277, 285, 113, 113, 181, 203, 8, 180, 203, 2, 7, 4, 8]. 18 percent of accesses are in the largest equivalence class. The 220 initializations are split as follows [2, 0, 27, 27, 27, 27, 27, 27, 0, 27, 27, 0, 2, 0, 0]. The 229 writes are split as follows [0, 1, 27, 27, 27, 27, 28, 26, 4, 28, 26, 1, 3, 0, 4]. [2025-03-08 06:10:29,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:29,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:10:30,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:10:30,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:10:30,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:10:30,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (1/1) ... [2025-03-08 06:10:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:10:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:30,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:10:30,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:10:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:10:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-08 06:10:30,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-08 06:10:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-03-08 06:10:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-08 06:10:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-08 06:10:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-03-08 06:10:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:10:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-08 06:10:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-03-08 06:10:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-08 06:10:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-08 06:10:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-08 06:10:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:10:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-08 06:10:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-03-08 06:10:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-03-08 06:10:30,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:10:30,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:10:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-03-08 06:10:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-03-08 06:10:36,313 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2025-03-08 06:10:36,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:10:36,352 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:10:36,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:10:36,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:36 BoogieIcfgContainer [2025-03-08 06:10:36,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:10:36,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:10:36,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:10:36,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:10:36,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:28" (1/3) ... [2025-03-08 06:10:36,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548dada5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:36, skipping insertion in model container [2025-03-08 06:10:36,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:29" (2/3) ... [2025-03-08 06:10:36,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548dada5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:36, skipping insertion in model container [2025-03-08 06:10:36,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:36" (3/3) ... [2025-03-08 06:10:36,366 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.1.M1-1.c [2025-03-08 06:10:36,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:10:36,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.1.M1-1.c that has 16 procedures, 1472 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:10:36,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:10:36,480 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;@3556c44f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:10:36,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:10:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 1472 states, 844 states have (on average 1.2618483412322274) internal successors, (1065), 973 states have internal predecessors, (1065), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-08 06:10:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2025-03-08 06:10:36,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:10:36,597 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:10:36,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:10:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:10:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 251454681, now seen corresponding path program 1 times [2025-03-08 06:10:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:10:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929477629] [2025-03-08 06:10:36,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:10:37,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-08 06:10:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-08 06:10:37,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:37,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 120576 trivial. 0 not checked. [2025-03-08 06:10:38,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:10:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929477629] [2025-03-08 06:10:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929477629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:10:38,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114038413] [2025-03-08 06:10:38,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:10:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:38,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:10:38,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:10:39,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-08 06:10:40,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-08 06:10:40,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:40,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:40,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 7426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 06:10:40,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:10:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 120576 trivial. 0 not checked. [2025-03-08 06:10:40,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:10:40,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114038413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:10:40,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:10:40,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 06:10:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704648817] [2025-03-08 06:10:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:10:40,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:10:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:10:40,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:10:40,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:10:40,405 INFO L87 Difference]: Start difference. First operand has 1472 states, 844 states have (on average 1.2618483412322274) internal successors, (1065), 973 states have internal predecessors, (1065), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) Second operand has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) [2025-03-08 06:10:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:10:40,577 INFO L93 Difference]: Finished difference Result 2939 states and 5163 transitions. [2025-03-08 06:10:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:10:40,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) Word has length 2130 [2025-03-08 06:10:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:10:40,608 INFO L225 Difference]: With dead ends: 2939 [2025-03-08 06:10:40,609 INFO L226 Difference]: Without dead ends: 1467 [2025-03-08 06:10:40,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 2131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:10:40,626 INFO L435 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:10:40,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:10:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-08 06:10:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2025-03-08 06:10:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 840 states have (on average 1.2595238095238095) internal successors, (1058), 968 states have internal predecessors, (1058), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-08 06:10:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2280 transitions. [2025-03-08 06:10:40,892 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2280 transitions. Word has length 2130 [2025-03-08 06:10:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:10:40,893 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2280 transitions. [2025-03-08 06:10:40,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) [2025-03-08 06:10:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2280 transitions. [2025-03-08 06:10:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2025-03-08 06:10:40,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:10:40,973 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:10:40,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:10:41,174 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,SelfDestructingSolverStorable0 [2025-03-08 06:10:41,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:10:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:10:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1404845610, now seen corresponding path program 1 times [2025-03-08 06:10:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:10:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103976938] [2025-03-08 06:10:41,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:10:41,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-08 06:10:41,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-08 06:10:41,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:41,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 120941 trivial. 0 not checked. [2025-03-08 06:10:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:10:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103976938] [2025-03-08 06:10:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103976938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:10:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702948955] [2025-03-08 06:10:43,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:10:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:43,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:10:43,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:10:44,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-08 06:10:44,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-08 06:10:44,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:44,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:44,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 7426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:10:44,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:10:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 27793 proven. 0 refuted. 0 times theorem prover too weak. 93263 trivial. 0 not checked. [2025-03-08 06:10:44,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:10:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702948955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:10:44,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:10:44,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-08 06:10:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294872822] [2025-03-08 06:10:44,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:10:44,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:10:44,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:10:44,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:10:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:10:44,911 INFO L87 Difference]: Start difference. First operand 1467 states and 2280 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) [2025-03-08 06:10:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:10:45,020 INFO L93 Difference]: Finished difference Result 2459 states and 3872 transitions. [2025-03-08 06:10:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:10:45,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) Word has length 2130 [2025-03-08 06:10:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:10:45,043 INFO L225 Difference]: With dead ends: 2459 [2025-03-08 06:10:45,043 INFO L226 Difference]: Without dead ends: 1467 [2025-03-08 06:10:45,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2132 GetRequests, 2131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:10:45,049 INFO L435 NwaCegarLoop]: 2278 mSDtfsCounter, 0 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:10:45,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4546 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:10:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-08 06:10:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2025-03-08 06:10:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 840 states have (on average 1.2583333333333333) internal successors, (1057), 968 states have internal predecessors, (1057), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-08 06:10:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2279 transitions. [2025-03-08 06:10:45,229 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2279 transitions. Word has length 2130 [2025-03-08 06:10:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:10:45,233 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2279 transitions. [2025-03-08 06:10:45,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) [2025-03-08 06:10:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2279 transitions. [2025-03-08 06:10:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2323 [2025-03-08 06:10:45,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:10:45,268 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:10:45,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:10:45,468 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,SelfDestructingSolverStorable1 [2025-03-08 06:10:45,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:10:45,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:10:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash -141459562, now seen corresponding path program 1 times [2025-03-08 06:10:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:10:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784272861] [2025-03-08 06:10:45,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:10:45,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-08 06:10:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-08 06:10:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 124992 backedges. 4 proven. 116 refuted. 0 times theorem prover too weak. 124872 trivial. 0 not checked. [2025-03-08 06:10:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:10:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784272861] [2025-03-08 06:10:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784272861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:10:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608842699] [2025-03-08 06:10:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:10:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:48,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:10:48,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:10:48,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-08 06:10:49,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-08 06:10:49,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:49,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:49,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 8194 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 06:10:49,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:10:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 124992 backedges. 27563 proven. 0 refuted. 0 times theorem prover too weak. 97429 trivial. 0 not checked. [2025-03-08 06:10:49,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:10:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608842699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:10:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:10:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-08 06:10:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407274401] [2025-03-08 06:10:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:10:49,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:10:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:10:49,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:10:49,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:10:49,872 INFO L87 Difference]: Start difference. First operand 1467 states and 2279 transitions. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) [2025-03-08 06:10:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:10:51,736 INFO L93 Difference]: Finished difference Result 2695 states and 4224 transitions. [2025-03-08 06:10:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:10:51,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) Word has length 2322 [2025-03-08 06:10:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:10:51,755 INFO L225 Difference]: With dead ends: 2695 [2025-03-08 06:10:51,755 INFO L226 Difference]: Without dead ends: 1703 [2025-03-08 06:10:51,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2328 GetRequests, 2321 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:10:51,765 INFO L435 NwaCegarLoop]: 2266 mSDtfsCounter, 1331 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 6660 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:10:51,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 6660 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 06:10:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-03-08 06:10:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1703. [2025-03-08 06:10:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1016 states have (on average 1.2726377952755905) internal successors, (1293), 1144 states have internal predecessors, (1293), 666 states have call successors, (666), 20 states have call predecessors, (666), 20 states have return successors, (666), 567 states have call predecessors, (666), 666 states have call successors, (666) [2025-03-08 06:10:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2625 transitions. [2025-03-08 06:10:51,916 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2625 transitions. Word has length 2322 [2025-03-08 06:10:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:10:51,918 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2625 transitions. [2025-03-08 06:10:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) [2025-03-08 06:10:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2625 transitions. [2025-03-08 06:10:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2025-03-08 06:10:51,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:10:51,947 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:10:51,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:10:52,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:10:52,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:10:52,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:10:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1201619873, now seen corresponding path program 1 times [2025-03-08 06:10:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:10:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64006827] [2025-03-08 06:10:52,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:52,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:10:52,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2310 statements into 1 equivalence classes. [2025-03-08 06:10:52,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2310 of 2310 statements. [2025-03-08 06:10:52,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 124767 trivial. 0 not checked. [2025-03-08 06:10:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:10:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64006827] [2025-03-08 06:10:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64006827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:10:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983290977] [2025-03-08 06:10:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:10:57,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:10:57,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:57,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:10:57,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:10:58,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2310 statements into 1 equivalence classes. [2025-03-08 06:10:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2310 of 2310 statements. [2025-03-08 06:10:58,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:10:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:10:58,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 8158 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:10:58,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:10:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 25585 proven. 2 refuted. 0 times theorem prover too weak. 99537 trivial. 0 not checked. [2025-03-08 06:10:58,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:11:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 12 proven. 144 refuted. 0 times theorem prover too weak. 124968 trivial. 0 not checked. [2025-03-08 06:11:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983290977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:11:00,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:11:00,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-08 06:11:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466152695] [2025-03-08 06:11:00,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:11:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:11:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:11:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:11:00,217 INFO L87 Difference]: Start difference. First operand 1703 states and 2625 transitions. Second operand has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) [2025-03-08 06:11:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:03,751 INFO L93 Difference]: Finished difference Result 2938 states and 4573 transitions. [2025-03-08 06:11:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:11:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) Word has length 2310 [2025-03-08 06:11:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:03,766 INFO L225 Difference]: With dead ends: 2938 [2025-03-08 06:11:03,766 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 06:11:03,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4626 GetRequests, 4614 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:11:03,776 INFO L435 NwaCegarLoop]: 2607 mSDtfsCounter, 2572 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 6165 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 10673 SdHoareTripleChecker+Invalid, 6193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:03,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 10673 Invalid, 6193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 6165 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 06:11:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 06:11:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2025-03-08 06:11:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.2681017612524461) internal successors, (1296), 1150 states have internal predecessors, (1296), 665 states have call successors, (665), 22 states have call predecessors, (665), 22 states have return successors, (665), 566 states have call predecessors, (665), 665 states have call successors, (665) [2025-03-08 06:11:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2626 transitions. [2025-03-08 06:11:03,974 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2626 transitions. Word has length 2310 [2025-03-08 06:11:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:03,975 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2626 transitions. [2025-03-08 06:11:03,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) [2025-03-08 06:11:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2626 transitions. [2025-03-08 06:11:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2435 [2025-03-08 06:11:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:04,012 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 26, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:04,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:11:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:04,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash -618844254, now seen corresponding path program 1 times [2025-03-08 06:11:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083063506] [2025-03-08 06:11:04,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:04,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2434 statements into 1 equivalence classes. [2025-03-08 06:11:04,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2434 of 2434 statements. [2025-03-08 06:11:04,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:04,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 126404 backedges. 0 proven. 402 refuted. 0 times theorem prover too weak. 126002 trivial. 0 not checked. [2025-03-08 06:11:07,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083063506] [2025-03-08 06:11:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083063506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:11:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221131862] [2025-03-08 06:11:07,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:07,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:11:07,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:11:07,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:11:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2434 statements into 1 equivalence classes. [2025-03-08 06:11:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2434 of 2434 statements. [2025-03-08 06:11:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:08,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 8506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 06:11:08,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:11:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 126404 backedges. 27648 proven. 0 refuted. 0 times theorem prover too weak. 98756 trivial. 0 not checked. [2025-03-08 06:11:09,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:11:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221131862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:09,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:11:09,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:11:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945086809] [2025-03-08 06:11:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:09,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:11:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:11:09,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:11:09,835 INFO L87 Difference]: Start difference. First operand 1710 states and 2626 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) [2025-03-08 06:11:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:09,914 INFO L93 Difference]: Finished difference Result 2945 states and 4582 transitions. [2025-03-08 06:11:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:11:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) Word has length 2434 [2025-03-08 06:11:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:09,932 INFO L225 Difference]: With dead ends: 2945 [2025-03-08 06:11:09,932 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 06:11:09,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2439 GetRequests, 2435 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:11:09,941 INFO L435 NwaCegarLoop]: 2267 mSDtfsCounter, 1608 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:09,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 2267 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:11:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 06:11:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2025-03-08 06:11:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.264187866927593) internal successors, (1292), 1150 states have internal predecessors, (1292), 665 states have call successors, (665), 22 states have call predecessors, (665), 22 states have return successors, (665), 566 states have call predecessors, (665), 665 states have call successors, (665) [2025-03-08 06:11:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2622 transitions. [2025-03-08 06:11:10,152 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2622 transitions. Word has length 2434 [2025-03-08 06:11:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:10,156 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2622 transitions. [2025-03-08 06:11:10,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) [2025-03-08 06:11:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2622 transitions. [2025-03-08 06:11:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2436 [2025-03-08 06:11:10,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:10,216 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 26, 26, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:10,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:11:10,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:10,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1352467487, now seen corresponding path program 1 times [2025-03-08 06:11:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795343037] [2025-03-08 06:11:10,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:10,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2435 statements into 1 equivalence classes. [2025-03-08 06:11:10,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2435 of 2435 statements. [2025-03-08 06:11:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 126441 trivial. 0 not checked. [2025-03-08 06:11:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795343037] [2025-03-08 06:11:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795343037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:11:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940219466] [2025-03-08 06:11:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:11:14,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:11:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:11:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2435 statements into 1 equivalence classes. [2025-03-08 06:11:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2435 of 2435 statements. [2025-03-08 06:11:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:16,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 8463 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 06:11:16,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:11:16,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1 [2025-03-08 06:11:16,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1 [2025-03-08 06:11:20,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 06:11:20,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 06:11:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 67320 proven. 1046 refuted. 0 times theorem prover too weak. 58086 trivial. 0 not checked. [2025-03-08 06:11:20,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:11:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 1486 proven. 1190 refuted. 0 times theorem prover too weak. 123776 trivial. 0 not checked. [2025-03-08 06:11:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940219466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:11:24,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:11:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 21, 18] total 38 [2025-03-08 06:11:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107549350] [2025-03-08 06:11:24,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:11:24,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 06:11:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:24,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 06:11:24,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 06:11:24,101 INFO L87 Difference]: Start difference. First operand 1710 states and 2622 transitions. Second operand has 38 states, 33 states have (on average 24.696969696969695) internal successors, (815), 35 states have internal predecessors, (815), 14 states have call successors, (517), 8 states have call predecessors, (517), 14 states have return successors, (518), 12 states have call predecessors, (518), 14 states have call successors, (518) [2025-03-08 06:11:25,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:11:28,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:11:36,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:11:40,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []