./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.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_lamport.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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:23:27,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:23:27,526 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:27,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:23:27,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:23:27,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:23:27,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:23:27,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:23:27,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:23:27,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:23:27,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:23:27,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:23:27,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:23:27,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:23:27,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:23:27,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:23:27,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:23:27,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:23:27,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:27,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:23:27,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:23:27,558 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2025-03-03 15:23:27,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:23:27,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:23:27,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:23:27,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:23:27,764 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:23:27,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-03-03 15:23:28,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3e933dc/831ecfc4f12e4fdf827753f41c37e295/FLAGd5e12150c [2025-03-03 15:23:29,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:23:29,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-03-03 15:23:29,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3e933dc/831ecfc4f12e4fdf827753f41c37e295/FLAGd5e12150c [2025-03-03 15:23:29,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3e933dc/831ecfc4f12e4fdf827753f41c37e295 [2025-03-03 15:23:29,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:23:29,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:23:29,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:29,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:23:29,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:23:29,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:29" (1/1) ... [2025-03-03 15:23:29,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bee4615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:29, skipping insertion in model container [2025-03-03 15:23:29,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:29" (1/1) ... [2025-03-03 15:23:29,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:23:29,459 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_lamport.i[23604,23617] [2025-03-03 15:23:29,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:29,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:23:29,584 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_lamport.i[23604,23617] [2025-03-03 15:23:29,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:29,666 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:23:29,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:29 WrapperNode [2025-03-03 15:23:29,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:29,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:29,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:23:29,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:23:29,672 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:29" (1/1) ... [2025-03-03 15:23:29,696 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:29" (1/1) ... [2025-03-03 15:23:29,724 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 471 [2025-03-03 15:23:29,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:29,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:23:29,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:23:29,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:23:29,732 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:29" (1/1) ... [2025-03-03 15:23:29,732 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:29" (1/1) ... [2025-03-03 15:23:29,738 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:29" (1/1) ... [2025-03-03 15:23:29,766 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 13, 8, 8, 8, 29, 21, 5, 7, 7, 7, 7, 0, 7, 5, 5, 5, 13, 6, 5]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 0, 3, 3, 3, 9, 9, 0, 3, 3, 3, 3, 0, 3, 0, 0, 0, 0, 2, 0]. The 42 writes are split as follows [0, 1, 2, 2, 2, 11, 6, 1, 2, 2, 2, 2, 0, 2, 1, 1, 1, 1, 2, 1]. [2025-03-03 15:23:29,769 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:29" (1/1) ... [2025-03-03 15:23:29,769 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:29" (1/1) ... [2025-03-03 15:23:29,796 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:29" (1/1) ... [2025-03-03 15:23:29,797 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:29" (1/1) ... [2025-03-03 15:23:29,804 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:29" (1/1) ... [2025-03-03 15:23:29,811 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:29" (1/1) ... [2025-03-03 15:23:29,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:23:29,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:23:29,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:23:29,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:23:29,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:29" (1/1) ... [2025-03-03 15:23:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:29,848 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:29,851 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:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:23:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 15:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:23:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-03 15:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:23:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:23:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:23:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:23:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:23:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:23:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-03 15:23:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-03 15:23:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-03 15:23:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:23:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:29,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:23:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:23:29,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:23:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 15:23:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:23:29,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:23:30,101 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:23:30,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:23:31,037 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-03 15:23:31,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:23:31,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:23:31,047 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:23:31,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:31 BoogieIcfgContainer [2025-03-03 15:23:31,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:23:31,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:23:31,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:23:31,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:23:31,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:23:29" (1/3) ... [2025-03-03 15:23:31,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9555b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:31, skipping insertion in model container [2025-03-03 15:23:31,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:29" (2/3) ... [2025-03-03 15:23:31,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9555b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:31, skipping insertion in model container [2025-03-03 15:23:31,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:31" (3/3) ... [2025-03-03 15:23:31,057 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2025-03-03 15:23:31,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:23:31,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lamport.i that has 6 procedures, 114 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 15:23:31,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:23:31,123 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;@7a563df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:23:31,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:23:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 15:23:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:23:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:31,136 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 833356980, now seen corresponding path program 1 times [2025-03-03 15:23:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112245684] [2025-03-03 15:23:31,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:31,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:23:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:23:31,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:31,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:23:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112245684] [2025-03-03 15:23:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112245684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184174001] [2025-03-03 15:23:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:31,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:31,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:31,781 INFO L87 Difference]: Start difference. First operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:32,487 INFO L93 Difference]: Finished difference Result 226 states and 360 transitions. [2025-03-03 15:23:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-03-03 15:23:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:32,494 INFO L225 Difference]: With dead ends: 226 [2025-03-03 15:23:32,494 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 15:23:32,497 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:23:32,501 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 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.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:32,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:23:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 15:23:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-03 15:23:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 15:23:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-03 15:23:32,536 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 143 [2025-03-03 15:23:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:32,537 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-03 15:23:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-03 15:23:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 15:23:32,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:32,540 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:23:32,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash 897982048, now seen corresponding path program 1 times [2025-03-03 15:23:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542347429] [2025-03-03 15:23:32,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:32,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 15:23:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 15:23:32,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:23:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542347429] [2025-03-03 15:23:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542347429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387042593] [2025-03-03 15:23:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:32,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:32,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:32,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:32,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:32,872 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:32,895 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-03-03 15:23:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:32,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-03 15:23:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:32,897 INFO L225 Difference]: With dead ends: 220 [2025-03-03 15:23:32,897 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 15:23:32,898 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:23:32,898 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:32,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 15:23:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 15:23:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 15:23:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-03 15:23:32,910 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 145 [2025-03-03 15:23:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-03 15:23:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-03 15:23:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 15:23:32,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:32,912 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:23:32,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1238924687, now seen corresponding path program 1 times [2025-03-03 15:23:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249935069] [2025-03-03 15:23:32,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:33,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:23:33,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:23:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:33,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:23:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249935069] [2025-03-03 15:23:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249935069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769719684] [2025-03-03 15:23:33,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:33,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:33,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:33,164 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:23:33,165 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:23:33,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:23:33,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:23:33,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:33,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:33,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:33,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:23:33,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:23:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769719684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:33,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:23:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233128635] [2025-03-03 15:23:33,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:33,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:23:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:33,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:23:33,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:33,767 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 15:23:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:33,808 INFO L93 Difference]: Finished difference Result 223 states and 321 transitions. [2025-03-03 15:23:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 146 [2025-03-03 15:23:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:33,810 INFO L225 Difference]: With dead ends: 223 [2025-03-03 15:23:33,810 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 15:23:33,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 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:23:33,811 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 465 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:23:33,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 15:23:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-03 15:23:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 15:23:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-03-03 15:23:33,822 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 146 [2025-03-03 15:23:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:33,822 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-03-03 15:23:33,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 15:23:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-03-03 15:23:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:23:33,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:33,824 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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] [2025-03-03 15:23:33,834 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:23:34,024 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:23:34,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 151606191, now seen corresponding path program 2 times [2025-03-03 15:23:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947914746] [2025-03-03 15:23:34,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:34,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-03 15:23:34,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 148 statements. [2025-03-03 15:23:34,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-03-03 15:23:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947914746] [2025-03-03 15:23:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947914746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:23:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930207995] [2025-03-03 15:23:34,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:34,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:23:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:34,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:23:34,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:23:34,279 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:34,316 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-03-03 15:23:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:23:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-03 15:23:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:34,319 INFO L225 Difference]: With dead ends: 218 [2025-03-03 15:23:34,322 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 15:23:34,322 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:23:34,323 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:34,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 490 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 15:23:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-03 15:23:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-03 15:23:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2025-03-03 15:23:34,339 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 148 [2025-03-03 15:23:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:34,339 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2025-03-03 15:23:34,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:23:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2025-03-03 15:23:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 15:23:34,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:34,343 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:34,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:23:34,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:34,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1527820512, now seen corresponding path program 1 times [2025-03-03 15:23:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240724312] [2025-03-03 15:23:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:34,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 15:23:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 15:23:34,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:34,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-03 15:23:34,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240724312] [2025-03-03 15:23:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240724312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077171847] [2025-03-03 15:23:34,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:34,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:34,648 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:23:34,650 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:23:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 15:23:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 15:23:35,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:35,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-03 15:23:35,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-03 15:23:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077171847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:35,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:23:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292686151] [2025-03-03 15:23:35,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:23:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:35,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:23:35,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:35,349 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-03 15:23:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:40,376 INFO L93 Difference]: Finished difference Result 338 states and 486 transitions. [2025-03-03 15:23:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 217 [2025-03-03 15:23:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:40,394 INFO L225 Difference]: With dead ends: 338 [2025-03-03 15:23:40,394 INFO L226 Difference]: Without dead ends: 178 [2025-03-03 15:23:40,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 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:23:40,396 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:40,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 15:23:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-03 15:23:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-03 15:23:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 118 states have internal predecessors, (151), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-03 15:23:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2025-03-03 15:23:40,413 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 217 [2025-03-03 15:23:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:40,413 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2025-03-03 15:23:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-03 15:23:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2025-03-03 15:23:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 15:23:40,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:40,416 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:40,424 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:23:40,616 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:23:40,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:40,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 208227200, now seen corresponding path program 2 times [2025-03-03 15:23:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218920275] [2025-03-03 15:23:40,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:40,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 227 statements into 2 equivalence classes. [2025-03-03 15:23:40,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 227 statements. [2025-03-03 15:23:40,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:40,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-03-03 15:23:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218920275] [2025-03-03 15:23:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218920275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:23:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343066136] [2025-03-03 15:23:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:40,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:23:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:40,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:23:40,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:23:40,898 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 15:23:42,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:46,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:47,026 INFO L93 Difference]: Finished difference Result 472 states and 679 transitions. [2025-03-03 15:23:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:23:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-03-03 15:23:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:47,030 INFO L225 Difference]: With dead ends: 472 [2025-03-03 15:23:47,030 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 15:23:47,031 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:23:47,031 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:47,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-03-03 15:23:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 15:23:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2025-03-03 15:23:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 208 states have (on average 1.2740384615384615) internal successors, (265), 208 states have internal predecessors, (265), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-03-03 15:23:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2025-03-03 15:23:47,056 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 227 [2025-03-03 15:23:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:47,056 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2025-03-03 15:23:47,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 15:23:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2025-03-03 15:23:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 15:23:47,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:47,061 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:47,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:23:47,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:47,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1941747774, now seen corresponding path program 1 times [2025-03-03 15:23:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:47,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501473759] [2025-03-03 15:23:47,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:47,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:47,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 15:23:47,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 15:23:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:47,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-03-03 15:23:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501473759] [2025-03-03 15:23:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501473759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:23:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032533967] [2025-03-03 15:23:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:23:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:47,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:23:47,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:23:47,678 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 15:23:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:48,697 INFO L93 Difference]: Finished difference Result 594 states and 849 transitions. [2025-03-03 15:23:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:23:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-03-03 15:23:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:48,700 INFO L225 Difference]: With dead ends: 594 [2025-03-03 15:23:48,702 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 15:23:48,703 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:23:48,704 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 138 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:48,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:23:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 15:23:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2025-03-03 15:23:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 189 states have (on average 1.2328042328042328) internal successors, (233), 189 states have internal predecessors, (233), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (94), 86 states have call predecessors, (94), 86 states have call successors, (94) [2025-03-03 15:23:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 413 transitions. [2025-03-03 15:23:48,731 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 413 transitions. Word has length 227 [2025-03-03 15:23:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 413 transitions. [2025-03-03 15:23:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 15:23:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 413 transitions. [2025-03-03 15:23:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 15:23:48,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:48,734 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:23:48,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1680140100, now seen corresponding path program 1 times [2025-03-03 15:23:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621562420] [2025-03-03 15:23:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:48,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 15:23:48,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 15:23:48,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:48,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 15:23:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621562420] [2025-03-03 15:23:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621562420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642479096] [2025-03-03 15:23:49,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:49,310 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:23:49,312 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:23:49,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 15:23:49,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 15:23:49,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:49,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:49,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:23:49,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-03-03 15:23:49,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 15:23:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642479096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:50,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:23:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424509025] [2025-03-03 15:23:50,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:23:50,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:50,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:23:50,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:23:50,348 INFO L87 Difference]: Start difference. First operand 294 states and 413 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-03-03 15:23:54,361 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:23:58,376 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:23:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:58,935 INFO L93 Difference]: Finished difference Result 586 states and 836 transitions. [2025-03-03 15:23:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:23:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 227 [2025-03-03 15:23:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:58,938 INFO L225 Difference]: With dead ends: 586 [2025-03-03 15:23:58,939 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 15:23:58,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 453 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:23:58,941 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 167 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 122 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:58,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 469 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 360 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-03 15:23:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 15:23:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-03-03 15:23:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 209 states have internal predecessors, (260), 77 states have call successors, (77), 26 states have call predecessors, (77), 28 states have return successors, (97), 77 states have call predecessors, (97), 77 states have call successors, (97) [2025-03-03 15:23:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 434 transitions. [2025-03-03 15:23:58,961 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 434 transitions. Word has length 227 [2025-03-03 15:23:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:58,962 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 434 transitions. [2025-03-03 15:23:58,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-03-03 15:23:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2025-03-03 15:23:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 15:23:58,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:58,966 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:58,976 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:23:59,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:59,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:59,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1140018300, now seen corresponding path program 1 times [2025-03-03 15:23:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027605474] [2025-03-03 15:23:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:59,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 15:23:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 15:23:59,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:59,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 15:24:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027605474] [2025-03-03 15:24:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027605474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865303470] [2025-03-03 15:24:01,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:01,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:01,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:01,721 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:24:01,722 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:24:02,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 15:24:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 15:24:02,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:02,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 15:24:02,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:02,390 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 10 treesize of output 8 [2025-03-03 15:24:02,453 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 11 treesize of output 7 [2025-03-03 15:24:02,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-03 15:24:02,643 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 17 treesize of output 9 [2025-03-03 15:24:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-03-03 15:24:02,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:02,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:24:02,966 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-03 15:24:02,969 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 15:24:02,970 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 20 treesize of output 12 [2025-03-03 15:24:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865303470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:03,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:24:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2025-03-03 15:24:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291820664] [2025-03-03 15:24:03,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 15:24:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:03,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 15:24:03,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=934, Unknown=4, NotChecked=0, Total=1056 [2025-03-03 15:24:03,301 INFO L87 Difference]: Start difference. First operand 313 states and 434 transitions. Second operand has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 24 states have internal predecessors, (84), 12 states have call successors, (59), 6 states have call predecessors, (59), 10 states have return successors, (60), 9 states have call predecessors, (60), 12 states have call successors, (60) [2025-03-03 15:24:07,328 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:11,340 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:15,352 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:19,363 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:23,376 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:27,385 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:31,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:35,412 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:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:37,658 INFO L93 Difference]: Finished difference Result 491 states and 700 transitions. [2025-03-03 15:24:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 15:24:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 24 states have internal predecessors, (84), 12 states have call successors, (59), 6 states have call predecessors, (59), 10 states have return successors, (60), 9 states have call predecessors, (60), 12 states have call successors, (60) Word has length 227 [2025-03-03 15:24:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:37,661 INFO L225 Difference]: With dead ends: 491 [2025-03-03 15:24:37,661 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 15:24:37,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=2197, Unknown=4, NotChecked=0, Total=2550 [2025-03-03 15:24:37,662 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 210 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 203 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:37,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1318 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2116 Invalid, 8 Unknown, 0 Unchecked, 33.9s Time] [2025-03-03 15:24:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 15:24:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 329. [2025-03-03 15:24:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 221 states have internal predecessors, (271), 80 states have call successors, (80), 26 states have call predecessors, (80), 32 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2025-03-03 15:24:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 467 transitions. [2025-03-03 15:24:37,698 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 467 transitions. Word has length 227 [2025-03-03 15:24:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:37,699 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 467 transitions. [2025-03-03 15:24:37,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 24 states have internal predecessors, (84), 12 states have call successors, (59), 6 states have call predecessors, (59), 10 states have return successors, (60), 9 states have call predecessors, (60), 12 states have call successors, (60) [2025-03-03 15:24:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 467 transitions. [2025-03-03 15:24:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:24:37,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:37,702 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:24:37,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:37,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:37,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1740076204, now seen corresponding path program 1 times [2025-03-03 15:24:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129080956] [2025-03-03 15:24:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:38,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:24:38,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:24:38,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:38,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 15:24:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129080956] [2025-03-03 15:24:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129080956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479498653] [2025-03-03 15:24:39,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:39,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:39,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:39,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:24:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:24:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:24:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:40,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 15:24:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:40,148 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:24:45,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:24:45,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:24:45,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-03 15:24:47,862 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-03 15:24:47,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104