./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2520d7ca Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.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 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-2520d7c-m [2024-07-16 17:53:09,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-16 17:53:09,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-16 17:53:09,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-16 17:53:09,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-16 17:53:09,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-16 17:53:09,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-16 17:53:09,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-16 17:53:09,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-16 17:53:09,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-16 17:53:09,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-16 17:53:09,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-16 17:53:09,771 INFO L153 SettingsManager]: * Use SBE=true [2024-07-16 17:53:09,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-16 17:53:09,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-16 17:53:09,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-16 17:53:09,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-16 17:53:09,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-16 17:53:09,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-16 17:53:09,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-16 17:53:09,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-16 17:53:09,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-16 17:53:09,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-16 17:53:09,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-16 17:53:09,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-16 17:53:09,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-16 17:53:09,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-16 17:53:09,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-16 17:53:09,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-16 17:53:09,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-16 17:53:09,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-16 17:53:09,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-16 17:53:09,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-16 17:53:09,783 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-16 17:53:09,783 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-16 17:53:09,783 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-16 17:53:09,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2024-07-16 17:53:09,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-16 17:53:10,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-16 17:53:10,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-16 17:53:10,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-16 17:53:10,006 INFO L274 PluginConnector]: CDTParser initialized [2024-07-16 17:53:10,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-07-16 17:53:10,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-16 17:53:11,142 INFO L384 CDTParser]: Found 1 translation units. [2024-07-16 17:53:11,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-07-16 17:53:11,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/80638d7a1/f3944a1f3a204346876807f2698013e8/FLAG2d4ea6d7e [2024-07-16 17:53:11,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/80638d7a1/f3944a1f3a204346876807f2698013e8 [2024-07-16 17:53:11,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-16 17:53:11,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-07-16 17:53:11,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-16 17:53:11,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-16 17:53:11,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-16 17:53:11,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381beb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11, skipping insertion in model container [2024-07-16 17:53:11,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,214 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-16 17:53:11,452 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2024-07-16 17:53:11,459 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-16 17:53:11,467 INFO L202 MainTranslator]: Completed pre-run [2024-07-16 17:53:11,520 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2024-07-16 17:53:11,524 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-16 17:53:11,556 INFO L206 MainTranslator]: Completed translation [2024-07-16 17:53:11,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11 WrapperNode [2024-07-16 17:53:11,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-16 17:53:11,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-16 17:53:11,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-16 17:53:11,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-16 17:53:11,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,586 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2024-07-16 17:53:11,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-16 17:53:11,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-16 17:53:11,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-16 17:53:11,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-16 17:53:11,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-16 17:53:11,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-16 17:53:11,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-16 17:53:11,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-16 17:53:11,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (1/1) ... [2024-07-16 17:53:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-16 17:53:11,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:11,647 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) [2024-07-16 17:53:11,659 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 [2024-07-16 17:53:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-07-16 17:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-07-16 17:53:11,692 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-07-16 17:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-07-16 17:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-07-16 17:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-16 17:53:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-07-16 17:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-07-16 17:53:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-16 17:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-07-16 17:53:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-16 17:53:11,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-16 17:53:11,695 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-16 17:53:11,851 INFO L244 CfgBuilder]: Building ICFG [2024-07-16 17:53:11,853 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-16 17:53:12,003 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-16 17:53:12,003 INFO L293 CfgBuilder]: Performing block encoding [2024-07-16 17:53:12,098 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-16 17:53:12,098 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-07-16 17:53:12,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.07 05:53:12 BoogieIcfgContainer [2024-07-16 17:53:12,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-16 17:53:12,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-16 17:53:12,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-16 17:53:12,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-16 17:53:12,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.07 05:53:11" (1/3) ... [2024-07-16 17:53:12,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d43e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.07 05:53:12, skipping insertion in model container [2024-07-16 17:53:12,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.07 05:53:11" (2/3) ... [2024-07-16 17:53:12,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d43e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.07 05:53:12, skipping insertion in model container [2024-07-16 17:53:12,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.07 05:53:12" (3/3) ... [2024-07-16 17:53:12,105 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2024-07-16 17:53:12,111 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-07-16 17:53:12,119 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-16 17:53:12,119 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-07-16 17:53:12,119 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-16 17:53:12,154 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-16 17:53:12,184 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-16 17:53:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:12,197 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) [2024-07-16 17:53:12,201 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 [2024-07-16 17:53:12,222 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-16 17:53:12,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-07-16 17:53:12,242 INFO L357 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, mHoare=true, 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;@3d35297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:12,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-16 17:53:12,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:12,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1639139020, now seen corresponding path program 1 times [2024-07-16 17:53:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567363526] [2024-07-16 17:53:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567363526] [2024-07-16 17:53:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567363526] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:12,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666398921] [2024-07-16 17:53:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:12,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:12,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:13,017 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) [2024-07-16 17:53:13,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-07-16 17:53:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:13,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2024-07-16 17:53:13,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:13,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-16 17:53:13,348 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-07-16 17:53:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2024-07-16 17:53:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:13,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:13,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:13,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-07-16 17:53:13,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:13,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-07-16 17:53:13,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-07-16 17:53:13,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-07-16 17:53:13,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-07-16 17:53:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666398921] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-16 17:53:13,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-16 17:53:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2024-07-16 17:53:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648403388] [2024-07-16 17:53:13,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-16 17:53:13,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-07-16 17:53:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-07-16 17:53:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=286, Unknown=2, NotChecked=0, Total=342 [2024-07-16 17:53:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:13,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) [2024-07-16 17:53:13,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-07-16 17:53:14,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-07-16 17:53:14,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-07-16 17:53:14,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-07-16 17:53:14,809 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-07-16 17:53:14,810 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-07-16 17:53:14,813 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-16 17:53:14,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:14,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-16 17:53:14,817 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-16 17:53:14,817 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-16 17:53:14,818 INFO L357 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, mHoare=true, 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;@3d35297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:14,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-16 17:53:14,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-07-16 17:53:14,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-16 17:53:14,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1663913868, now seen corresponding path program 1 times [2024-07-16 17:53:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955844181] [2024-07-16 17:53:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-16 17:53:14,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-16 17:53:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-16 17:53:14,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-16 17:53:14,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-16 17:53:14,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-16 17:53:14,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-07-16 17:53:14,927 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-07-16 17:53:14,927 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-07-16 17:53:14,928 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-16 17:53:14,928 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-07-16 17:53:14,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-16 17:53:14,946 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-16 17:53:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:14,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-16 17:53:14,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-07-16 17:53:14,964 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-16 17:53:14,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-16 17:53:14,965 INFO L357 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, mHoare=true, 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;@3d35297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:14,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-16 17:53:15,157 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-16 17:53:15,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1725608356, now seen corresponding path program 1 times [2024-07-16 17:53:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492650276] [2024-07-16 17:53:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492650276] [2024-07-16 17:53:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492650276] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540369179] [2024-07-16 17:53:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:15,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:15,457 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) [2024-07-16 17:53:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-07-16 17:53:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:15,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2024-07-16 17:53:15,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:15,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-16 17:53:15,707 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-07-16 17:53:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2024-07-16 17:53:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:15,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:15,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:15,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-07-16 17:53:15,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:15,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-07-16 17:53:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-07-16 17:53:15,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-07-16 17:53:15,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-07-16 17:53:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540369179] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-16 17:53:15,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-16 17:53:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2024-07-16 17:53:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537418467] [2024-07-16 17:53:15,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-16 17:53:15,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-07-16 17:53:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-07-16 17:53:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2024-07-16 17:53:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:15,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:15,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 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) [2024-07-16 17:53:15,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-16 17:53:16,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-07-16 17:53:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:16,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-16 17:53:16,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1754237507, now seen corresponding path program 1 times [2024-07-16 17:53:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388972045] [2024-07-16 17:53:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-16 17:53:16,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-16 17:53:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-16 17:53:16,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-16 17:53:16,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-16 17:53:16,484 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-16 17:53:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-07-16 17:53:16,486 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-07-16 17:53:16,486 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-07-16 17:53:16,486 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-16 17:53:16,486 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-07-16 17:53:16,502 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-16 17:53:16,503 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-16 17:53:16,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:16,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-16 17:53:16,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-07-16 17:53:16,508 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-16 17:53:16,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-07-16 17:53:16,508 INFO L357 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, mHoare=true, 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;@3d35297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-16 17:53:16,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-16 17:53:16,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:16,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1972753619, now seen corresponding path program 1 times [2024-07-16 17:53:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613251739] [2024-07-16 17:53:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-16 17:53:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613251739] [2024-07-16 17:53:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613251739] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758182489] [2024-07-16 17:53:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:17,125 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) [2024-07-16 17:53:17,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-07-16 17:53:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:17,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2024-07-16 17:53:17,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:17,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-16 17:53:17,495 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-07-16 17:53:17,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2024-07-16 17:53:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:17,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-16 17:53:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758182489] provided 1 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-07-16 17:53:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 19 [2024-07-16 17:53:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872736208] [2024-07-16 17:53:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-16 17:53:17,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-16 17:53:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-16 17:53:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=308, Unknown=2, NotChecked=0, Total=380 [2024-07-16 17:53:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:17,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:17,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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) [2024-07-16 17:53:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:17,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-07-16 17:53:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:18,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:18,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -406894790, now seen corresponding path program 1 times [2024-07-16 17:53:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240535623] [2024-07-16 17:53:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-16 17:53:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240535623] [2024-07-16 17:53:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240535623] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531868226] [2024-07-16 17:53:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:18,222 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) [2024-07-16 17:53:18,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-07-16 17:53:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:18,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2024-07-16 17:53:18,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:18,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-07-16 17:53:18,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 17 [2024-07-16 17:53:18,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-07-16 17:53:18,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-16 17:53:18,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-07-16 17:53:18,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-16 17:53:18,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-07-16 17:53:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-07-16 17:53:18,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-16 17:53:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531868226] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-16 17:53:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-16 17:53:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-07-16 17:53:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511650687] [2024-07-16 17:53:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-16 17:53:18,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-16 17:53:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:18,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-16 17:53:18,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-07-16 17:53:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:18,397 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:18,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-07-16 17:53:18,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:18,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-16 17:53:18,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-07-16 17:53:18,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:18,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:18,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1595998048, now seen corresponding path program 1 times [2024-07-16 17:53:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955980618] [2024-07-16 17:53:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:18,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-07-16 17:53:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955980618] [2024-07-16 17:53:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955980618] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197502094] [2024-07-16 17:53:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:19,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:19,052 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) [2024-07-16 17:53:19,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-07-16 17:53:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:19,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 19 conjunts are in the unsatisfiable core [2024-07-16 17:53:19,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:19,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-16 17:53:19,330 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-07-16 17:53:19,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2024-07-16 17:53:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-07-16 17:53:19,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:19,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:19,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-07-16 17:53:19,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:19,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-07-16 17:53:19,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-07-16 17:53:19,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-07-16 17:53:19,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-07-16 17:53:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-07-16 17:53:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197502094] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-16 17:53:19,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-16 17:53:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2024-07-16 17:53:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873126119] [2024-07-16 17:53:19,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-16 17:53:19,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-07-16 17:53:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-07-16 17:53:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2024-07-16 17:53:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:19,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:19,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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) [2024-07-16 17:53:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-16 17:53:19,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-16 17:53:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-16 17:53:20,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-07-16 17:53:20,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:20,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:20,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 823444160, now seen corresponding path program 1 times [2024-07-16 17:53:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985399376] [2024-07-16 17:53:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:21,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:21,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985399376] [2024-07-16 17:53:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985399376] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600862037] [2024-07-16 17:53:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:21,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:21,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-16 17:53:21,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-07-16 17:53:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:21,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 26 conjunts are in the unsatisfiable core [2024-07-16 17:53:21,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:21,960 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-07-16 17:53:21,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2024-07-16 17:53:22,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-16 17:53:22,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-16 17:53:22,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-07-16 17:53:22,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-07-16 17:53:22,266 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-07-16 17:53:22,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 29 [2024-07-16 17:53:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:22,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:22,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_5) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not .cse0))))) is different from false [2024-07-16 17:53:22,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (Array Int Int)) (|~#top~0.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-07-16 17:53:22,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:22,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-07-16 17:53:22,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:22,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-07-16 17:53:22,721 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-07-16 17:53:22,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1031 treesize of output 1002 [2024-07-16 17:53:22,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 341 [2024-07-16 17:53:22,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1256 treesize of output 1240 [2024-07-16 17:53:22,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 557 [2024-07-16 17:53:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-07-16 17:53:23,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-07-16 17:53:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-07-16 17:53:23,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-07-16 17:53:23,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:23,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 211 [2024-07-16 17:53:23,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:23,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-07-16 17:53:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-07-16 17:53:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600862037] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-16 17:53:23,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-16 17:53:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 40 [2024-07-16 17:53:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390285254] [2024-07-16 17:53:23,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-16 17:53:23,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-07-16 17:53:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-16 17:53:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-07-16 17:53:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=8, NotChecked=150, Total=1640 [2024-07-16 17:53:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:23,584 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-16 17:53:23,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 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) [2024-07-16 17:53:23,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:23,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-16 17:53:23,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-16 17:53:23,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-16 17:53:27,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (select .cse2 |c_~#top~0.offset|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse4)) (.cse3 (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (and (or .cse0 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_5) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| .cse3)))) (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not .cse0)) (not (= .cse4 0)) (forall ((|~#top~0.base| Int)) (not (= (select (select (let ((.cse5 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| .cse3)))) (store .cse5 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))))) is different from false [2024-07-16 17:53:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-16 17:53:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-16 17:53:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-16 17:53:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-07-16 17:53:27,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-07-16 17:53:27,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-07-16 17:53:27,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-16 17:53:27,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-16 17:53:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1663679035, now seen corresponding path program 1 times [2024-07-16 17:53:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-16 17:53:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226316113] [2024-07-16 17:53:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-16 17:53:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-16 17:53:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-16 17:53:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226316113] [2024-07-16 17:53:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226316113] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-16 17:53:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332775180] [2024-07-16 17:53:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-16 17:53:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-16 17:53:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-16 17:53:28,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-16 17:53:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-07-16 17:53:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-16 17:53:28,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 39 conjunts are in the unsatisfiable core [2024-07-16 17:53:28,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-16 17:53:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-07-16 17:53:28,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-07-16 17:53:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-16 17:53:28,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-16 17:53:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-07-16 17:53:28,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-07-16 17:53:28,892 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-07-16 17:53:28,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-07-16 17:53:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-07-16 17:53:29,086 INFO L349 Elim1Store]: treesize reduction 28, result has 52.5 percent of original size [2024-07-16 17:53:29,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2024-07-16 17:53:29,767 INFO L349 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2024-07-16 17:53:29,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 141 treesize of output 153 [2024-07-16 17:53:30,128 INFO L349 Elim1Store]: treesize reduction 124, result has 52.5 percent of original size [2024-07-16 17:53:30,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 177 treesize of output 225 [2024-07-16 17:53:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-07-16 17:53:38,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-16 17:53:43,180 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0) (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)))) is different from false [2024-07-16 17:53:43,331 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (let ((.cse5 (not .cse9))) (and (or (< 64 c_~next_alloc_idx~0) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (not (= (select (select (let ((.cse0 (let ((.cse1 (store (select .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse1) |c_~#top~0.base| (let ((.cse2 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse1))) (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse5) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10))) (or (= 0 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (let ((.cse7 (let ((.cse8 (store .cse6 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse7 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse7 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse9)) (= c_~next_alloc_idx~0 0)) (or (and (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (not (= (select (select (let ((.cse10 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_~#top~0.base| (let ((.cse11 (store .cse12 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select v_DerPreprocessor_8 0) 0) (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12))) (or (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse14 (let ((.cse15 (store .cse13 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse14 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse14 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse9)) (< c_~next_alloc_idx~0 65)))))) is different from false [2024-07-16 17:53:43,628 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (= (select v_DerPreprocessor_8 0) 0) (= (select (select .cse0 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse1 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse2 (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse1 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (= (select (select .cse3 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= 0 (select (select (let ((.cse4 (let ((.cse5 (store (select .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse5) |~#top~0.base| (let ((.cse6 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse5))) (store (select .cse6 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse4 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse4 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|))))))))) is different from false [2024-07-16 17:53:43,738 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse3 (store (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (not (= (select (select (let ((.cse0 (store (store (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse2 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse3 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0))))) (let ((.cse4 (+ c_~next_alloc_idx~0 2))) (or (< 62 c_~next_alloc_idx~0) (= .cse4 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse8 (store (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (not (= (select (select (let ((.cse5 (let ((.cse6 (store (select .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse4))) (store (store (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse6) |~#top~0.base| (let ((.cse7 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse6))) (store (select .cse7 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse5 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse5 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse8 |~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (let ((.cse9 (store (store .cse11 |~#top~0.base| (store (select .cse11 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (= (select (select .cse9 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse10 (store (store (store .cse11 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse12 (store .cse9 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse12 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select v_DerPreprocessor_13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (< c_~next_alloc_idx~0 65))) is different from false [2024-07-16 17:53:44,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:53:44,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-07-16 17:53:44,912 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-07-16 17:53:44,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 7667701 treesize of output 7505930 [2024-07-16 17:53:46,161 INFO L349 Elim1Store]: treesize reduction 274, result has 32.0 percent of original size [2024-07-16 17:53:46,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 29 case distinctions, treesize of input 2160783 treesize of output 2143665 [2024-07-16 17:53:47,694 INFO L349 Elim1Store]: treesize reduction 490, result has 27.1 percent of original size [2024-07-16 17:53:47,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 17472 treesize of output 17118 [2024-07-16 17:54:43,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:54:43,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 33733646442306 treesize of output 33648984416212 [2024-07-16 17:59:29,945 WARN L293 SmtUtils]: Spent 4.77m on a formula simplification. DAG size of input: 15311 DAG size of output: 1691 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 17:59:30,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 17:59:30,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 920915 treesize of output 893644 [2024-07-16 18:00:58,805 WARN L293 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 1676 DAG size of output: 1647 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:00:58,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 18:00:58,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 719475 treesize of output 719442 [2024-07-16 18:01:29,538 WARN L293 SmtUtils]: Spent 30.58s on a formula simplification. DAG size of input: 1635 DAG size of output: 1631 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:01:29,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 719145 treesize of output 719095 [2024-07-16 18:01:45,210 WARN L293 SmtUtils]: Spent 15.56s on a formula simplification. DAG size of input: 1614 DAG size of output: 1607 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:01:45,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 18:01:45,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 718527 treesize of output 718324 [2024-07-16 18:02:01,274 WARN L293 SmtUtils]: Spent 15.89s on a formula simplification. DAG size of input: 1591 DAG size of output: 1581 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:02:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 717051 treesize of output 716857 [2024-07-16 18:02:17,395 WARN L293 SmtUtils]: Spent 15.98s on a formula simplification. DAG size of input: 1561 DAG size of output: 1541 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:02:17,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 715902 treesize of output 715774 [2024-07-16 18:02:33,070 WARN L293 SmtUtils]: Spent 15.53s on a formula simplification. DAG size of input: 1526 DAG size of output: 1504 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:02:33,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-16 18:02:33,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 714032 treesize of output 713829 [2024-07-16 18:03:03,921 WARN L293 SmtUtils]: Spent 30.67s on a formula simplification. DAG size of input: 1488 DAG size of output: 1478 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:03:04,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 713624 treesize of output 713470 [2024-07-16 18:03:19,697 WARN L293 SmtUtils]: Spent 15.61s on a formula simplification. DAG size of input: 1465 DAG size of output: 1444 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:03:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 711718 treesize of output 711556 [2024-07-16 18:03:35,367 WARN L293 SmtUtils]: Spent 15.52s on a formula simplification. DAG size of input: 1429 DAG size of output: 1401 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-07-16 18:05:56,960 WARN L293 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 580 DAG size of output: 418 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15