./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 16:52:08,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 16:52:08,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 16:52:08,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 16:52:08,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 16:52:08,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 16:52:08,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 16:52:08,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 16:52:08,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 16:52:08,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 16:52:08,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 16:52:08,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 16:52:08,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 16:52:08,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 16:52:08,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 16:52:08,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 16:52:08,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 16:52:08,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 16:52:08,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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 -> GemCutter 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-03-19 16:52:08,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 16:52:08,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 16:52:08,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 16:52:08,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 16:52:08,523 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 16:52:08,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-03-19 16:52:09,859 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ed824f521/919028fe480449209ffd7c27ad5bc8c2/FLAG23e646450 [2025-03-19 16:52:10,100 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 16:52:10,102 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-03-19 16:52:10,117 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ed824f521/919028fe480449209ffd7c27ad5bc8c2/FLAG23e646450 [2025-03-19 16:52:10,909 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ed824f521/919028fe480449209ffd7c27ad5bc8c2 [2025-03-19 16:52:10,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 16:52:10,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 16:52:10,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 16:52:10,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 16:52:10,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 16:52:10,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 04:52:10" (1/1) ... [2025-03-19 16:52:10,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b18c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:10, skipping insertion in model container [2025-03-19 16:52:10,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 04:52:10" (1/1) ... [2025-03-19 16:52:10,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 16:52:11,244 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/pthread/stack-2.i[41520,41533] [2025-03-19 16:52:11,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 16:52:11,277 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 16:52:11,318 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/pthread/stack-2.i[41520,41533] [2025-03-19 16:52:11,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 16:52:11,385 INFO L204 MainTranslator]: Completed translation [2025-03-19 16:52:11,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11 WrapperNode [2025-03-19 16:52:11,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 16:52:11,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 16:52:11,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 16:52:11,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 16:52:11,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,417 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 151 [2025-03-19 16:52:11,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 16:52:11,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 16:52:11,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 16:52:11,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 16:52:11,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 16:52:11,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 16:52:11,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 16:52:11,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 16:52:11,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (1/1) ... [2025-03-19 16:52:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 16:52:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:11,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 16:52:11,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 16:52:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-19 16:52:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-19 16:52:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-19 16:52:11,496 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 16:52:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 16:52:11,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 16:52:11,497 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 16:52:11,607 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 16:52:11,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 16:52:11,816 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 16:52:11,816 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 16:52:11,971 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 16:52:11,971 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 16:52:11,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 04:52:11 BoogieIcfgContainer [2025-03-19 16:52:11,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 16:52:11,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 16:52:11,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 16:52:11,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 16:52:11,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 04:52:10" (1/3) ... [2025-03-19 16:52:11,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae76bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 04:52:11, skipping insertion in model container [2025-03-19 16:52:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 04:52:11" (2/3) ... [2025-03-19 16:52:11,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae76bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 04:52:11, skipping insertion in model container [2025-03-19 16:52:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 04:52:11" (3/3) ... [2025-03-19 16:52:11,979 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-03-19 16:52:11,989 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 16:52:11,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 31 locations, 33 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-19 16:52:11,991 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 16:52:12,038 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-19 16:52:12,071 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 16:52:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:12,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-19 16:52:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-19 16:52:12,139 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 16:52:12,145 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2025-03-19 16:52:12,151 INFO L340 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=PARTIAL_ORDER_FA, 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;@10f023e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:12,151 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 16:52:12,171 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:12,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash -331027456, now seen corresponding path program 1 times [2025-03-19 16:52:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145208638] [2025-03-19 16:52:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:12,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-19 16:52:12,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-19 16:52:12,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:12,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145208638] [2025-03-19 16:52:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145208638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:12,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439778546] [2025-03-19 16:52:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:12,498 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 16:52:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 16:52:12,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-19 16:52:12,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,511 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:12,512 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:12,512 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:12,586 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 16:52:12,586 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:12,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 288155419, now seen corresponding path program 1 times [2025-03-19 16:52:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311622450] [2025-03-19 16:52:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:12,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-19 16:52:12,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-19 16:52:12,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:12,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:12,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311622450] [2025-03-19 16:52:12,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311622450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:12,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:12,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545421496] [2025-03-19 16:52:12,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:12,729 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 16:52:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:12,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 16:52:12,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 16:52:12,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,732 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:12,732 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:12,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:12,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:12,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:12,787 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 16:52:12,788 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:12,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1347868710, now seen corresponding path program 1 times [2025-03-19 16:52:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956052533] [2025-03-19 16:52:12,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-19 16:52:12,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-19 16:52:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956052533] [2025-03-19 16:52:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956052533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111817646] [2025-03-19 16:52:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:12,937 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 16:52:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 16:52:12,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 16:52:12,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,938 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:12,939 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:12,939 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:12,939 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:12,939 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:12,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:12,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:12,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:12,994 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 16:52:12,994 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:12,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -42126734, now seen corresponding path program 1 times [2025-03-19 16:52:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764371011] [2025-03-19 16:52:12,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-19 16:52:13,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-19 16:52:13,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764371011] [2025-03-19 16:52:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764371011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:13,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033505626] [2025-03-19 16:52:13,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:13,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-19 16:52:13,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-19 16:52:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-19 16:52:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:13,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:13,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-19 16:52:13,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:13,369 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:13,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033505626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:13,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-19 16:52:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743277780] [2025-03-19 16:52:13,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:13,605 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-19 16:52:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:13,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-19 16:52:13,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-19 16:52:13,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:13,605 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:13,606 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:13,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:13,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:13,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:13,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:13,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:13,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:13,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:13,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:13,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-19 16:52:13,998 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:13,998 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:13,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash -882351985, now seen corresponding path program 2 times [2025-03-19 16:52:13,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175866267] [2025-03-19 16:52:13,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 16:52:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:14,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-19 16:52:14,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-19 16:52:14,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 16:52:14,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-19 16:52:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175866267] [2025-03-19 16:52:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175866267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:14,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 16:52:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078770853] [2025-03-19 16:52:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:14,360 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-19 16:52:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:14,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-19 16:52:14,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-19 16:52:14,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:14,361 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:14,361 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:14,361 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:14,361 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:14,361 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:14,361 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:14,361 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:14,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:14,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:14,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:14,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:14,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:14,436 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-19 16:52:14,436 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:14,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1429716446, now seen corresponding path program 1 times [2025-03-19 16:52:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981127678] [2025-03-19 16:52:14,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:14,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-19 16:52:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-19 16:52:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:14,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981127678] [2025-03-19 16:52:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981127678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62339254] [2025-03-19 16:52:14,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:14,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:14,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-19 16:52:14,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-19 16:52:14,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-19 16:52:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:14,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-19 16:52:14,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:14,946 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:15,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-19 16:52:15,085 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:15,117 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:15,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:15,722 INFO L354 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 9 treesize of output 1 [2025-03-19 16:52:15,727 INFO L354 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 14 treesize of output 5 [2025-03-19 16:52:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62339254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:15,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-03-19 16:52:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225764895] [2025-03-19 16:52:15,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:15,781 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-19 16:52:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:15,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-19 16:52:15,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-03-19 16:52:15,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:15,782 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:15,782 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 19 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:15,782 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-19 16:52:15,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-19 16:52:16,178 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:16,178 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:16,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1267203198, now seen corresponding path program 2 times [2025-03-19 16:52:16,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767373197] [2025-03-19 16:52:16,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 16:52:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:16,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-19 16:52:16,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-19 16:52:16,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 16:52:16,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767373197] [2025-03-19 16:52:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767373197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-19 16:52:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342513026] [2025-03-19 16:52:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:16,381 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-19 16:52:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:16,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-19 16:52:16,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-19 16:52:16,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:16,382 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:16,382 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-19 16:52:16,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-19 16:52:16,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:16,783 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-19 16:52:16,783 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:16,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1460779837, now seen corresponding path program 3 times [2025-03-19 16:52:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361947049] [2025-03-19 16:52:16,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 16:52:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:16,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 4 equivalence classes. [2025-03-19 16:52:16,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 67 of 67 statements. [2025-03-19 16:52:16,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-19 16:52:16,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361947049] [2025-03-19 16:52:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361947049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704069571] [2025-03-19 16:52:17,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 16:52:17,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:17,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:17,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-19 16:52:17,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 4 equivalence classes. [2025-03-19 16:52:17,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 67 of 67 statements. [2025-03-19 16:52:17,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-19 16:52:17,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:17,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-19 16:52:17,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:17,639 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:17,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-19 16:52:17,760 INFO L354 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 8 treesize of output 6 [2025-03-19 16:52:17,790 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:17,816 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-19 16:52:17,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-19 16:52:18,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704069571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:18,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 29 [2025-03-19 16:52:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040634224] [2025-03-19 16:52:18,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:18,088 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-19 16:52:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:18,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-19 16:52:18,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2025-03-19 16:52:18,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:18,090 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:18,090 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:18,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:18,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-19 16:52:18,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:18,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-19 16:52:18,878 INFO L791 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-19 16:52:18,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-19 16:52:19,083 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:19,087 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-19 16:52:19,088 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2025-03-19 16:52:19,090 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:19,090 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 16:52:19,090 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 16:52:19,090 INFO L340 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=PARTIAL_ORDER_FA, 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;@10f023e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:19,090 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 16:52:19,094 INFO L791 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 16:52:19,095 INFO L791 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 16:52:19,096 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-03-19 16:52:19,096 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-03-19 16:52:19,097 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:19,097 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 16:52:19,097 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2025-03-19 16:52:19,097 INFO L340 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=PARTIAL_ORDER_FA, 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;@10f023e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 16:52:19,098 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 16:52:19,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1572405177, now seen corresponding path program 1 times [2025-03-19 16:52:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544524130] [2025-03-19 16:52:19,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-19 16:52:19,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-19 16:52:19,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:19,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544524130] [2025-03-19 16:52:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544524130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:19,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:19,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422936187] [2025-03-19 16:52:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:19,157 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 16:52:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:19,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 16:52:19,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-19 16:52:19,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,158 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:19,158 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:19,158 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,189 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-19 16:52:19,189 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1907426526, now seen corresponding path program 1 times [2025-03-19 16:52:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967532181] [2025-03-19 16:52:19,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-19 16:52:19,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-19 16:52:19,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:19,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967532181] [2025-03-19 16:52:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967532181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502887413] [2025-03-19 16:52:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:19,218 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 16:52:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 16:52:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 16:52:19,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,219 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:19,219 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:19,219 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,219 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,249 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-19 16:52:19,249 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 439102545, now seen corresponding path program 2 times [2025-03-19 16:52:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400949164] [2025-03-19 16:52:19,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 16:52:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-19 16:52:19,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 44 statements. [2025-03-19 16:52:19,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 16:52:19,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-19 16:52:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400949164] [2025-03-19 16:52:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400949164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130286573] [2025-03-19 16:52:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:19,289 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 16:52:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:19,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 16:52:19,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 16:52:19,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,289 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:19,289 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:19,289 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,289 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,289 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,317 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-19 16:52:19,317 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1475640946, now seen corresponding path program 1 times [2025-03-19 16:52:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673497116] [2025-03-19 16:52:19,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-19 16:52:19,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-19 16:52:19,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:19,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-19 16:52:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673497116] [2025-03-19 16:52:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673497116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 16:52:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378587118] [2025-03-19 16:52:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:19,365 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 16:52:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 16:52:19,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 16:52:19,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,366 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:19,366 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:19,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,387 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-19 16:52:19,387 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash 953377737, now seen corresponding path program 1 times [2025-03-19 16:52:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042803155] [2025-03-19 16:52:19,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-19 16:52:19,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-19 16:52:19,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:19,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042803155] [2025-03-19 16:52:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042803155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 16:52:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 16:52:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330847627] [2025-03-19 16:52:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:19,661 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-19 16:52:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:19,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-19 16:52:19,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-19 16:52:19,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,662 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:19,662 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:19,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:19,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:19,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:19,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:19,715 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-19 16:52:19,716 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:19,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1323243579, now seen corresponding path program 1 times [2025-03-19 16:52:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496109675] [2025-03-19 16:52:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:19,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-19 16:52:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-19 16:52:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:20,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496109675] [2025-03-19 16:52:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496109675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:20,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86185294] [2025-03-19 16:52:20,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:20,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:20,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:20,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:20,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-19 16:52:20,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-19 16:52:20,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-19 16:52:20,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:20,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:20,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-19 16:52:20,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:20,447 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:20,511 INFO L354 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 15 treesize of output 1 [2025-03-19 16:52:20,557 INFO L354 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 56 treesize of output 32 [2025-03-19 16:52:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:20,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86185294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:20,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-19 16:52:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497699025] [2025-03-19 16:52:20,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:20,907 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-19 16:52:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-19 16:52:20,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-19 16:52:20,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:20,908 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:20,908 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:20,908 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:21,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-19 16:52:21,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-19 16:52:21,343 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-19 16:52:21,343 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:21,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1489445805, now seen corresponding path program 2 times [2025-03-19 16:52:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:21,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597415122] [2025-03-19 16:52:21,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 16:52:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:21,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-19 16:52:21,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-19 16:52:21,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 16:52:21,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-19 16:52:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597415122] [2025-03-19 16:52:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597415122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120090365] [2025-03-19 16:52:22,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 16:52:22,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:22,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-19 16:52:22,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-19 16:52:22,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-19 16:52:22,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 16:52:22,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:22,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-19 16:52:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:22,154 INFO L354 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 8 treesize of output 1 [2025-03-19 16:52:22,213 INFO L354 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 15 treesize of output 1 [2025-03-19 16:52:22,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-19 16:52:22,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-03-19 16:52:22,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-19 16:52:22,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-19 16:52:22,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 57 [2025-03-19 16:52:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:22,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:23,501 INFO L354 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 9 treesize of output 1 [2025-03-19 16:52:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120090365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:23,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-19 16:52:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714275618] [2025-03-19 16:52:23,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:23,551 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-19 16:52:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:23,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-19 16:52:23,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-19 16:52:23,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:23,552 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:23,552 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-19 16:52:23,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:24,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:24,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-19 16:52:24,464 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-19 16:52:24,464 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:24,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash -136425452, now seen corresponding path program 3 times [2025-03-19 16:52:24,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:24,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885140411] [2025-03-19 16:52:24,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 16:52:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:24,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 5 equivalence classes. [2025-03-19 16:52:24,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 111 statements. [2025-03-19 16:52:24,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-19 16:52:24,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-19 16:52:24,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885140411] [2025-03-19 16:52:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885140411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930280088] [2025-03-19 16:52:24,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 16:52:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:24,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:24,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-19 16:52:24,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 5 equivalence classes. [2025-03-19 16:52:24,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 111 statements. [2025-03-19 16:52:24,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-19 16:52:24,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:24,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-19 16:52:24,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:25,044 INFO L354 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 17 treesize of output 13 [2025-03-19 16:52:25,179 INFO L354 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 80 treesize of output 32 [2025-03-19 16:52:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-19 16:52:25,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 16:52:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-19 16:52:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930280088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 16:52:25,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 16:52:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-03-19 16:52:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927611666] [2025-03-19 16:52:25,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 16:52:25,323 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-19 16:52:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:25,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-19 16:52:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-19 16:52:25,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:25,324 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:25,324 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:25,324 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:25,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:25,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:25,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-19 16:52:25,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-19 16:52:25,663 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-19 16:52:25,663 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:25,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 902552129, now seen corresponding path program 4 times [2025-03-19 16:52:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217784419] [2025-03-19 16:52:25,664 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-19 16:52:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:25,688 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 131 statements into 2 equivalence classes. [2025-03-19 16:52:25,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 112 of 131 statements. [2025-03-19 16:52:25,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-19 16:52:25,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 264 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217784419] [2025-03-19 16:52:25,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217784419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062205341] [2025-03-19 16:52:25,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-19 16:52:25,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:25,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:25,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-19 16:52:26,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 131 statements into 2 equivalence classes. [2025-03-19 16:52:26,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 112 of 131 statements. [2025-03-19 16:52:26,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-19 16:52:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:26,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-19 16:52:26,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-19 16:52:26,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 16:52:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062205341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-19 16:52:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21] total 26 [2025-03-19 16:52:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142640009] [2025-03-19 16:52:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:26,257 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-19 16:52:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:26,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-19 16:52:26,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2025-03-19 16:52:26,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:26,258 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:26,259 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-19 16:52:26,259 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:26,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-19 16:52:26,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:26,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-19 16:52:26,612 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:26,613 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:26,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1985416789, now seen corresponding path program 1 times [2025-03-19 16:52:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559633822] [2025-03-19 16:52:26,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-19 16:52:26,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-19 16:52:26,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:26,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 88 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 16:52:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559633822] [2025-03-19 16:52:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559633822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 16:52:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792154624] [2025-03-19 16:52:26,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 16:52:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 16:52:26,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 16:52:26,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 16:52:26,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-19 16:52:26,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-19 16:52:26,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-19 16:52:26,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:26,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 16:52:26,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-19 16:52:26,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 16:52:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 16:52:26,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 16:52:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792154624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 16:52:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-19 16:52:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2025-03-19 16:52:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88522109] [2025-03-19 16:52:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 16:52:26,957 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-19 16:52:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 16:52:26,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-19 16:52:26,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-19 16:52:26,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:26,957 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 16:52:26,957 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 16:52:26,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:26,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:26,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 16:52:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-19 16:52:27,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-19 16:52:27,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:27,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 16:52:27,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-19 16:52:27,274 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-19 16:52:27,274 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 16:52:27,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 16:52:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1478677684, now seen corresponding path program 5 times [2025-03-19 16:52:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 16:52:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336303904] [2025-03-19 16:52:27,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-19 16:52:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 16:52:27,289 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 5 equivalence classes. [2025-03-19 16:52:27,349 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 70 of 70 statements. [2025-03-19 16:52:27,349 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-19 16:52:27,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 16:52:27,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 16:52:27,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-19 16:52:27,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-19 16:52:27,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 16:52:27,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 16:52:27,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 16:52:27,474 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 16:52:27,475 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-19 16:52:27,475 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-19 16:52:27,476 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2025-03-19 16:52:27,477 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was UNSAFE (3/3) [2025-03-19 16:52:27,558 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-19 16:52:27,558 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 16:52:27,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-03-19 16:52:27,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 04:52:27 BasicIcfg [2025-03-19 16:52:27,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 16:52:27,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 16:52:27,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 16:52:27,568 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 16:52:27,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 04:52:11" (3/4) ... [2025-03-19 16:52:27,569 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-19 16:52:27,650 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 107. [2025-03-19 16:52:27,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-03-19 16:52:27,720 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-03-19 16:52:27,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 16:52:27,721 INFO L158 Benchmark]: Toolchain (without parser) took 16808.70ms. Allocated memory was 83.9MB in the beginning and 427.8MB in the end (delta: 343.9MB). Free memory was 57.8MB in the beginning and 298.8MB in the end (delta: -240.9MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2025-03-19 16:52:27,721 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 16:52:27,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.35ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 25.5MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-19 16:52:27,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.14ms. Allocated memory is still 83.9MB. Free memory was 25.5MB in the beginning and 22.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 16:52:27,725 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 83.9MB. Free memory was 22.9MB in the beginning and 21.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 16:52:27,725 INFO L158 Benchmark]: RCFGBuilder took 535.99ms. Allocated memory is still 83.9MB. Free memory was 21.7MB in the beginning and 49.3MB in the end (delta: -27.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-03-19 16:52:27,725 INFO L158 Benchmark]: TraceAbstraction took 15594.67ms. Allocated memory was 83.9MB in the beginning and 427.8MB in the end (delta: 343.9MB). Free memory was 48.8MB in the beginning and 327.5MB in the end (delta: -278.8MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. [2025-03-19 16:52:27,725 INFO L158 Benchmark]: Witness Printer took 152.05ms. Allocated memory is still 427.8MB. Free memory was 327.5MB in the beginning and 298.8MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-19 16:52:27,726 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.35ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 25.5MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.14ms. Allocated memory is still 83.9MB. Free memory was 25.5MB in the beginning and 22.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 83.9MB. Free memory was 22.9MB in the beginning and 21.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 535.99ms. Allocated memory is still 83.9MB. Free memory was 21.7MB in the beginning and 49.3MB in the end (delta: -27.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15594.67ms. Allocated memory was 83.9MB in the beginning and 427.8MB in the end (delta: 343.9MB). Free memory was 48.8MB in the beginning and 327.5MB in the end (delta: -278.8MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. * Witness Printer took 152.05ms. Allocated memory is still 427.8MB. Free memory was 327.5MB in the beginning and 298.8MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14588, independent: 12091, independent conditional: 12091, independent unconditional: 0, dependent: 2497, dependent conditional: 2497, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12182, independent: 12091, independent conditional: 0, independent unconditional: 12091, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 166, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 166, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 12182, independent: 11927, independent conditional: 0, independent unconditional: 11927, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 166, unknown conditional: 0, unknown unconditional: 166] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2406 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 27, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 8 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1773, independent: 1311, independent conditional: 1311, independent unconditional: 0, dependent: 462, dependent conditional: 462, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1321, independent: 1311, independent conditional: 0, independent unconditional: 1311, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1321, independent: 1268, independent conditional: 0, independent unconditional: 1268, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 452 - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=2, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=2, top=1] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=2, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=2, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=2, top=1] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=2, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=2, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=2, top=1] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=2, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=1, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, tmp=1, top=1] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, tmp=1, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 587 ConstructedInterpolants, 23 QuantifiedInterpolants, 3150 SizeOfPredicates, 45 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 165/321 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 823 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1146 ConstructedInterpolants, 16 QuantifiedInterpolants, 8554 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1483 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 1370/1509 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-19 16:52:27,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE