./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20174008 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/37_stack_lock_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 d05018e114128995041419dca600f2451b0df342be45761a900c0d0704b1b40b --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 08:08:32,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 08:08:32,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-24 08:08:32,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 08:08:32,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 08:08:32,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 08:08:32,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 08:08:32,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 08:08:32,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 08:08:32,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 08:08:32,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 08:08:32,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 08:08:32,567 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 08:08:32,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 08:08:32,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 08:08:32,580 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 08:08:32,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 08:08:32,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 08:08:32,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 08:08:32,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 08:08:32,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 08:08:32,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 08:08:32,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 08:08:32,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 08:08:32,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 08:08:32,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 08:08:32,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 08:08:32,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 08:08:32,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 08:08:32,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:08:32,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 08:08:32,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 08:08:32,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 08:08:32,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 08:08:32,593 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 08:08:32,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 08:08:32,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 08:08:32,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 08:08:32,627 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 08:08:32,627 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 08:08:32,627 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 08:08:32,628 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 -> d05018e114128995041419dca600f2451b0df342be45761a900c0d0704b1b40b [2023-11-24 08:08:32,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 08:08:32,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 08:08:32,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 08:08:32,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 08:08:32,952 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 08:08:32,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-24 08:08:34,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 08:08:35,385 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 08:08:35,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-24 08:08:35,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a5402adef/226892b64f8541868d279f225782d672/FLAG569503a5f [2023-11-24 08:08:35,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a5402adef/226892b64f8541868d279f225782d672 [2023-11-24 08:08:35,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 08:08:35,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 08:08:35,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 08:08:35,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 08:08:35,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 08:08:35,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:08:35" (1/1) ... [2023-11-24 08:08:35,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@846ab39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:35, skipping insertion in model container [2023-11-24 08:08:35,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:08:35" (1/1) ... [2023-11-24 08:08:35,585 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 08:08:36,002 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30907,30920] [2023-11-24 08:08:36,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:08:36,027 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 08:08:36,077 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30907,30920] [2023-11-24 08:08:36,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:08:36,118 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:08:36,118 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:08:36,125 INFO L206 MainTranslator]: Completed translation [2023-11-24 08:08:36,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36 WrapperNode [2023-11-24 08:08:36,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 08:08:36,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 08:08:36,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 08:08:36,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 08:08:36,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,187 INFO L138 Inliner]: procedures = 173, calls = 30, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 86 [2023-11-24 08:08:36,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 08:08:36,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 08:08:36,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 08:08:36,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 08:08:36,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 08:08:36,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 08:08:36,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 08:08:36,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 08:08:36,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (1/1) ... [2023-11-24 08:08:36,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:08:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:08:36,276 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) [2023-11-24 08:08:36,279 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 [2023-11-24 08:08:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 08:08:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 08:08:36,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 08:08:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 08:08:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 08:08:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 08:08:36,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 08:08:36,351 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 08:08:36,476 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 08:08:36,481 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 08:08:36,713 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 08:08:36,861 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 08:08:36,861 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 08:08:36,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:08:36 BoogieIcfgContainer [2023-11-24 08:08:36,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 08:08:36,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 08:08:36,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 08:08:36,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 08:08:36,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 08:08:35" (1/3) ... [2023-11-24 08:08:36,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a011b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:08:36, skipping insertion in model container [2023-11-24 08:08:36,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:08:36" (2/3) ... [2023-11-24 08:08:36,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a011b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:08:36, skipping insertion in model container [2023-11-24 08:08:36,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:08:36" (3/3) ... [2023-11-24 08:08:36,873 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-11-24 08:08:36,883 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 08:08:36,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 08:08:36,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 08:08:36,894 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 08:08:36,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:08:36,972 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:08:36,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:08:36,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:08:36,974 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) [2023-11-24 08:08:36,999 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 [2023-11-24 08:08:37,020 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:08:37,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 08:08:37,039 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;@5ba8941c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:08:37,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:08:37,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:08:37,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:08:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 421169331, now seen corresponding path program 1 times [2023-11-24 08:08:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:08:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933735296] [2023-11-24 08:08:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:08:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:08:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:08:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933735296] [2023-11-24 08:08:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933735296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:08:37,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:08:37,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:08:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365788289] [2023-11-24 08:08:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:08:37,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:08:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:08:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:08:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:08:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:37,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:08:37,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-24 08:08:37,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:08:37,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 08:08:37,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:08:37,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:08:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1479875300, now seen corresponding path program 1 times [2023-11-24 08:08:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:08:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137811944] [2023-11-24 08:08:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:08:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:08:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:08:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137811944] [2023-11-24 08:08:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137811944] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:08:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820711170] [2023-11-24 08:08:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:08:38,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:08:38,457 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) [2023-11-24 08:08:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 08:08:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:38,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 08:08:38,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:08:38,600 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 [2023-11-24 08:08:38,678 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:08:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 08:08:38,714 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 8 treesize of output 1 [2023-11-24 08:08:38,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-24 08:08:38,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:08:38,828 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 [2023-11-24 08:08:38,860 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 15 treesize of output 1 [2023-11-24 08:08:38,886 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 16 treesize of output 11 [2023-11-24 08:08:38,922 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 15 treesize of output 7 [2023-11-24 08:08:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:08:38,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:08:39,025 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2023-11-24 08:08:39,147 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_69 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2023-11-24 08:08:39,298 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)))))) is different from false [2023-11-24 08:08:39,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:08:39,498 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 [2023-11-24 08:08:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:08:39,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-24 08:08:39,560 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 31 treesize of output 23 [2023-11-24 08:08:39,565 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 9 treesize of output 7 [2023-11-24 08:08:39,585 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 9 treesize of output 7 [2023-11-24 08:08:39,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:08:39,603 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 9 treesize of output 7 [2023-11-24 08:08:39,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:08:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-24 08:08:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820711170] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:08:40,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:08:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-11-24 08:08:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933208050] [2023-11-24 08:08:40,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:08:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-24 08:08:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:08:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-24 08:08:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=495, Unknown=7, NotChecked=144, Total=756 [2023-11-24 08:08:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:40,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:08:40,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 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) [2023-11-24 08:08:40,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:08:40,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:40,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or .cse1 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0))))) (<= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (< 0 c_~top~0) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or .cse0 (and (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_11 Int) (v_prenex_10 Int)) (not (= 0 (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_11) v_prenex_10))))) (or (< 62 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_16) v_prenex_15) 0)))) (forall ((v_prenex_16 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))))) (or .cse1 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)))) (or .cse1 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2023-11-24 08:08:40,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0))))) (<= 3 .cse0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= .cse0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|))) is different from false [2023-11-24 08:08:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:08:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 08:08:41,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 08:08:41,895 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,SelfDestructingSolverStorable1 [2023-11-24 08:08:41,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:08:41,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:08:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -403938860, now seen corresponding path program 2 times [2023-11-24 08:08:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:08:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476043383] [2023-11-24 08:08:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:08:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 08:08:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:08:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476043383] [2023-11-24 08:08:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476043383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:08:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619035101] [2023-11-24 08:08:42,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:08:42,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:08:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:08:42,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 08:08:42,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 08:08:42,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:08:42,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:08:42,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 08:08:42,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:08:42,201 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 [2023-11-24 08:08:42,236 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:08:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 08:08:42,259 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 8 treesize of output 1 [2023-11-24 08:08:42,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-24 08:08:42,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:08:42,329 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 [2023-11-24 08:08:42,346 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 15 treesize of output 1 [2023-11-24 08:08:42,375 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 16 treesize of output 11 [2023-11-24 08:08:42,389 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 15 treesize of output 7 [2023-11-24 08:08:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:08:42,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:08:42,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2023-11-24 08:08:45,179 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) is different from false [2023-11-24 08:08:45,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:08:45,446 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 [2023-11-24 08:08:45,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:08:45,507 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 9 treesize of output 7 [2023-11-24 08:08:45,521 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 46 treesize of output 42 [2023-11-24 08:08:45,589 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 9 treesize of output 7 [2023-11-24 08:08:45,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:08:45,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:08:45,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-24 08:08:45,609 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 [2023-11-24 08:08:45,614 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 9 treesize of output 7 [2023-11-24 08:08:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-24 08:08:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619035101] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:08:48,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:08:48,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-11-24 08:08:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199369202] [2023-11-24 08:08:48,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:08:48,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 08:08:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:08:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 08:08:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=416, Unknown=4, NotChecked=86, Total=600 [2023-11-24 08:08:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:48,229 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:08:48,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 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) [2023-11-24 08:08:48,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:08:48,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-24 08:08:48,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:48,642 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_123 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_29 Int) (v_prenex_28 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_28) v_prenex_29) 0)))))) (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) .cse1) (or .cse1 (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (<= 3 (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) .cse1) (or .cse1 (and (forall ((v_prenex_38 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_38) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_32) v_prenex_33) 0))))) (< 0 c_~top~0) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))))) is different from false [2023-11-24 08:08:50,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (<= 3 .cse0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (= .cse0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))))) is different from false [2023-11-24 08:09:01,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:03,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:05,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:07,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:11,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:12,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:14,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:17,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:18,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:20,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:22,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:23,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:24,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:25,839 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (<= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (<= 3 c_~top~0) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) is different from false [2023-11-24 08:09:38,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:39,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:41,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:42,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:45,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:50,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:51,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:09:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 08:09:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 08:09:55,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-24 08:09:56,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 08:09:56,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:09:56,205 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-11-24 08:09:56,208 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-24 08:09:56,212 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:09:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:09:56,213 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) [2023-11-24 08:09:56,216 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 [2023-11-24 08:09:56,233 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:09:56,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:09:56,234 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;@5ba8941c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:56,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:09:56,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:09:56,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809227, now seen corresponding path program 1 times [2023-11-24 08:09:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185597582] [2023-11-24 08:09:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:09:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:56,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185597582] [2023-11-24 08:09:56,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185597582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:56,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:56,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:09:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967632949] [2023-11-24 08:09:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:56,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-24 08:09:56,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:56,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 08:09:56,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:09:56,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1016810188, now seen corresponding path program 1 times [2023-11-24 08:09:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660730907] [2023-11-24 08:09:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:09:56,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:09:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:09:56,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 08:09:56,548 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:09:56,549 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:09:56,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 08:09:56,551 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-24 08:09:56,551 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-24 08:09:56,552 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:09:56,552 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 08:09:56,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:09:56,569 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:09:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:09:56,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:09:56,575 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:09:56,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:09:56,576 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;@5ba8941c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:56,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:09:56,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-11-24 08:09:56,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:09:56,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 463343620, now seen corresponding path program 1 times [2023-11-24 08:09:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752715780] [2023-11-24 08:09:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:09:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752715780] [2023-11-24 08:09:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752715780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:56,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:56,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:09:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684527010] [2023-11-24 08:09:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:56,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:56,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:56,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:56,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:09:56,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:56,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 08:09:56,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:09:56,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1100195758, now seen corresponding path program 1 times [2023-11-24 08:09:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268196629] [2023-11-24 08:09:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-24 08:09:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268196629] [2023-11-24 08:09:57,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268196629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:57,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:09:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347291785] [2023-11-24 08:09:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:57,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:57,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:57,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-11-24 08:09:57,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:57,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:57,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 08:09:57,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:09:57,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1100196719, now seen corresponding path program 1 times [2023-11-24 08:09:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555553640] [2023-11-24 08:09:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:09:57,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:09:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:09:57,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 08:09:57,304 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:09:57,304 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:09:57,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 08:09:57,306 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-24 08:09:57,306 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-24 08:09:57,306 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:09:57,306 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-24 08:09:57,324 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:09:57,326 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:57,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:09:57,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:09:57,328 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) [2023-11-24 08:09:57,338 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:09:57,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-24 08:09:57,339 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;@5ba8941c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:09:57,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:09:57,354 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 [2023-11-24 08:09:57,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:57,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2009929927, now seen corresponding path program 1 times [2023-11-24 08:09:57,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:57,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210024202] [2023-11-24 08:09:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:09:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210024202] [2023-11-24 08:09:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210024202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:09:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920427729] [2023-11-24 08:09:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:57,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:57,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-11-24 08:09:57,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:57,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 08:09:57,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:57,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1504953050, now seen corresponding path program 1 times [2023-11-24 08:09:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797603301] [2023-11-24 08:09:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-24 08:09:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797603301] [2023-11-24 08:09:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797603301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:09:58,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794816899] [2023-11-24 08:09:58,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:58,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:58,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:58,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:58,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:58,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2023-11-24 08:09:58,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:58,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:58,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 08:09:58,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:58,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2056780604, now seen corresponding path program 1 times [2023-11-24 08:09:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869156440] [2023-11-24 08:09:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:58,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-24 08:09:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:09:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869156440] [2023-11-24 08:09:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869156440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:09:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695734124] [2023-11-24 08:09:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:09:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:09:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:09:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:09:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:58,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:58,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-24 08:09:58,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:58,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 08:09:58,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:58,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -314407849, now seen corresponding path program 1 times [2023-11-24 08:09:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:09:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669527935] [2023-11-24 08:09:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:09:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:10:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:10:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669527935] [2023-11-24 08:10:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669527935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:10:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489349687] [2023-11-24 08:10:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:00,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:10:00,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:10:00,766 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) [2023-11-24 08:10:00,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 08:10:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:01,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-24 08:10:01,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:01,109 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 [2023-11-24 08:10:01,190 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 [2023-11-24 08:10:01,217 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 [2023-11-24 08:10:01,281 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 [2023-11-24 08:10:01,334 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 [2023-11-24 08:10:01,374 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 [2023-11-24 08:10:01,419 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 [2023-11-24 08:10:01,448 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 [2023-11-24 08:10:01,477 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 [2023-11-24 08:10:01,506 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 [2023-11-24 08:10:01,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:10:01,608 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 [2023-11-24 08:10:01,651 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 16 treesize of output 11 [2023-11-24 08:10:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:10:01,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:10:02,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:10:02,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:10:05,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:05,581 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 [2023-11-24 08:10:05,688 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 7871 treesize of output 7861 [2023-11-24 08:10:06,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:06,076 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 [2023-11-24 08:10:06,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:06,266 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 [2023-11-24 08:10:06,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:06,383 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 [2023-11-24 08:10:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 225 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:10:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489349687] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:10:06,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:10:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 54 [2023-11-24 08:10:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023727315] [2023-11-24 08:10:06,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:10:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-24 08:10:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:10:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-24 08:10:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2587, Unknown=19, NotChecked=0, Total=3080 [2023-11-24 08:10:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:06,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:10:06,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 7.2) internal successors, (396), 55 states have internal predecessors, (396), 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) [2023-11-24 08:10:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:06,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:26,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse4 (< c_~next_alloc_idx~0 61)) (.cse8 (< 60 c_~next_alloc_idx~0)) (.cse7 (< c_~next_alloc_idx~0 59)) (.cse5 (< c_~next_alloc_idx~0 63)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse10 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_11 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53))) .cse0) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53)))) (forall ((v_DerPreprocessor_5 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or .cse1 (and (or .cse2 (and (forall ((v_prenex_49 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_51 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_68 v_DerPreprocessor_7))) (store .cse3 v_prenex_51 (store (select .cse3 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 4)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse4))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse5))) (or .cse1 (and (or .cse5 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_158 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) v_prenex_158 v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or .cse2 (and (or (and (or (< 58 c_~next_alloc_idx~0) (and (forall ((v_prenex_49 Int) (v_prenex_68 Int) (v_prenex_143 (Array Int Int)) (v_prenex_96 Int) (v_prenex_51 Int) (v_prenex_50 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_142 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse6 (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_142 v_prenex_143) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse6 v_prenex_51 (store (select .cse6 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 8)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_prenex_66 Int) (v_prenex_145 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_156 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_144 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_144 v_prenex_145) v_prenex_156 v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 57)))) (or .cse7 (forall ((v_prenex_151 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_98 Int) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_146 Int) (v_prenex_97 (Array Int Int)) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_153 Int) (v_prenex_150 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_155 v_prenex_153) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_146 v_prenex_147) v_prenex_98 v_prenex_97) v_prenex_150 v_prenex_149) v_prenex_153 v_prenex_151) v_prenex_155 v_prenex_152) v_prenex_153) v_prenex_154)))))) .cse8) (or (forall ((v_prenex_99 Int) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_prenex_148 (Array Int Int)) (v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_157 Int) (v_prenex_100 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_157 v_DerPreprocessor_12) v_prenex_106 v_prenex_148) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)) (= v_prenex_105 v_prenex_100))) .cse4))))) (or .cse1 (and (forall ((v_prenex_49 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_52 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_51 Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse9 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7))) (store .cse9 v_prenex_51 (store (select .cse9 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 2)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or .cse5 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (not (= c_~top~0 0)) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int)) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse10 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or (and (or .cse2 (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_prenex_97 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_98 Int) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_98 v_prenex_97) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse4) (or .cse8 (and (or .cse7 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((v_prenex_49 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_95 (Array Int Int)) (v_prenex_96 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_51 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse11 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse11 v_prenex_51 (store (select .cse11 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 6)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))))))) (or .cse5 (forall ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (v_prenex_99 Int) (v_prenex_100 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_105 v_prenex_100) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_106 v_DerPreprocessor_9) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)))))) .cse1) (< 0 (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2023-11-24 08:10:26,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse4 (< c_~next_alloc_idx~0 61)) (.cse8 (< 60 c_~next_alloc_idx~0)) (.cse7 (< c_~next_alloc_idx~0 59)) (.cse5 (< c_~next_alloc_idx~0 63)) (.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_11 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53))) .cse0) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53)))) (or .cse1 (and (or .cse2 (and (forall ((v_prenex_49 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_51 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_68 v_DerPreprocessor_7))) (store .cse3 v_prenex_51 (store (select .cse3 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 4)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse4))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse5))) (or .cse1 (and (or .cse5 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_158 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) v_prenex_158 v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or .cse2 (and (or (and (or (< 58 c_~next_alloc_idx~0) (and (forall ((v_prenex_49 Int) (v_prenex_68 Int) (v_prenex_143 (Array Int Int)) (v_prenex_96 Int) (v_prenex_51 Int) (v_prenex_50 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_142 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse6 (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_142 v_prenex_143) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse6 v_prenex_51 (store (select .cse6 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 8)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_prenex_66 Int) (v_prenex_145 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_156 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_144 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_144 v_prenex_145) v_prenex_156 v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 57)))) (or .cse7 (forall ((v_prenex_151 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_98 Int) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_146 Int) (v_prenex_97 (Array Int Int)) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_153 Int) (v_prenex_150 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_155 v_prenex_153) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_146 v_prenex_147) v_prenex_98 v_prenex_97) v_prenex_150 v_prenex_149) v_prenex_153 v_prenex_151) v_prenex_155 v_prenex_152) v_prenex_153) v_prenex_154)))))) .cse8) (or (forall ((v_prenex_99 Int) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_prenex_148 (Array Int Int)) (v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_157 Int) (v_prenex_100 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_157 v_DerPreprocessor_12) v_prenex_106 v_prenex_148) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)) (= v_prenex_105 v_prenex_100))) .cse4))))) (or .cse1 (and (forall ((v_prenex_49 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_52 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_51 Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse9 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7))) (store .cse9 v_prenex_51 (store (select .cse9 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 2)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or .cse5 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (< 0 c_~top~0) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or (and (or .cse2 (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_prenex_97 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_98 Int) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_98 v_prenex_97) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse4) (or .cse8 (and (or .cse7 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((v_prenex_49 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_95 (Array Int Int)) (v_prenex_96 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_51 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse10 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse10 v_prenex_51 (store (select .cse10 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 6)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))))))) (or .cse5 (forall ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (v_prenex_99 Int) (v_prenex_100 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_105 v_prenex_100) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_106 v_DerPreprocessor_9) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)))))) .cse1) (< 0 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2023-11-24 08:10:28,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse4 (< c_~next_alloc_idx~0 61)) (.cse8 (< 60 c_~next_alloc_idx~0)) (.cse7 (< c_~next_alloc_idx~0 59)) (.cse5 (< c_~next_alloc_idx~0 63)) (.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_11 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53))) .cse0) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)) (= v_prenex_55 v_prenex_53)))) (or .cse1 (and (or .cse2 (and (forall ((v_prenex_49 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_51 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_68 v_DerPreprocessor_7))) (store .cse3 v_prenex_51 (store (select .cse3 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 4)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse4))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse5))) (or .cse1 (and (or .cse5 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_158 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) v_prenex_158 v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or .cse2 (and (or (and (or (< 58 c_~next_alloc_idx~0) (and (forall ((v_prenex_49 Int) (v_prenex_68 Int) (v_prenex_143 (Array Int Int)) (v_prenex_96 Int) (v_prenex_51 Int) (v_prenex_50 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_142 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse6 (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_142 v_prenex_143) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse6 v_prenex_51 (store (select .cse6 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 8)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_prenex_66 Int) (v_prenex_145 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_156 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_144 Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_144 v_prenex_145) v_prenex_156 v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 57)))) (or .cse7 (forall ((v_prenex_151 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_98 Int) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_146 Int) (v_prenex_97 (Array Int Int)) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_153 Int) (v_prenex_150 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (= v_prenex_155 v_prenex_153) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_146 v_prenex_147) v_prenex_98 v_prenex_97) v_prenex_150 v_prenex_149) v_prenex_153 v_prenex_151) v_prenex_155 v_prenex_152) v_prenex_153) v_prenex_154)))))) .cse8) (or (forall ((v_prenex_99 Int) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_prenex_148 (Array Int Int)) (v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_157 Int) (v_prenex_100 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_157 v_DerPreprocessor_12) v_prenex_106 v_prenex_148) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)) (= v_prenex_105 v_prenex_100))) .cse4))))) (or .cse1 (and (forall ((v_prenex_49 Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_52 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_51 Int) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse9 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7))) (store .cse9 v_prenex_51 (store (select .cse9 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 2)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))) (or .cse5 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (not (= c_~top~0 0)) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or .cse0 (forall ((v_prenex_55 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_56 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54))))) (or (and (or .cse2 (and (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_55 Int) (v_prenex_97 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_98 Int) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_prenex_53 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_55 v_prenex_53) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_98 v_prenex_97) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) v_prenex_55 v_DerPreprocessor_6) v_prenex_53 v_prenex_56) v_prenex_55) v_prenex_54)))) .cse4) (or .cse8 (and (or .cse7 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_66 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_69 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) v_prenex_66 v_prenex_67) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17| v_prenex_69) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((v_prenex_49 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_68 Int) (v_prenex_95 (Array Int Int)) (v_prenex_96 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_51 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_prenex_50 Int)) (or (= v_prenex_51 v_prenex_50) (< 0 (select (select (store (let ((.cse10 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_96 v_prenex_95) v_prenex_68 v_DerPreprocessor_7))) (store .cse10 v_prenex_51 (store (select .cse10 v_prenex_51) v_prenex_49 (+ c_~next_alloc_idx~0 6)))) v_prenex_50 v_prenex_52) v_prenex_51) v_prenex_49)))))))) (or .cse5 (forall ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (v_prenex_99 Int) (v_prenex_100 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (or (= v_prenex_105 v_prenex_100) (< 0 (select (select (store (store (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) v_prenex_106 v_DerPreprocessor_9) v_prenex_99 v_prenex_102) v_prenex_100 v_prenex_101) v_prenex_105 v_prenex_103) v_prenex_100) v_prenex_104)))))) .cse1))) is different from false [2023-11-24 08:10:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-11-24 08:10:38,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 08:10:38,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 08:10:38,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:10:38,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:10:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1438633232, now seen corresponding path program 2 times [2023-11-24 08:10:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:10:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706863701] [2023-11-24 08:10:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:10:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 66 proven. 1625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:10:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:10:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706863701] [2023-11-24 08:10:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706863701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:10:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646300138] [2023-11-24 08:10:45,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:10:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:10:45,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:10:45,471 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) [2023-11-24 08:10:45,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 08:10:45,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 08:10:45,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:10:45,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 08:10:45,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:45,774 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 [2023-11-24 08:10:45,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 08:10:45,826 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 [2023-11-24 08:10:46,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:10:46,029 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 [2023-11-24 08:10:46,078 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 73 [2023-11-24 08:10:46,114 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 23 treesize of output 16 [2023-11-24 08:10:46,165 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 40 treesize of output 20 [2023-11-24 08:10:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 1589 trivial. 0 not checked. [2023-11-24 08:10:46,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:10:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646300138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:10:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 08:10:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [36] total 44 [2023-11-24 08:10:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143818481] [2023-11-24 08:10:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:10:46,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 08:10:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:10:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 08:10:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1800, Unknown=0, NotChecked=0, Total=1892 [2023-11-24 08:10:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:46,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:10:46,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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) [2023-11-24 08:10:46,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:46,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:46,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:46,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2023-11-24 08:10:46,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-11-24 08:10:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:10:46,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-24 08:10:47,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:10:47,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:10:47,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:10:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -284377939, now seen corresponding path program 1 times [2023-11-24 08:10:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:10:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835320565] [2023-11-24 08:10:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:10:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 0 proven. 1599 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:10:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:10:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835320565] [2023-11-24 08:10:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835320565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:10:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201573666] [2023-11-24 08:10:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:10:53,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:10:53,552 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) [2023-11-24 08:10:53,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-24 08:10:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:54,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-24 08:10:54,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:54,054 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 [2023-11-24 08:10:54,090 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 [2023-11-24 08:10:54,103 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 [2023-11-24 08:10:54,132 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 [2023-11-24 08:10:54,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:10:54,160 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 [2023-11-24 08:10:54,172 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 [2023-11-24 08:10:54,187 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 [2023-11-24 08:10:54,197 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 [2023-11-24 08:10:54,209 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 [2023-11-24 08:10:54,219 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 [2023-11-24 08:10:54,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 8 treesize of output 1 [2023-11-24 08:10:54,245 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 [2023-11-24 08:10:54,256 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 [2023-11-24 08:10:54,268 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 [2023-11-24 08:10:54,283 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 [2023-11-24 08:10:54,294 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 [2023-11-24 08:10:54,305 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 [2023-11-24 08:10:54,315 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 [2023-11-24 08:10:54,325 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 [2023-11-24 08:10:54,337 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 [2023-11-24 08:10:54,346 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 [2023-11-24 08:10:54,361 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 [2023-11-24 08:10:54,375 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 [2023-11-24 08:10:54,385 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 [2023-11-24 08:10:54,397 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 [2023-11-24 08:10:54,439 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 [2023-11-24 08:10:54,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:10:54,517 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 [2023-11-24 08:10:54,559 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 16 treesize of output 11 [2023-11-24 08:10:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 278 proven. 1311 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 08:10:54,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:10:55,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:10:55,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 08:14:28,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:14:28,968 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