./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 6568ba33 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-?-6568ba3-m [2023-11-23 21:56:47,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:56:47,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-23 21:56:47,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:56:47,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:56:47,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:56:47,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:56:47,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:56:47,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:56:47,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:56:47,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:56:47,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:56:47,106 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:56:47,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:56:47,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:56:47,108 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:56:47,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:56:47,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:56:47,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:56:47,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:56:47,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:56:47,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:56:47,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:56:47,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:56:47,110 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:56:47,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:56:47,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:56:47,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:56:47,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:56:47,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:56:47,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:56:47,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:56:47,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:56:47,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:56:47,113 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-23 21:56:47,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:56:47,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:56:47,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-23 21:56:47,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:56:47,114 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-23 21:56:47,114 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-23 21:56:47,114 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-23 21:56:47,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:56:47,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:56:47,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:56:47,346 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:56:47,346 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:56:47,348 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-23 21:56:48,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:56:48,572 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:56:48,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-23 21:56:48,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7e7026f6c/b9d8c6eac1ad4c0cb8f188437bb8d26a/FLAG28b8b7b60 [2023-11-23 21:56:48,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7e7026f6c/b9d8c6eac1ad4c0cb8f188437bb8d26a [2023-11-23 21:56:48,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:56:48,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:56:48,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:56:48,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:56:48,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:56:48,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:48" (1/1) ... [2023-11-23 21:56:48,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3163ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:48, skipping insertion in model container [2023-11-23 21:56:48,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:48" (1/1) ... [2023-11-23 21:56:48,975 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:56:49,222 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-23 21:56:49,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:56:49,239 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:56:49,291 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-23 21:56:49,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:56:49,331 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:56:49,334 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:56:49,339 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:56:49,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49 WrapperNode [2023-11-23 21:56:49,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:56:49,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:56:49,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:56:49,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:56:49,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,404 INFO L138 Inliner]: procedures = 173, calls = 30, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 86 [2023-11-23 21:56:49,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:56:49,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:56:49,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:56:49,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:56:49,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:56:49,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:56:49,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:56:49,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:56:49,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (1/1) ... [2023-11-23 21:56:49,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:56:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:56:49,506 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-23 21:56:49,514 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-23 21:56:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:56:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-23 21:56:49,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-23 21:56:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:56:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:56:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:56:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:56:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:56:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:56:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:56:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:56:49,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:56:49,552 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:56:49,667 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:56:49,669 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:56:49,792 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:56:49,894 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:56:49,894 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 21:56:49,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:49 BoogieIcfgContainer [2023-11-23 21:56:49,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:56:49,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:56:49,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:56:49,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:56:49,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:56:48" (1/3) ... [2023-11-23 21:56:49,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7ca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:49, skipping insertion in model container [2023-11-23 21:56:49,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:49" (2/3) ... [2023-11-23 21:56:49,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd7ca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:49, skipping insertion in model container [2023-11-23 21:56:49,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:49" (3/3) ... [2023-11-23 21:56:49,900 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-11-23 21:56:49,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:56:49,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:56:49,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:56:49,914 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:56:49,937 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:56:49,970 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:56:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 21:56:49,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:56:49,972 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-23 21:56:49,973 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-23 21:56:49,998 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 21:56:50,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-23 21:56:50,013 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;@1cea25bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:56:50,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:56:50,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:56:50,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:56:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 421169331, now seen corresponding path program 1 times [2023-11-23 21:56:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:56:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356144110] [2023-11-23 21:56:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:56:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:56:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:56:50,515 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-23 21:56:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:56:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356144110] [2023-11-23 21:56:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356144110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:56:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:56:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:56:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919809265] [2023-11-23 21:56:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:56:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:56:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:56:50,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:56:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:56:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:50,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:56:50,567 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-23 21:56:50,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:56:50,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:56:50,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:56:50,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:56:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1479875300, now seen corresponding path program 1 times [2023-11-23 21:56:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:56:50,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388756890] [2023-11-23 21:56:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:56:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:56:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:56:51,250 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-23 21:56:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:56:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388756890] [2023-11-23 21:56:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388756890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:56:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493461343] [2023-11-23 21:56:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:56:51,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:56:51,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:56:51,289 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-23 21:56:51,291 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-23 21:56:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:56:51,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 21:56:51,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:56:51,427 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-23 21:56:51,489 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 21:56:51,490 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-23 21:56:51,532 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-23 21:56:51,643 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-23 21:56:51,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:56:51,679 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-23 21:56:51,713 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-23 21:56:51,753 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-23 21:56:51,780 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-23 21:56:51,814 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-23 21:56:51,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:56:51,862 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-23 21:56:51,927 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-23 21:56:52,065 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-23 21:56:52,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:56:52,272 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-23 21:56:52,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:56:52,333 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-23 21:56:52,339 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-23 21:56:52,343 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-23 21:56:52,362 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-23 21:56:52,366 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-23 21:56:52,379 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-23 21:56:52,383 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-23 21:56:52,715 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-23 21:56:52,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493461343] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:56:52,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:56:52,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-11-23 21:56:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036353355] [2023-11-23 21:56:52,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:56:52,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 21:56:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:56:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 21:56:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=495, Unknown=7, NotChecked=144, Total=756 [2023-11-23 21:56:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:52,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:56:52,720 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-23 21:56:52,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:56:52,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:52,985 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-23 21:56:52,990 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-23 21:56:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:56:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 21:56:53,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 21:56:53,763 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-23 21:56:53,766 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:56:53,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:56:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -403938860, now seen corresponding path program 2 times [2023-11-23 21:56:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:56:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658677183] [2023-11-23 21:56:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:56:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:56:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:56:53,963 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-23 21:56:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:56:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658677183] [2023-11-23 21:56:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658677183] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:56:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915898030] [2023-11-23 21:56:53,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:56:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:56:53,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:56:53,965 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-23 21:56:53,984 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-23 21:56:54,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 21:56:54,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:56:54,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 21:56:54,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:56:54,069 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-23 21:56:54,098 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 21:56:54,098 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-23 21:56:54,115 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-23 21:56:54,151 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-23 21:56:54,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:56:54,169 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-23 21:56:54,183 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-23 21:56:54,206 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-23 21:56:54,217 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-23 21:56:54,226 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-23 21:56:54,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:56:54,248 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-23 21:56:56,772 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-23 21:56:56,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:56:56,893 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-23 21:56:56,935 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-23 21:56:56,938 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-23 21:56:56,976 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-23 21:56:57,017 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-23 21:56:57,020 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-23 21:56:57,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:56:57,030 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-23 21:56:57,033 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-23 21:56:57,037 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-23 21:56:59,302 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-23 21:56:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915898030] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:56:59,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:56:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-11-23 21:56:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27622029] [2023-11-23 21:56:59,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:56:59,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 21:56:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:56:59,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 21:56:59,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=416, Unknown=4, NotChecked=86, Total=600 [2023-11-23 21:56:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:59,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:56:59,305 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-23 21:56:59,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:56:59,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-23 21:56:59,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:56:59,527 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-23 21:57:00,478 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-23 21:57:01,430 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|)) (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|))) (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-23 21:57:02,375 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)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (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-23 21:57:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 21:57:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 21:57:06,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 21:57:06,388 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-23 21:57:06,588 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-23 21:57:06,592 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-11-23 21:57:06,593 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-23 21:57:06,595 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 21:57:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:06,596 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-23 21:57:06,599 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 21:57:06,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 21:57:06,600 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;@1cea25bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:06,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:57:06,609 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-23 21:57:06,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 21:57:06,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809227, now seen corresponding path program 1 times [2023-11-23 21:57:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523778825] [2023-11-23 21:57:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:06,713 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-23 21:57:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523778825] [2023-11-23 21:57:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523778825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:57:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29790199] [2023-11-23 21:57:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:06,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:06,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:06,715 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-23 21:57:06,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:06,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:57:06,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 21:57:06,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1016810188, now seen corresponding path program 1 times [2023-11-23 21:57:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512930571] [2023-11-23 21:57:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:57:06,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:57:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:57:06,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:57:06,801 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:57:06,801 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-23 21:57:06,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:57:06,802 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-23 21:57:06,803 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-23 21:57:06,803 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 21:57:06,803 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-23 21:57:06,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:57:06,814 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:06,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 21:57:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:06,816 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-23 21:57:06,830 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 21:57:06,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 21:57:06,830 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;@1cea25bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:06,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:57:06,856 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-23 21:57:06,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 21:57:06,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 463343620, now seen corresponding path program 1 times [2023-11-23 21:57:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238110078] [2023-11-23 21:57:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:07,051 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-23 21:57:07,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238110078] [2023-11-23 21:57:07,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238110078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:07,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:57:07,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429991356] [2023-11-23 21:57:07,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:07,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:07,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:07,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,054 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:07,054 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-23 21:57:07,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:57:07,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 21:57:07,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1100195758, now seen corresponding path program 1 times [2023-11-23 21:57:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252561908] [2023-11-23 21:57:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:07,291 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-23 21:57:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252561908] [2023-11-23 21:57:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252561908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:07,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:57:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550478058] [2023-11-23 21:57:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:07,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:07,294 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-23 21:57:07,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:07,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:07,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:57:07,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 21:57:07,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1100196719, now seen corresponding path program 1 times [2023-11-23 21:57:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648572972] [2023-11-23 21:57:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:57:07,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:57:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:57:07,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:57:07,446 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:57:07,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-23 21:57:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:57:07,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-23 21:57:07,447 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-23 21:57:07,447 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 21:57:07,447 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-23 21:57:07,460 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:57:07,461 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:07,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 21:57:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:07,477 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-23 21:57:07,482 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 21:57:07,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-23 21:57:07,483 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;@1cea25bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:57:07,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:57:07,497 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-23 21:57:07,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:07,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2009929927, now seen corresponding path program 1 times [2023-11-23 21:57:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173736928] [2023-11-23 21:57:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:07,726 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-23 21:57:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173736928] [2023-11-23 21:57:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173736928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:57:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425998350] [2023-11-23 21:57:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:07,728 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-23 21:57:07,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:07,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:57:07,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:07,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1504953050, now seen corresponding path program 1 times [2023-11-23 21:57:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:07,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54246882] [2023-11-23 21:57:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:08,055 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-23 21:57:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54246882] [2023-11-23 21:57:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54246882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:57:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271068948] [2023-11-23 21:57:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:08,058 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:08,058 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-23 21:57:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:08,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:57:08,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:08,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2056780604, now seen corresponding path program 1 times [2023-11-23 21:57:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:08,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818557503] [2023-11-23 21:57:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:08,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:08,352 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-23 21:57:08,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818557503] [2023-11-23 21:57:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818557503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:57:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:57:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653217047] [2023-11-23 21:57:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:08,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:57:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:57:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:57:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:08,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:08,354 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-23 21:57:08,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:08,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:08,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:08,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:57:08,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:08,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -314407849, now seen corresponding path program 1 times [2023-11-23 21:57:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058753120] [2023-11-23 21:57:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:09,854 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-23 21:57:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058753120] [2023-11-23 21:57:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058753120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:57:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420895869] [2023-11-23 21:57:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:09,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:57:09,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:09,862 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-23 21:57:09,880 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-23 21:57:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:10,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-23 21:57:10,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:57:10,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-23 21:57:10,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-23 21:57:10,154 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-23 21:57:10,204 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-23 21:57:10,230 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-23 21:57:10,258 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-23 21:57:10,284 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-23 21:57:10,312 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-23 21:57:10,339 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-23 21:57:10,362 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-23 21:57:10,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:57:10,412 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-23 21:57:10,440 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-23 21:57:10,478 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-23 21:57:10,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:57:10,681 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-23 21:57:10,687 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-23 21:57:13,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:57:13,187 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-23 21:57:13,292 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-23 21:57:13,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:57:13,575 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-23 21:57:13,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:57:13,725 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-23 21:57:13,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:57:13,806 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-23 21:57:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 227 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:57:13,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420895869] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:57:13,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:57:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 54 [2023-11-23 21:57:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236882457] [2023-11-23 21:57:13,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:57:13,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-23 21:57:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-23 21:57:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2592, Unknown=14, NotChecked=0, Total=3080 [2023-11-23 21:57:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:13,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:13,872 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-23 21:57:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:30,298 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-23 21:57:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-11-23 21:57:44,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 21:57:44,335 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-23 21:57:44,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:44,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1438633232, now seen corresponding path program 2 times [2023-11-23 21:57:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894037728] [2023-11-23 21:57:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:48,946 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-23 21:57:48,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894037728] [2023-11-23 21:57:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894037728] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:57:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585594398] [2023-11-23 21:57:48,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:57:48,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:57:48,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:48,948 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-23 21:57:48,950 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-23 21:57:49,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 21:57:49,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:57:49,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 21:57:49,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:57:49,210 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-23 21:57:49,251 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-23 21:57:49,257 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-23 21:57:49,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:57:49,455 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-23 21:57:49,534 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-23 21:57:49,558 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-23 21:57:49,608 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-23 21:57:49,646 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-23 21:57:49,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:57:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585594398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:57:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 21:57:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [36] total 44 [2023-11-23 21:57:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090882750] [2023-11-23 21:57:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:57:49,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:57:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:57:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:57:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1800, Unknown=0, NotChecked=0, Total=1892 [2023-11-23 21:57:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:49,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 21:57:49,651 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-23 21:57:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:57:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2023-11-23 21:57:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:57:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:57:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-11-23 21:57:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:57:50,265 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-23 21:57:50,461 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-23 21:57:50,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:57:50,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:57:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -284377939, now seen corresponding path program 1 times [2023-11-23 21:57:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:57:50,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304424530] [2023-11-23 21:57:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:57:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:54,428 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-23 21:57:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:57:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304424530] [2023-11-23 21:57:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304424530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:57:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810442503] [2023-11-23 21:57:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:57:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:57:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 21:57:54,430 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-23 21:57:54,431 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-23 21:57:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:57:54,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-23 21:57:54,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:57:54,899 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-23 21:57:54,920 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-23 21:57:54,929 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-23 21:57:54,947 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-23 21:57:54,955 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-23 21:57:54,965 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-23 21:57:54,974 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-23 21:57:54,982 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-23 21:57:54,990 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-23 21:57:54,999 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-23 21:57:55,007 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-23 21:57:55,016 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-23 21:57:55,024 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-23 21:57:55,032 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-23 21:57:55,047 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-23 21:57:55,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-23 21:57:55,060 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-23 21:57:55,078 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-23 21:57:55,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-23 21:57:55,100 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-23 21:57:55,112 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-23 21:57:55,125 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-23 21:57:55,137 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-23 21:57:55,149 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-23 21:57:55,159 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-23 21:57:55,169 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-23 21:57:55,207 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-23 21:57:55,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:57:55,335 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-23 21:57:55,374 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-23 21:57:55,439 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-23 21:57:55,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:57:55,756 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-23 21:57:55,763 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-23 22:00:50,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:00:50,554 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-23 22:00:51,676 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 2123 treesize of output 2113