./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:58,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:58,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:58,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:58,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:58,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:58,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:58,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:58,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:58,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:58,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:58,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:58,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:58,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:58,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:58,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:58,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:58,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:58,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:58,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:58,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:58,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:58,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:58,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:58,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:58,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:58,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2025-03-16 19:42:58,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:58,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:58,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:58,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:58,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:58,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-03-16 19:42:59,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf230a49c/d2ecf8acf263410bacbe2ab0e16e6c07/FLAGbbe4acdc5 [2025-03-16 19:43:00,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:43:00,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-03-16 19:43:00,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf230a49c/d2ecf8acf263410bacbe2ab0e16e6c07/FLAGbbe4acdc5 [2025-03-16 19:43:00,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf230a49c/d2ecf8acf263410bacbe2ab0e16e6c07 [2025-03-16 19:43:00,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:43:00,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:43:00,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:00,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:43:00,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:43:00,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2272a827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00, skipping insertion in model container [2025-03-16 19:43:00,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:43:00,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2025-03-16 19:43:00,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:00,726 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:43:00,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2025-03-16 19:43:00,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:00,835 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:43:00,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00 WrapperNode [2025-03-16 19:43:00,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:00,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:00,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:43:00,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:43:00,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,904 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 681 [2025-03-16 19:43:00,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:00,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:43:00,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:43:00,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:43:00,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,955 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 8, 8, 8, 8, 20, 12, 12, 0, 4, 5, 21, 7, 3, 3, 6, 7, 22]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [2, 2, 3, 3, 3, 6, 6, 2, 0, 2, 2, 10, 0, 0, 0, 2, 0, 10]. The 38 writes are split as follows [0, 3, 2, 2, 2, 8, 3, 3, 0, 1, 1, 1, 1, 1, 1, 2, 1, 6]. [2025-03-16 19:43:00,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:00,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:01,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:43:01,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:43:01,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:43:01,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:43:01,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (1/1) ... [2025-03-16 19:43:01,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:01,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:01,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:43:01,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:43:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:43:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:43:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:43:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:43:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:43:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:43:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:43:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-03-16 19:43:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:43:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:43:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:43:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:43:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:43:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:43:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:43:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:43:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:43:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:43:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:43:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:43:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:43:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:43:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 19:43:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:43:01,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:43:01,287 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:43:01,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:43:01,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-16 19:43:01,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc #t~mem53; [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L937-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L935-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:01,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L931-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:01,997 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-16 19:43:01,998 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:43:02,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:43:02,015 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:43:02,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:02 BoogieIcfgContainer [2025-03-16 19:43:02,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:43:02,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:43:02,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:43:02,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:43:02,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:43:00" (1/3) ... [2025-03-16 19:43:02,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efb7162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:02, skipping insertion in model container [2025-03-16 19:43:02,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:00" (2/3) ... [2025-03-16 19:43:02,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efb7162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:02, skipping insertion in model container [2025-03-16 19:43:02,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:02" (3/3) ... [2025-03-16 19:43:02,024 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2025-03-16 19:43:02,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:43:02,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-1.i that has 10 procedures, 213 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-16 19:43:02,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:43:02,096 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;@ae71051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:43:02,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:43:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 129 states have (on average 1.5348837209302326) internal successors, (198), 132 states have internal predecessors, (198), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 19:43:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:43:02,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:02,140 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:02,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1662310290, now seen corresponding path program 1 times [2025-03-16 19:43:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822561430] [2025-03-16 19:43:02,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:43:02,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:43:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 19:43:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822561430] [2025-03-16 19:43:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822561430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5960915] [2025-03-16 19:43:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:02,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:02,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:02,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:02,657 INFO L87 Difference]: Start difference. First operand has 213 states, 129 states have (on average 1.5348837209302326) internal successors, (198), 132 states have internal predecessors, (198), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:06,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:06,752 INFO L93 Difference]: Finished difference Result 425 states and 754 transitions. [2025-03-16 19:43:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-03-16 19:43:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:06,761 INFO L225 Difference]: With dead ends: 425 [2025-03-16 19:43:06,761 INFO L226 Difference]: Without dead ends: 213 [2025-03-16 19:43:06,768 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-03-16 19:43:06,770 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 4 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:06,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 673 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 19:43:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-16 19:43:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2025-03-16 19:43:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.515625) internal successors, (194), 130 states have internal predecessors, (194), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 19:43:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 340 transitions. [2025-03-16 19:43:06,822 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 340 transitions. Word has length 94 [2025-03-16 19:43:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:06,822 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 340 transitions. [2025-03-16 19:43:06,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2025-03-16 19:43:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:43:06,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:06,826 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:43:06,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash -928023486, now seen corresponding path program 1 times [2025-03-16 19:43:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647553055] [2025-03-16 19:43:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:43:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:43:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:06,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 19:43:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647553055] [2025-03-16 19:43:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647553055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852382856] [2025-03-16 19:43:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:07,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:07,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:07,089 INFO L87 Difference]: Start difference. First operand 211 states and 340 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:07,131 INFO L93 Difference]: Finished difference Result 422 states and 682 transitions. [2025-03-16 19:43:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-16 19:43:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:07,133 INFO L225 Difference]: With dead ends: 422 [2025-03-16 19:43:07,134 INFO L226 Difference]: Without dead ends: 213 [2025-03-16 19:43:07,135 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-03-16 19:43:07,135 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:07,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-16 19:43:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-16 19:43:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 132 states have internal predecessors, (196), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 19:43:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2025-03-16 19:43:07,154 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 97 [2025-03-16 19:43:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2025-03-16 19:43:07,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2025-03-16 19:43:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:43:07,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:07,156 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:07,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:43:07,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 730152002, now seen corresponding path program 1 times [2025-03-16 19:43:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114588038] [2025-03-16 19:43:07,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:07,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:43:07,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:43:07,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:07,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 19:43:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114588038] [2025-03-16 19:43:07,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114588038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777960144] [2025-03-16 19:43:07,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:07,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:07,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:43:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:43:07,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:43:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:07,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:43:07,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 19:43:07,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 19:43:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777960144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:07,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:43:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578767591] [2025-03-16 19:43:07,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:07,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:07,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:07,850 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-16 19:43:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:07,915 INFO L93 Difference]: Finished difference Result 428 states and 690 transitions. [2025-03-16 19:43:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:43:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 99 [2025-03-16 19:43:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:07,918 INFO L225 Difference]: With dead ends: 428 [2025-03-16 19:43:07,918 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 19:43:07,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:07,919 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:07,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1003 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 19:43:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-16 19:43:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 134 states have (on average 1.492537313432836) internal successors, (200), 136 states have internal predecessors, (200), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 19:43:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 346 transitions. [2025-03-16 19:43:07,945 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 346 transitions. Word has length 99 [2025-03-16 19:43:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:07,945 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 346 transitions. [2025-03-16 19:43:07,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-16 19:43:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 346 transitions. [2025-03-16 19:43:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:43:07,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:07,951 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:07,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:43:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:08,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2028910722, now seen corresponding path program 2 times [2025-03-16 19:43:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322804469] [2025-03-16 19:43:08,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:08,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-16 19:43:08,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 103 statements. [2025-03-16 19:43:08,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:08,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 19:43:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322804469] [2025-03-16 19:43:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322804469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:08,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16300448] [2025-03-16 19:43:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:08,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:08,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:08,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:08,436 INFO L87 Difference]: Start difference. First operand 217 states and 346 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:08,484 INFO L93 Difference]: Finished difference Result 421 states and 683 transitions. [2025-03-16 19:43:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2025-03-16 19:43:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:08,490 INFO L225 Difference]: With dead ends: 421 [2025-03-16 19:43:08,490 INFO L226 Difference]: Without dead ends: 387 [2025-03-16 19:43:08,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:08,492 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 293 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:08,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1050 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-16 19:43:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 386. [2025-03-16 19:43:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 236 states have (on average 1.5338983050847457) internal successors, (362), 240 states have internal predecessors, (362), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-03-16 19:43:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 632 transitions. [2025-03-16 19:43:08,531 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 632 transitions. Word has length 103 [2025-03-16 19:43:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:08,531 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 632 transitions. [2025-03-16 19:43:08,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 632 transitions. [2025-03-16 19:43:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 19:43:08,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:08,535 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:08,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:43:08,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -856195701, now seen corresponding path program 1 times [2025-03-16 19:43:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028109770] [2025-03-16 19:43:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 19:43:08,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 19:43:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2025-03-16 19:43:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028109770] [2025-03-16 19:43:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028109770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199526549] [2025-03-16 19:43:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:08,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:08,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:43:09,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 19:43:09,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 19:43:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:09,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:43:09,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-03-16 19:43:09,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-03-16 19:43:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199526549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:09,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-03-16 19:43:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98517779] [2025-03-16 19:43:09,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:09,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:43:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:09,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:43:09,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:09,427 INFO L87 Difference]: Start difference. First operand 386 states and 632 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-16 19:43:11,136 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-03-16 19:43:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:11,155 INFO L93 Difference]: Finished difference Result 783 states and 1282 transitions. [2025-03-16 19:43:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:43:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 185 [2025-03-16 19:43:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:11,170 INFO L225 Difference]: With dead ends: 783 [2025-03-16 19:43:11,170 INFO L226 Difference]: Without dead ends: 399 [2025-03-16 19:43:11,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:43:11,172 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 12 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:11,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1665 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:43:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-16 19:43:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-16 19:43:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 253 states have internal predecessors, (377), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-03-16 19:43:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 647 transitions. [2025-03-16 19:43:11,192 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 647 transitions. Word has length 185 [2025-03-16 19:43:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:11,192 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 647 transitions. [2025-03-16 19:43:11,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-16 19:43:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 647 transitions. [2025-03-16 19:43:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 19:43:11,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:11,196 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:11,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:43:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:11,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 75380137, now seen corresponding path program 2 times [2025-03-16 19:43:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615206528] [2025-03-16 19:43:11,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:11,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-16 19:43:11,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 198 statements. [2025-03-16 19:43:11,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-16 19:43:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615206528] [2025-03-16 19:43:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615206528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:11,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049948954] [2025-03-16 19:43:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:11,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:11,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:11,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:11,707 INFO L87 Difference]: Start difference. First operand 399 states and 647 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:12,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:16,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:20,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:21,234 INFO L93 Difference]: Finished difference Result 822 states and 1342 transitions. [2025-03-16 19:43:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 198 [2025-03-16 19:43:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:21,242 INFO L225 Difference]: With dead ends: 822 [2025-03-16 19:43:21,242 INFO L226 Difference]: Without dead ends: 784 [2025-03-16 19:43:21,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:21,244 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 400 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:21,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1399 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2025-03-16 19:43:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-16 19:43:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 777. [2025-03-16 19:43:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 476 states have (on average 1.5252100840336134) internal successors, (726), 487 states have internal predecessors, (726), 261 states have call successors, (261), 36 states have call predecessors, (261), 39 states have return successors, (293), 261 states have call predecessors, (293), 261 states have call successors, (293) [2025-03-16 19:43:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1280 transitions. [2025-03-16 19:43:21,301 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1280 transitions. Word has length 198 [2025-03-16 19:43:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:21,302 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1280 transitions. [2025-03-16 19:43:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1280 transitions. [2025-03-16 19:43:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 19:43:21,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:21,308 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:21,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1193141513, now seen corresponding path program 1 times [2025-03-16 19:43:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280600952] [2025-03-16 19:43:21,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:21,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:43:21,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:43:21,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:21,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-16 19:43:21,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280600952] [2025-03-16 19:43:21,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280600952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:21,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:21,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231715805] [2025-03-16 19:43:21,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:21,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:21,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:21,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:21,931 INFO L87 Difference]: Start difference. First operand 777 states and 1280 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:25,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:30,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:30,364 INFO L93 Difference]: Finished difference Result 1524 states and 2502 transitions. [2025-03-16 19:43:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 198 [2025-03-16 19:43:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:30,370 INFO L225 Difference]: With dead ends: 1524 [2025-03-16 19:43:30,371 INFO L226 Difference]: Without dead ends: 776 [2025-03-16 19:43:30,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:30,374 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 330 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:30,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1492 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-16 19:43:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-16 19:43:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 766. [2025-03-16 19:43:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 471 states have (on average 1.5180467091295118) internal successors, (715), 483 states have internal predecessors, (715), 254 states have call successors, (254), 35 states have call predecessors, (254), 40 states have return successors, (283), 255 states have call predecessors, (283), 254 states have call successors, (283) [2025-03-16 19:43:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1252 transitions. [2025-03-16 19:43:30,425 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1252 transitions. Word has length 198 [2025-03-16 19:43:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:30,425 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1252 transitions. [2025-03-16 19:43:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1252 transitions. [2025-03-16 19:43:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 19:43:30,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:30,432 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:30,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1814460050, now seen corresponding path program 1 times [2025-03-16 19:43:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809597769] [2025-03-16 19:43:30,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:30,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 19:43:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 19:43:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 19:43:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809597769] [2025-03-16 19:43:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809597769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738735841] [2025-03-16 19:43:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:30,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:30,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:30,976 INFO L87 Difference]: Start difference. First operand 766 states and 1252 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:34,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:39,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:39,460 INFO L93 Difference]: Finished difference Result 1204 states and 1935 transitions. [2025-03-16 19:43:39,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 195 [2025-03-16 19:43:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:39,468 INFO L225 Difference]: With dead ends: 1204 [2025-03-16 19:43:39,468 INFO L226 Difference]: Without dead ends: 777 [2025-03-16 19:43:39,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:39,471 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 395 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:39,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1398 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-16 19:43:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-16 19:43:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 761. [2025-03-16 19:43:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 468 states have (on average 1.517094017094017) internal successors, (710), 479 states have internal predecessors, (710), 253 states have call successors, (253), 35 states have call predecessors, (253), 39 states have return successors, (279), 254 states have call predecessors, (279), 253 states have call successors, (279) [2025-03-16 19:43:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1242 transitions. [2025-03-16 19:43:39,536 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1242 transitions. Word has length 195 [2025-03-16 19:43:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:39,537 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1242 transitions. [2025-03-16 19:43:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1242 transitions. [2025-03-16 19:43:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 19:43:39,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:39,543 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:43:39,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1120542576, now seen corresponding path program 1 times [2025-03-16 19:43:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465103766] [2025-03-16 19:43:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 19:43:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 19:43:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 19:43:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465103766] [2025-03-16 19:43:40,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465103766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:40,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:40,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930769121] [2025-03-16 19:43:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:40,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:40,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:40,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:40,096 INFO L87 Difference]: Start difference. First operand 761 states and 1242 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:41,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:42,056 INFO L93 Difference]: Finished difference Result 1201 states and 1928 transitions. [2025-03-16 19:43:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 195 [2025-03-16 19:43:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:42,061 INFO L225 Difference]: With dead ends: 1201 [2025-03-16 19:43:42,061 INFO L226 Difference]: Without dead ends: 675 [2025-03-16 19:43:42,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:42,065 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 452 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:42,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1161 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 19:43:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-16 19:43:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2025-03-16 19:43:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 417 states have (on average 1.484412470023981) internal successors, (619), 426 states have internal predecessors, (619), 214 states have call successors, (214), 35 states have call predecessors, (214), 39 states have return successors, (236), 215 states have call predecessors, (236), 214 states have call successors, (236) [2025-03-16 19:43:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1069 transitions. [2025-03-16 19:43:42,124 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1069 transitions. Word has length 195 [2025-03-16 19:43:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:42,124 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1069 transitions. [2025-03-16 19:43:42,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1069 transitions. [2025-03-16 19:43:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 19:43:42,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:42,129 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:42,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:43:42,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash -339973015, now seen corresponding path program 1 times [2025-03-16 19:43:42,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:42,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355750221] [2025-03-16 19:43:42,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:42,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:42,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:43:42,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:43:42,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 19:43:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355750221] [2025-03-16 19:43:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355750221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680567199] [2025-03-16 19:43:42,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:42,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:42,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:42,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:42,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:43:42,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:43:42,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:43:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:42,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:43,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-16 19:43:43,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 19:43:43,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680567199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:43,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-16 19:43:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087927948] [2025-03-16 19:43:43,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:43:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:43,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:43:43,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:43:43,385 INFO L87 Difference]: Start difference. First operand 671 states and 1069 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-16 19:43:47,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:49,690 INFO L93 Difference]: Finished difference Result 1691 states and 2716 transitions. [2025-03-16 19:43:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:43:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 198 [2025-03-16 19:43:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:49,697 INFO L225 Difference]: With dead ends: 1691 [2025-03-16 19:43:49,698 INFO L226 Difference]: Without dead ends: 1046 [2025-03-16 19:43:49,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:43:49,701 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 688 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 383 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:49,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1630 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1484 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-03-16 19:43:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-16 19:43:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1025. [2025-03-16 19:43:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 629 states have (on average 1.4833068362480126) internal successors, (933), 644 states have internal predecessors, (933), 334 states have call successors, (334), 57 states have call predecessors, (334), 61 states have return successors, (370), 333 states have call predecessors, (370), 334 states have call successors, (370) [2025-03-16 19:43:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1637 transitions. [2025-03-16 19:43:49,798 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1637 transitions. Word has length 198 [2025-03-16 19:43:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:49,799 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1637 transitions. [2025-03-16 19:43:49,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-16 19:43:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1637 transitions. [2025-03-16 19:43:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 19:43:49,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:49,809 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:49,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:43:50,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:50,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:50,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1683763369, now seen corresponding path program 1 times [2025-03-16 19:43:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907388018] [2025-03-16 19:43:50,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:50,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:43:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:43:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 19:43:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907388018] [2025-03-16 19:43:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907388018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598908826] [2025-03-16 19:43:51,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:51,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:51,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:51,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:43:51,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:43:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:43:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1755 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 19:43:51,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:52,035 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 13 treesize of output 9 [2025-03-16 19:43:59,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:43:59,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:43:59,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-03-16 19:43:59,457 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-16 19:43:59,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-16 19:44:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-03-16 19:44:24,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:24,342 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 25 treesize of output 23 [2025-03-16 19:44:24,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-03-16 19:44:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598908826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:29,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:44:29,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2025-03-16 19:44:29,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190847322] [2025-03-16 19:44:29,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:44:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:29,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:44:29,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1063, Unknown=4, NotChecked=0, Total=1190 [2025-03-16 19:44:29,658 INFO L87 Difference]: Start difference. First operand 1025 states and 1637 transitions. Second operand has 30 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 15 states have call successors, (50), 10 states have call predecessors, (50), 12 states have return successors, (50), 13 states have call predecessors, (50), 15 states have call successors, (50) [2025-03-16 19:44:34,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []