./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 15:23:55,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:23:55,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:23:55,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:23:55,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:23:55,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:23:55,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:23:55,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:23:55,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:23:55,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:23:55,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:23:55,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:23:55,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:23:55,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:23:55,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:23:55,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:23:55,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:23:55,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:23:55,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:23:55,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:55,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:23:55,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:23:55,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:23:55,580 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-03 15:23:55,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:23:55,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:23:55,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:23:55,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:23:55,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:23:55,808 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-03 15:23:56,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20b8614f/36ef71a18cf144378cff2352510ff6a3/FLAG75a1f599d [2025-03-03 15:23:57,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:23:57,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-03-03 15:23:57,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20b8614f/36ef71a18cf144378cff2352510ff6a3/FLAG75a1f599d [2025-03-03 15:23:57,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20b8614f/36ef71a18cf144378cff2352510ff6a3 [2025-03-03 15:23:57,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:23:57,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:23:57,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:57,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:23:57,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:23:57,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@942e99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57, skipping insertion in model container [2025-03-03 15:23:57,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:23:57,549 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-03 15:23:57,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:57,667 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:23:57,702 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-03 15:23:57,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:57,802 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:23:57,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57 WrapperNode [2025-03-03 15:23:57,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:57,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:57,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:23:57,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:23:57,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,871 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 681 [2025-03-03 15:23:57,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:57,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:23:57,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:23:57,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:23:57,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,922 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 6, 22, 3, 8, 8, 8, 20, 12, 12, 4, 5, 8, 21, 0, 7, 7, 3]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [2, 2, 10, 0, 3, 3, 3, 6, 6, 2, 2, 2, 2, 10, 0, 0, 0, 0]. The 38 writes are split as follows [0, 2, 6, 1, 2, 2, 2, 8, 3, 3, 1, 1, 3, 1, 0, 1, 1, 1]. [2025-03-03 15:23:57,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:23:57,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:23:57,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:23:57,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:23:57,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (1/1) ... [2025-03-03 15:23:57,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:57,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:57,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:23:58,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:23:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:23:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-03 15:23:58,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:23:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-03 15:23:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:23:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:23:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-03 15:23:58,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:23:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-03-03 15:23:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:23:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:23:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:23:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:23:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:23:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:23:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:23:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:23:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:23:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:23:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:23:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 15:23:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:23:58,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:23:58,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:23:58,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:23:58,310 INFO L1325 $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-03 15:23:58,311 INFO L1325 $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-03 15:23:58,311 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,311 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc #t~mem53; [2025-03-03 15:23:58,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-03-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $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-03 15:23:58,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,730 INFO L1325 $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-03 15:23:58,731 INFO L1325 $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-03 15:23:58,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,731 INFO L1325 $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-03 15:23:58,731 INFO L1325 $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-03 15:23:58,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,743 INFO L1325 $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-03 15:23:58,743 INFO L1325 $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-03 15:23:58,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L937-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,743 INFO L1325 $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-03 15:23:58,743 INFO L1325 $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-03 15:23:58,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L935-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,744 INFO L1325 $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-03 15:23:58,744 INFO L1325 $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-03 15:23:58,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:58,744 INFO L1325 $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-03 15:23:58,744 INFO L1325 $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-03 15:23:58,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L931-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:59,105 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-03 15:23:59,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:23:59,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:23:59,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:23:59,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:59 BoogieIcfgContainer [2025-03-03 15:23:59,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:23:59,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:23:59,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:23:59,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:23:59,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:23:57" (1/3) ... [2025-03-03 15:23:59,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62de197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:59, skipping insertion in model container [2025-03-03 15:23:59,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:57" (2/3) ... [2025-03-03 15:23:59,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62de197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:59, skipping insertion in model container [2025-03-03 15:23:59,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:59" (3/3) ... [2025-03-03 15:23:59,121 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2025-03-03 15:23:59,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:23:59,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-1.i that has 10 procedures, 216 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 15:23:59,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:23:59,183 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;@5bcf82c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:23:59,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:23:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 132 states have (on average 1.5227272727272727) internal successors, (201), 135 states have internal predecessors, (201), 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-03 15:23:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:23:59,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:59,226 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] [2025-03-03 15:23:59,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:59,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 79501406, now seen corresponding path program 1 times [2025-03-03 15:23:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735897465] [2025-03-03 15:23:59,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:59,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:23:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:23:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:59,779 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-03 15:23:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735897465] [2025-03-03 15:23:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735897465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:59,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298798792] [2025-03-03 15:23:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:59,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:59,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:59,801 INFO L87 Difference]: Start difference. First operand has 216 states, 132 states have (on average 1.5227272727272727) internal successors, (201), 135 states have internal predecessors, (201), 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.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03 15:24:03,838 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-03 15:24:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:03,893 INFO L93 Difference]: Finished difference Result 430 states and 759 transitions. [2025-03-03 15:24:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:03,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 95 [2025-03-03 15:24:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:03,906 INFO L225 Difference]: With dead ends: 430 [2025-03-03 15:24:03,906 INFO L226 Difference]: Without dead ends: 215 [2025-03-03 15:24:03,911 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-03 15:24:03,913 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 4 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 679 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-03 15:24:03,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 679 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 15:24:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-03 15:24:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2025-03-03 15:24:03,960 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-03 15:24:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2025-03-03 15:24:03,972 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 95 [2025-03-03 15:24:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:03,972 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2025-03-03 15:24:03,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03 15:24:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2025-03-03 15:24:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:24:03,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:03,978 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] [2025-03-03 15:24:03,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:24:03,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:03,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1510518610, now seen corresponding path program 1 times [2025-03-03 15:24:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352495892] [2025-03-03 15:24:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:04,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:24:04,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:24:04,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:04,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:04,239 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-03 15:24:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:04,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352495892] [2025-03-03 15:24:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352495892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:04,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968625136] [2025-03-03 15:24:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:04,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:04,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:04,241 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03 15:24:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:04,283 INFO L93 Difference]: Finished difference Result 425 states and 685 transitions. [2025-03-03 15:24:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 98 [2025-03-03 15:24:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:04,286 INFO L225 Difference]: With dead ends: 425 [2025-03-03 15:24:04,286 INFO L226 Difference]: Without dead ends: 215 [2025-03-03 15:24:04,287 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-03 15:24:04,287 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 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-03 15:24:04,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-03 15:24:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-03 15:24:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 132 states have (on average 1.5) internal successors, (198), 134 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-03 15:24:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 344 transitions. [2025-03-03 15:24:04,302 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 344 transitions. Word has length 98 [2025-03-03 15:24:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:04,303 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 344 transitions. [2025-03-03 15:24:04,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03 15:24:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 344 transitions. [2025-03-03 15:24:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:24:04,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:04,306 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, 1] [2025-03-03 15:24:04,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:24:04,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:04,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash -915119826, now seen corresponding path program 1 times [2025-03-03 15:24:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227466257] [2025-03-03 15:24:04,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:04,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:24:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:24:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:04,559 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-03 15:24:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227466257] [2025-03-03 15:24:04,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227466257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266317724] [2025-03-03 15:24:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:04,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:04,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:04,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:24:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:24:04,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:24:04,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:04,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:04,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:04,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:04,927 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-03 15:24:04,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:05,023 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-03 15:24:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266317724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:05,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:24:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139523472] [2025-03-03 15:24:05,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:05,026 INFO L87 Difference]: Start difference. First operand 215 states and 344 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-03 15:24:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:05,092 INFO L93 Difference]: Finished difference Result 431 states and 693 transitions. [2025-03-03 15:24:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:24:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 100 [2025-03-03 15:24:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:05,098 INFO L225 Difference]: With dead ends: 431 [2025-03-03 15:24:05,098 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 15:24:05,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 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-03 15:24:05,099 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1009 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-03 15:24:05,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1009 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 15:24:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-03 15:24:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.4852941176470589) internal successors, (202), 138 states have internal predecessors, (202), 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-03 15:24:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 348 transitions. [2025-03-03 15:24:05,122 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 348 transitions. Word has length 100 [2025-03-03 15:24:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:05,123 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 348 transitions. [2025-03-03 15:24:05,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-03 15:24:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2025-03-03 15:24:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:24:05,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:05,127 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, 1] [2025-03-03 15:24:05,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:24:05,328 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-03 15:24:05,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -830595474, now seen corresponding path program 2 times [2025-03-03 15:24:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790422694] [2025-03-03 15:24:05,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:05,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-03 15:24:05,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 104 statements. [2025-03-03 15:24:05,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:05,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:05,583 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-03 15:24:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:05,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790422694] [2025-03-03 15:24:05,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790422694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:05,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:05,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895045634] [2025-03-03 15:24:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:05,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:05,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:05,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:05,584 INFO L87 Difference]: Start difference. First operand 219 states and 348 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-03 15:24:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:05,638 INFO L93 Difference]: Finished difference Result 424 states and 686 transitions. [2025-03-03 15:24:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:05,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 104 [2025-03-03 15:24:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:05,642 INFO L225 Difference]: With dead ends: 424 [2025-03-03 15:24:05,642 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 15:24:05,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:05,644 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 294 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1055 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-03 15:24:05,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1055 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 15:24:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2025-03-03 15:24:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 239 states have (on average 1.5271966527196652) internal successors, (365), 243 states have internal predecessors, (365), 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-03 15:24:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 635 transitions. [2025-03-03 15:24:05,681 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 635 transitions. Word has length 104 [2025-03-03 15:24:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 635 transitions. [2025-03-03 15:24:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-03 15:24:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 635 transitions. [2025-03-03 15:24:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 15:24:05,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:05,688 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:24:05,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash -531583238, now seen corresponding path program 1 times [2025-03-03 15:24:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:05,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111631661] [2025-03-03 15:24:05,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:05,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 15:24:05,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 15:24:05,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:05,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 15:24:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111631661] [2025-03-03 15:24:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111631661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580193301] [2025-03-03 15:24:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:05,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:05,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:24:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 15:24:06,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 15:24:06,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:06,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:06,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 15:24:06,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-03 15:24:06,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-03 15:24:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580193301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:06,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-03-03 15:24:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048609208] [2025-03-03 15:24:06,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:24:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:06,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:24:06,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:06,623 INFO L87 Difference]: Start difference. First operand 389 states and 635 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 15:24:10,766 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-03 15:24:14,780 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-03 15:24:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:14,817 INFO L93 Difference]: Finished difference Result 788 states and 1287 transitions. [2025-03-03 15:24:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:24:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 183 [2025-03-03 15:24:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:14,826 INFO L225 Difference]: With dead ends: 788 [2025-03-03 15:24:14,827 INFO L226 Difference]: Without dead ends: 402 [2025-03-03 15:24:14,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 366 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-03 15:24:14,830 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 12 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:14,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1339 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 15:24:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-03 15:24:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-03 15:24:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 252 states have (on average 1.507936507936508) internal successors, (380), 256 states have internal predecessors, (380), 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-03 15:24:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 650 transitions. [2025-03-03 15:24:14,855 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 650 transitions. Word has length 183 [2025-03-03 15:24:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:14,855 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 650 transitions. [2025-03-03 15:24:14,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 15:24:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 650 transitions. [2025-03-03 15:24:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 15:24:14,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:14,859 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, 1] [2025-03-03 15:24:14,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:24:15,060 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-03 15:24:15,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -304791912, now seen corresponding path program 2 times [2025-03-03 15:24:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883922317] [2025-03-03 15:24:15,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:15,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-03 15:24:15,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 196 statements. [2025-03-03 15:24:15,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:15,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:15,311 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-03 15:24:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883922317] [2025-03-03 15:24:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883922317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501927456] [2025-03-03 15:24:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:15,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:15,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:15,313 INFO L87 Difference]: Start difference. First operand 402 states and 650 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 15:24:19,323 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-03 15:24:23,327 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-03 15:24:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:23,430 INFO L93 Difference]: Finished difference Result 1130 states and 1854 transitions. [2025-03-03 15:24:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 196 [2025-03-03 15:24:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:23,439 INFO L225 Difference]: With dead ends: 1130 [2025-03-03 15:24:23,439 INFO L226 Difference]: Without dead ends: 769 [2025-03-03 15:24:23,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:23,441 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 323 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:23,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1167 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 15:24:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-03 15:24:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 765. [2025-03-03 15:24:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 469 states have (on average 1.5245202558635393) internal successors, (715), 477 states have internal predecessors, (715), 259 states have call successors, (259), 36 states have call predecessors, (259), 36 states have return successors, (282), 259 states have call predecessors, (282), 259 states have call successors, (282) [2025-03-03 15:24:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1256 transitions. [2025-03-03 15:24:23,493 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1256 transitions. Word has length 196 [2025-03-03 15:24:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1256 transitions. [2025-03-03 15:24:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 15:24:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1256 transitions. [2025-03-03 15:24:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 15:24:23,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:23,499 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, 1, 1] [2025-03-03 15:24:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:23,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 886885431, now seen corresponding path program 1 times [2025-03-03 15:24:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:23,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460320259] [2025-03-03 15:24:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:23,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 15:24:23,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 15:24:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:24,203 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-03 15:24:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460320259] [2025-03-03 15:24:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460320259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:24,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:24,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611888418] [2025-03-03 15:24:24,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:24,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:24,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:24,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:24,204 INFO L87 Difference]: Start difference. First operand 765 states and 1256 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, (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-03 15:24:28,216 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-03 15:24:32,221 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-03 15:24:35,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:36,021 INFO L93 Difference]: Finished difference Result 1182 states and 1924 transitions. [2025-03-03 15:24:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:36,022 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, (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 200 [2025-03-03 15:24:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:36,027 INFO L225 Difference]: With dead ends: 1182 [2025-03-03 15:24:36,027 INFO L226 Difference]: Without dead ends: 763 [2025-03-03 15:24:36,029 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-03 15:24:36,029 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 325 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:36,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1505 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2025-03-03 15:24:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-03 15:24:36,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 756. [2025-03-03 15:24:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 465 states have (on average 1.5161290322580645) internal successors, (705), 475 states have internal predecessors, (705), 252 states have call successors, (252), 35 states have call predecessors, (252), 38 states have return successors, (276), 253 states have call predecessors, (276), 252 states have call successors, (276) [2025-03-03 15:24:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1233 transitions. [2025-03-03 15:24:36,080 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1233 transitions. Word has length 200 [2025-03-03 15:24:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:36,081 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1233 transitions. [2025-03-03 15:24:36,081 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, (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-03 15:24:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1233 transitions. [2025-03-03 15:24:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 15:24:36,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:36,087 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, 1] [2025-03-03 15:24:36,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:24:36,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:36,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:36,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2062460630, now seen corresponding path program 1 times [2025-03-03 15:24:36,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308344712] [2025-03-03 15:24:36,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 15:24:36,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 15:24:36,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:36,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:36,612 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-03 15:24:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308344712] [2025-03-03 15:24:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308344712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:36,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35672180] [2025-03-03 15:24:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:36,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:36,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:36,614 INFO L87 Difference]: Start difference. First operand 756 states and 1233 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-03 15:24:40,628 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-03 15:24:44,833 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-03 15:24:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:45,132 INFO L93 Difference]: Finished difference Result 812 states and 1306 transitions. [2025-03-03 15:24:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 196 [2025-03-03 15:24:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:45,138 INFO L225 Difference]: With dead ends: 812 [2025-03-03 15:24:45,139 INFO L226 Difference]: Without dead ends: 770 [2025-03-03 15:24:45,140 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-03 15:24:45,140 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 392 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:45,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1407 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-03 15:24:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-03 15:24:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 754. [2025-03-03 15:24:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 464 states have (on average 1.5129310344827587) internal successors, (702), 474 states have internal predecessors, (702), 251 states have call successors, (251), 35 states have call predecessors, (251), 38 states have return successors, (275), 252 states have call predecessors, (275), 251 states have call successors, (275) [2025-03-03 15:24:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1228 transitions. [2025-03-03 15:24:45,204 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1228 transitions. Word has length 196 [2025-03-03 15:24:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:45,204 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1228 transitions. [2025-03-03 15:24:45,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-03 15:24:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1228 transitions. [2025-03-03 15:24:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 15:24:45,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:45,211 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, 1] [2025-03-03 15:24:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:24:45,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2138137900, now seen corresponding path program 1 times [2025-03-03 15:24:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990381012] [2025-03-03 15:24:45,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:45,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 15:24:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 15:24:45,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:45,790 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-03 15:24:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990381012] [2025-03-03 15:24:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990381012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153667113] [2025-03-03 15:24:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:45,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:45,792 INFO L87 Difference]: Start difference. First operand 754 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-03 15:24:49,805 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-03 15:24:53,813 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-03 15:24:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:54,347 INFO L93 Difference]: Finished difference Result 1184 states and 1898 transitions. [2025-03-03 15:24:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 196 [2025-03-03 15:24:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:54,353 INFO L225 Difference]: With dead ends: 1184 [2025-03-03 15:24:54,353 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 15:24:54,355 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-03 15:24:54,356 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 448 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 81 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:54,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1179 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-03 15:24:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 15:24:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 661. [2025-03-03 15:24:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 411 states have (on average 1.4598540145985401) internal successors, (600), 419 states have internal predecessors, (600), 211 states have call successors, (211), 35 states have call predecessors, (211), 38 states have return successors, (232), 212 states have call predecessors, (232), 211 states have call successors, (232) [2025-03-03 15:24:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1043 transitions. [2025-03-03 15:24:54,425 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1043 transitions. Word has length 196 [2025-03-03 15:24:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1043 transitions. [2025-03-03 15:24:54,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-03 15:24:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1043 transitions. [2025-03-03 15:24:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 15:24:54,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:54,430 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, 1, 1] [2025-03-03 15:24:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:24:54,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 639366261, now seen corresponding path program 1 times [2025-03-03 15:24:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:54,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595514823] [2025-03-03 15:24:54,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:54,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 15:24:54,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 15:24:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:54,903 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-03 15:24:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595514823] [2025-03-03 15:24:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595514823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778856908] [2025-03-03 15:24:54,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:54,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:54,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:24:55,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 15:24:55,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 15:24:55,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:55,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:55,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:55,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:55,522 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-03 15:24:55,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:55,877 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-03 15:24:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778856908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:55,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:24:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232824657] [2025-03-03 15:24:55,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:55,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:24:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:55,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:24:55,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:24:55,882 INFO L87 Difference]: Start difference. First operand 661 states and 1043 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-03 15:24:59,898 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-03 15:25:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,253 INFO L93 Difference]: Finished difference Result 1667 states and 2658 transitions. [2025-03-03 15:25:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:25:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 200 [2025-03-03 15:25:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:01,261 INFO L225 Difference]: With dead ends: 1667 [2025-03-03 15:25:01,261 INFO L226 Difference]: Without dead ends: 1033 [2025-03-03 15:25:01,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 399 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-03 15:25:01,267 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 801 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 462 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:01,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1402 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1144 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 15:25:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-03-03 15:25:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1012. [2025-03-03 15:25:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 621 states have (on average 1.4669887278582932) internal successors, (911), 636 states have internal predecessors, (911), 330 states have call successors, (330), 56 states have call predecessors, (330), 60 states have return successors, (365), 329 states have call predecessors, (365), 330 states have call successors, (365) [2025-03-03 15:25:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1606 transitions. [2025-03-03 15:25:01,372 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1606 transitions. Word has length 200 [2025-03-03 15:25:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:01,374 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1606 transitions. [2025-03-03 15:25:01,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-03 15:25:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1606 transitions. [2025-03-03 15:25:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 15:25:01,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:01,383 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, 1, 1] [2025-03-03 15:25:01,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:25:01,584 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-03 15:25:01,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1631864651, now seen corresponding path program 1 times [2025-03-03 15:25:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214463490] [2025-03-03 15:25:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 15:25:01,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 15:25:01,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:03,118 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-03 15:25:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214463490] [2025-03-03 15:25:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214463490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893750381] [2025-03-03 15:25:03,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:03,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:03,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:25:03,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 15:25:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 15:25:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:03,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:03,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 15:25:03,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:03,875 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-03 15:25:09,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:25:09,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:25:09,093 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-03 15:25:10,572 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-03 15:25:10,572 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-03 15:25:31,541 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-03 15:25:31,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:31,735 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-03 15:25:31,741 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