./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1eb342ebadad5f5d28e5fd9eb503795cab40e31c0a35c7b5f4b6a3c65ed5e13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:25:23,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:25:23,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:25:23,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:25:23,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:25:23,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:25:23,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:25:23,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:25:23,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:25:23,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:25:23,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:25:23,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:25:23,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:25:23,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:25:23,631 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:25:23,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:25:23,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:25:23,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:25:23,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:25:23,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:25:23,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:25:23,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:25:23,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:25:23,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:25:23,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:25:23,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:23,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:25:23,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:25:23,636 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1eb342ebadad5f5d28e5fd9eb503795cab40e31c0a35c7b5f4b6a3c65ed5e13 [2025-02-05 16:25:23,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:25:23,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:25:23,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:25:23,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:25:23,880 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:25:23,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c [2025-02-05 16:25:25,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8095e298/225fcc11872040c688dd6fc5b1077f8d/FLAGa57a586df [2025-02-05 16:25:25,594 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:25:25,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c [2025-02-05 16:25:25,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8095e298/225fcc11872040c688dd6fc5b1077f8d/FLAGa57a586df [2025-02-05 16:25:25,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8095e298/225fcc11872040c688dd6fc5b1077f8d [2025-02-05 16:25:25,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:25:25,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:25:25,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:25,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:25:25,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:25:25,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:25" (1/1) ... [2025-02-05 16:25:25,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ccef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:25, skipping insertion in model container [2025-02-05 16:25:25,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:25" (1/1) ... [2025-02-05 16:25:25,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:25:26,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c[1682,1695] [2025-02-05 16:25:26,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:26,352 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:25:26,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.ok2.i","-S") [42] [2025-02-05 16:25:26,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M1-2.c[1682,1695] [2025-02-05 16:25:26,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:26,531 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:25:26,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26 WrapperNode [2025-02-05 16:25:26,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:26,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:26,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:25:26,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:25:26,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,737 INFO L138 Inliner]: procedures = 56, calls = 2275, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 4945 [2025-02-05 16:25:26,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:26,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:25:26,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:25:26,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:25:26,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,824 INFO L175 MemorySlicer]: Split 1587 memory accesses to 15 slices as follows [2, 8, 277, 285, 2, 113, 113, 180, 203, 180, 203, 8, 7, 4, 2]. 18 percent of accesses are in the largest equivalence class. The 220 initializations are split as follows [2, 0, 27, 27, 0, 27, 27, 27, 27, 27, 27, 0, 2, 0, 0]. The 229 writes are split as follows [0, 4, 27, 27, 1, 27, 27, 28, 26, 28, 26, 4, 3, 0, 1]. [2025-02-05 16:25:26,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:26,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:27,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:25:27,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:25:27,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:25:27,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:25:27,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (1/1) ... [2025-02-05 16:25:27,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:27,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:25:27,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:25:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:25:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-05 16:25:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-05 16:25:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-05 16:25:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-05 16:25:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:25:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-05 16:25:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-05 16:25:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-05 16:25:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:25:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:25:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:25:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:25:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:25:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:25:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-05 16:25:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-05 16:25:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-05 16:25:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-05 16:25:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-05 16:25:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-05 16:25:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-05 16:25:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:25:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-05 16:25:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-05 16:25:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-05 16:25:27,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:25:27,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:25:28,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: 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-02-05 16:25:28,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: 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-02-05 16:25:34,436 INFO L? ?]: Removed 352 outVars from TransFormulas that were not future-live. [2025-02-05 16:25:34,436 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:25:34,471 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:25:34,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:25:34,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:34 BoogieIcfgContainer [2025-02-05 16:25:34,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:25:34,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:25:34,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:25:34,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:25:34,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:25:25" (1/3) ... [2025-02-05 16:25:34,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf0788c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:34, skipping insertion in model container [2025-02-05 16:25:34,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:26" (2/3) ... [2025-02-05 16:25:34,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf0788c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:34, skipping insertion in model container [2025-02-05 16:25:34,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:34" (3/3) ... [2025-02-05 16:25:34,486 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.2.M1-2.c [2025-02-05 16:25:34,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:25:34,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.2.M1-2.c that has 17 procedures, 1530 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:25:34,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:25:34,625 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;@6c0c59d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:25:34,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:25:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 1530 states, 874 states have (on average 1.257437070938215) internal successors, (1099), 1003 states have internal predecessors, (1099), 638 states have call successors, (638), 16 states have call predecessors, (638), 16 states have return successors, (638), 539 states have call predecessors, (638), 638 states have call successors, (638) [2025-02-05 16:25:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1309 [2025-02-05 16:25:34,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:34,736 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:34,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash 398468365, now seen corresponding path program 1 times [2025-02-05 16:25:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317101282] [2025-02-05 16:25:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:35,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1308 statements into 1 equivalence classes. [2025-02-05 16:25:35,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1308 of 1308 statements. [2025-02-05 16:25:35,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:35,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-02-05 16:25:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317101282] [2025-02-05 16:25:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317101282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722911953] [2025-02-05 16:25:36,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:36,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:36,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:36,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:25:37,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1308 statements into 1 equivalence classes. [2025-02-05 16:25:37,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1308 of 1308 statements. [2025-02-05 16:25:37,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:37,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 3899 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 16:25:37,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-02-05 16:25:37,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722911953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:37,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 16:25:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562838707] [2025-02-05 16:25:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:37,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:25:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:37,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:25:37,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:25:37,783 INFO L87 Difference]: Start difference. First operand has 1530 states, 874 states have (on average 1.257437070938215) internal successors, (1099), 1003 states have internal predecessors, (1099), 638 states have call successors, (638), 16 states have call predecessors, (638), 16 states have return successors, (638), 539 states have call predecessors, (638), 638 states have call successors, (638) Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 2 states have call successors, (212), 2 states have call predecessors, (212), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:25:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:38,065 INFO L93 Difference]: Finished difference Result 3055 states and 5366 transitions. [2025-02-05 16:25:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:25:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 2 states have call successors, (212), 2 states have call predecessors, (212), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1308 [2025-02-05 16:25:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:38,116 INFO L225 Difference]: With dead ends: 3055 [2025-02-05 16:25:38,120 INFO L226 Difference]: Without dead ends: 1525 [2025-02-05 16:25:38,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1309 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-02-05 16:25:38,150 INFO L435 NwaCegarLoop]: 2373 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, 2373 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-02-05 16:25:38,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:25:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-05 16:25:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2025-02-05 16:25:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 870 states have (on average 1.2563218390804598) internal successors, (1093), 999 states have internal predecessors, (1093), 638 states have call successors, (638), 16 states have call predecessors, (638), 16 states have return successors, (637), 538 states have call predecessors, (637), 637 states have call successors, (637) [2025-02-05 16:25:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2368 transitions. [2025-02-05 16:25:38,438 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2368 transitions. Word has length 1308 [2025-02-05 16:25:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2368 transitions. [2025-02-05 16:25:38,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 2 states have call successors, (212), 2 states have call predecessors, (212), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:25:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2368 transitions. [2025-02-05 16:25:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1309 [2025-02-05 16:25:38,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:38,474 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:38,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:25:38,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 16:25:38,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1086136344, now seen corresponding path program 1 times [2025-02-05 16:25:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096327774] [2025-02-05 16:25:38,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1308 statements into 1 equivalence classes. [2025-02-05 16:25:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1308 of 1308 statements. [2025-02-05 16:25:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:25:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096327774] [2025-02-05 16:25:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096327774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:25:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892446099] [2025-02-05 16:25:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:25:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:40,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:25:40,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:25:40,063 INFO L87 Difference]: Start difference. First operand 1525 states and 2368 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:25:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:40,184 INFO L93 Difference]: Finished difference Result 2575 states and 4048 transitions. [2025-02-05 16:25:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:25:40,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1308 [2025-02-05 16:25:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:40,206 INFO L225 Difference]: With dead ends: 2575 [2025-02-05 16:25:40,206 INFO L226 Difference]: Without dead ends: 1525 [2025-02-05 16:25:40,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-05 16:25:40,214 INFO L435 NwaCegarLoop]: 2366 mSDtfsCounter, 0 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4722 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-02-05 16:25:40,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4722 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:25:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-05 16:25:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2025-02-05 16:25:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 870 states have (on average 1.2551724137931035) internal successors, (1092), 999 states have internal predecessors, (1092), 638 states have call successors, (638), 16 states have call predecessors, (638), 16 states have return successors, (637), 538 states have call predecessors, (637), 637 states have call successors, (637) [2025-02-05 16:25:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2367 transitions. [2025-02-05 16:25:40,423 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2367 transitions. Word has length 1308 [2025-02-05 16:25:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:40,426 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2367 transitions. [2025-02-05 16:25:40,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:25:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2367 transitions. [2025-02-05 16:25:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2025-02-05 16:25:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:40,439 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:40,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:25:40,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 414700353, now seen corresponding path program 1 times [2025-02-05 16:25:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:40,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623106287] [2025-02-05 16:25:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1317 statements into 1 equivalence classes. [2025-02-05 16:25:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1317 of 1317 statements. [2025-02-05 16:25:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:25:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623106287] [2025-02-05 16:25:43,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623106287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306904145] [2025-02-05 16:25:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:43,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:43,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:43,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:43,921 INFO L87 Difference]: Start difference. First operand 1525 states and 2367 transitions. Second operand has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-02-05 16:25:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:46,275 INFO L93 Difference]: Finished difference Result 2815 states and 4401 transitions. [2025-02-05 16:25:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:46,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) Word has length 1317 [2025-02-05 16:25:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:46,288 INFO L225 Difference]: With dead ends: 2815 [2025-02-05 16:25:46,288 INFO L226 Difference]: Without dead ends: 1765 [2025-02-05 16:25:46,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:46,297 INFO L435 NwaCegarLoop]: 2701 mSDtfsCounter, 3381 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:46,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 3982 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:25:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-02-05 16:25:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2025-02-05 16:25:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1048 states have (on average 1.2700381679389312) internal successors, (1331), 1177 states have internal predecessors, (1331), 695 states have call successors, (695), 21 states have call predecessors, (695), 21 states have return successors, (694), 595 states have call predecessors, (694), 694 states have call successors, (694) [2025-02-05 16:25:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2720 transitions. [2025-02-05 16:25:46,429 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2720 transitions. Word has length 1317 [2025-02-05 16:25:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:46,432 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2720 transitions. [2025-02-05 16:25:46,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-02-05 16:25:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2720 transitions. [2025-02-05 16:25:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-02-05 16:25:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:46,443 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:25:46,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1226339940, now seen corresponding path program 1 times [2025-02-05 16:25:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:46,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469715845] [2025-02-05 16:25:46,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:46,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1321 statements into 1 equivalence classes. [2025-02-05 16:25:46,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1321 of 1321 statements. [2025-02-05 16:25:46,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:46,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:25:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469715845] [2025-02-05 16:25:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469715845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520324347] [2025-02-05 16:25:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:47,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:47,845 INFO L87 Difference]: Start difference. First operand 1765 states and 2720 transitions. Second operand has 5 states, 4 states have (on average 67.0) internal successors, (268), 5 states have internal predecessors, (268), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-02-05 16:25:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:50,206 INFO L93 Difference]: Finished difference Result 3051 states and 4747 transitions. [2025-02-05 16:25:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 67.0) internal successors, (268), 5 states have internal predecessors, (268), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) Word has length 1321 [2025-02-05 16:25:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:50,221 INFO L225 Difference]: With dead ends: 3051 [2025-02-05 16:25:50,222 INFO L226 Difference]: Without dead ends: 1761 [2025-02-05 16:25:50,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:50,231 INFO L435 NwaCegarLoop]: 2694 mSDtfsCounter, 3370 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3370 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:50,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3370 Valid, 3973 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:25:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-02-05 16:25:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2025-02-05 16:25:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1046 states have (on average 1.268642447418738) internal successors, (1327), 1175 states have internal predecessors, (1327), 693 states have call successors, (693), 21 states have call predecessors, (693), 21 states have return successors, (692), 593 states have call predecessors, (692), 692 states have call successors, (692) [2025-02-05 16:25:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2712 transitions. [2025-02-05 16:25:50,368 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2712 transitions. Word has length 1321 [2025-02-05 16:25:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:50,370 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2712 transitions. [2025-02-05 16:25:50,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 67.0) internal successors, (268), 5 states have internal predecessors, (268), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-02-05 16:25:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2712 transitions. [2025-02-05 16:25:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1323 [2025-02-05 16:25:50,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:50,382 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:50,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:25:50,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2009257390, now seen corresponding path program 1 times [2025-02-05 16:25:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188266437] [2025-02-05 16:25:50,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:50,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-02-05 16:25:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-02-05 16:25:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:25:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188266437] [2025-02-05 16:25:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188266437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681067936] [2025-02-05 16:25:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:52,964 INFO L87 Difference]: Start difference. First operand 1761 states and 2712 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-02-05 16:25:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:55,085 INFO L93 Difference]: Finished difference Result 2717 states and 4240 transitions. [2025-02-05 16:25:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) Word has length 1322 [2025-02-05 16:25:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:55,104 INFO L225 Difference]: With dead ends: 2717 [2025-02-05 16:25:55,104 INFO L226 Difference]: Without dead ends: 2702 [2025-02-05 16:25:55,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:55,106 INFO L435 NwaCegarLoop]: 2662 mSDtfsCounter, 2654 mSDsluCounter, 6337 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2741 SdHoareTripleChecker+Valid, 8999 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:55,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2741 Valid, 8999 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:25:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2025-02-05 16:25:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2677. [2025-02-05 16:25:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 1584 states have (on average 1.2973484848484849) internal successors, (2055), 1835 states have internal predecessors, (2055), 1058 states have call successors, (1058), 33 states have call predecessors, (1058), 34 states have return successors, (1080), 862 states have call predecessors, (1080), 1057 states have call successors, (1080) [2025-02-05 16:25:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4193 transitions. [2025-02-05 16:25:55,347 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4193 transitions. Word has length 1322 [2025-02-05 16:25:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 4193 transitions. [2025-02-05 16:25:55,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-02-05 16:25:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4193 transitions. [2025-02-05 16:25:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1328 [2025-02-05 16:25:55,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:55,360 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-02-05 16:25:55,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:25:55,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:55,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1317161116, now seen corresponding path program 1 times [2025-02-05 16:25:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511486762] [2025-02-05 16:25:55,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:55,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes. [2025-02-05 16:26:00,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements. [2025-02-05 16:26:00,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 426 proven. 198 refuted. 0 times theorem prover too weak. 86323 trivial. 0 not checked. [2025-02-05 16:26:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511486762] [2025-02-05 16:26:03,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511486762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:26:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420538809] [2025-02-05 16:26:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:26:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:26:03,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:26:03,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:26:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes. [2025-02-05 16:26:12,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements. [2025-02-05 16:26:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:12,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 3959 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 16:26:12,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:26:12,620 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-02-05 16:26:13,173 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 29 treesize of output 17 [2025-02-05 16:26:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 37080 proven. 84 refuted. 0 times theorem prover too weak. 49783 trivial. 0 not checked. [2025-02-05 16:26:13,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:26:14,219 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 40 treesize of output 28 [2025-02-05 16:26:14,450 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 39 treesize of output 27 [2025-02-05 16:26:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 1374 proven. 489 refuted. 0 times theorem prover too weak. 85084 trivial. 0 not checked. [2025-02-05 16:26:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420538809] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:26:14,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:26:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 15] total 34 [2025-02-05 16:26:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947404260] [2025-02-05 16:26:14,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:26:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:26:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:14,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:26:14,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:26:14,870 INFO L87 Difference]: Start difference. First operand 2677 states and 4193 transitions. Second operand has 34 states, 27 states have (on average 16.037037037037038) internal successors, (433), 34 states have internal predecessors, (433), 15 states have call successors, (347), 5 states have call predecessors, (347), 9 states have return successors, (346), 10 states have call predecessors, (346), 15 states have call successors, (346) [2025-02-05 16:26:16,247 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-02-05 16:26:18,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:22,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:23,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:24,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:26,118 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-02-05 16:26:27,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:29,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:32,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:44,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:47,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []