./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a849f68 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.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 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-25 15:38:48,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 15:38:48,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-25 15:38:48,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 15:38:48,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 15:38:48,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 15:38:48,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 15:38:48,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 15:38:48,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-25 15:38:48,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-25 15:38:48,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 15:38:48,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 15:38:48,566 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 15:38:48,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 15:38:48,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-25 15:38:48,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 15:38:48,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 15:38:48,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 15:38:48,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 15:38:48,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-25 15:38:48,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-25 15:38:48,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-25 15:38:48,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 15:38:48,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 15:38:48,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 15:38:48,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 15:38:48,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 15:38:48,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 15:38:48,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-25 15:38:48,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-25 15:38:48,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:38:48,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 15:38:48,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-25 15:38:48,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-25 15:38:48,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 15:38:48,574 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-25 15:38:48,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-25 15:38:48,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-25 15:38:48,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-25 15:38:48,575 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-25 15:38:48,575 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-25 15:38:48,576 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 -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 [2024-10-25 15:38:48,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 15:38:48,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 15:38:48,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 15:38:48,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 15:38:48,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 15:38:48,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-10-25 15:38:50,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 15:38:50,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 15:38:50,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-10-25 15:38:50,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a9ad06bd2/29467456fe3a4baa8bbb10f64d532ed2/FLAG9e7daca8c [2024-10-25 15:38:50,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a9ad06bd2/29467456fe3a4baa8bbb10f64d532ed2 [2024-10-25 15:38:50,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 15:38:50,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 15:38:50,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 15:38:50,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 15:38:50,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 15:38:50,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:38:50" (1/1) ... [2024-10-25 15:38:50,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f703e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:50, skipping insertion in model container [2024-10-25 15:38:50,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:38:50" (1/1) ... [2024-10-25 15:38:50,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 15:38:51,146 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2024-10-25 15:38:51,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:38:51,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 15:38:51,253 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2024-10-25 15:38:51,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:38:51,330 INFO L204 MainTranslator]: Completed translation [2024-10-25 15:38:51,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51 WrapperNode [2024-10-25 15:38:51,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 15:38:51,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 15:38:51,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 15:38:51,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 15:38:51,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,385 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 272 [2024-10-25 15:38:51,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 15:38:51,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 15:38:51,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 15:38:51,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 15:38:51,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 15:38:51,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 15:38:51,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 15:38:51,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 15:38:51,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (1/1) ... [2024-10-25 15:38:51,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:38:51,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:38:51,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-25 15:38:51,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-25 15:38:51,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 15:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 15:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-25 15:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-25 15:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-25 15:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-25 15:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 15:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-25 15:38:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-25 15:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-25 15:38:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 15:38:51,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 15:38:51,529 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-25 15:38:51,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 15:38:51,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 15:38:52,076 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-25 15:38:52,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 15:38:52,594 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 15:38:52,595 INFO L314 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-25 15:38:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:38:52 BoogieIcfgContainer [2024-10-25 15:38:52,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 15:38:52,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-25 15:38:52,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-25 15:38:52,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-25 15:38:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:38:50" (1/3) ... [2024-10-25 15:38:52,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718ccac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:38:52, skipping insertion in model container [2024-10-25 15:38:52,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:38:51" (2/3) ... [2024-10-25 15:38:52,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718ccac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:38:52, skipping insertion in model container [2024-10-25 15:38:52,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:38:52" (3/3) ... [2024-10-25 15:38:52,605 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2024-10-25 15:38:52,621 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-25 15:38:52,622 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-25 15:38:52,623 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-25 15:38:52,689 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-25 15:38:52,740 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:38:52,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:38:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:38:52,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:38:52,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-25 15:38:52,777 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:38:52,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-25 15:38:52,799 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:38:52,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:38:53,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:38:53,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:38:53,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1974830970, now seen corresponding path program 1 times [2024-10-25 15:38:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:38:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926463925] [2024-10-25 15:38:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:38:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:38:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:38:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 15:38:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:38:53,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926463925] [2024-10-25 15:38:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926463925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:38:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:38:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:38:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958925760] [2024-10-25 15:38:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:38:53,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:38:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:38:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:38:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:38:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:53,924 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:38:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:38:53,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:38:56,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-25 15:38:56,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:38:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:38:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2129310501, now seen corresponding path program 1 times [2024-10-25 15:38:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:38:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052405407] [2024-10-25 15:38:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:38:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:38:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:38:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:38:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052405407] [2024-10-25 15:38:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052405407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:38:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114623042] [2024-10-25 15:38:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:38:56,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:38:56,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:38:56,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:38:56,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-25 15:38:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:38:56,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:38:56,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:38:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:56,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:38:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114623042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:38:56,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:38:56,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:38:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790781361] [2024-10-25 15:38:56,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:38:56,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:38:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:38:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:38:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:38:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:56,834 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:38:56,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:38:56,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:38:56,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:38:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:38:56,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-25 15:38:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-25 15:38:57,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:38:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:38:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -149208161, now seen corresponding path program 2 times [2024-10-25 15:38:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:38:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336506785] [2024-10-25 15:38:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:38:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:38:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:38:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:38:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336506785] [2024-10-25 15:38:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336506785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:38:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912957658] [2024-10-25 15:38:57,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:38:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:38:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:38:57,348 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) [2024-10-25 15:38:57,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-25 15:38:57,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:38:57,449 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:38:57,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:38:57,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:38:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:57,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:38:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:38:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912957658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:38:57,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:38:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:38:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792313122] [2024-10-25 15:38:57,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:38:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:38:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:38:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:38:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:38:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:57,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:38:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:38:57,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:38:57,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:38:57,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:38:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:38:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:38:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:38:57,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-25 15:38:57,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:38:57,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:38:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:38:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -573245985, now seen corresponding path program 3 times [2024-10-25 15:38:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:38:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997377456] [2024-10-25 15:38:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:38:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:38:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:38:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:38:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:38:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997377456] [2024-10-25 15:38:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997377456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:38:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155795889] [2024-10-25 15:38:59,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:38:59,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:38:59,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:38:59,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:38:59,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-25 15:38:59,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 15:38:59,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:38:59,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-25 15:38:59,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:38:59,912 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:38:59,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:38:59,988 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 79 treesize of output 56 [2024-10-25 15:39:00,447 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 79 treesize of output 56 [2024-10-25 15:39:00,693 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-25 15:39:00,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-25 15:39:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 15:39:00,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 15:39:01,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155795889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:01,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:01,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-10-25 15:39:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567867439] [2024-10-25 15:39:01,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:01,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-25 15:39:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:01,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-25 15:39:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2024-10-25 15:39:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:01,163 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:01,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:01,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:01,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:01,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:01,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 15:39:02,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-25 15:39:02,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:02,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:02,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1225207394, now seen corresponding path program 1 times [2024-10-25 15:39:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265594762] [2024-10-25 15:39:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265594762] [2024-10-25 15:39:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265594762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:02,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559295170] [2024-10-25 15:39:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:02,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:02,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:02,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:02,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-25 15:39:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:02,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:39:02,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:02,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559295170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:02,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-25 15:39:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374367955] [2024-10-25 15:39:02,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:39:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:39:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:39:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:02,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:02,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:02,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:02,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-25 15:39:02,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 15:39:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:39:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-25 15:39:03,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:03,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:03,413 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-10-25 15:39:03,418 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-25 15:39:03,427 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:39:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:39:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:03,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:39:03,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-25 15:39:03,432 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:39:03,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:39:03,433 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:39:03,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:39:03,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:39:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1690550556, now seen corresponding path program 1 times [2024-10-25 15:39:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333626216] [2024-10-25 15:39:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333626216] [2024-10-25 15:39:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333626216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:39:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:39:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:39:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634600177] [2024-10-25 15:39:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:39:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:39:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:03,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:39:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:39:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:03,702 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:03,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:03,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-25 15:39:03,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:39:03,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2131028665, now seen corresponding path program 1 times [2024-10-25 15:39:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:03,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85598329] [2024-10-25 15:39:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85598329] [2024-10-25 15:39:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85598329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321417427] [2024-10-25 15:39:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:03,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:03,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-25 15:39:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:03,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:39:03,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:03,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321417427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:03,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:39:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805384559] [2024-10-25 15:39:03,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:39:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:39:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:39:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:03,942 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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) [2024-10-25 15:39:03,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:03,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:03,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-25 15:39:04,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-25 15:39:04,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:39:04,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1246443469, now seen corresponding path program 2 times [2024-10-25 15:39:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418961467] [2024-10-25 15:39:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418961467] [2024-10-25 15:39:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418961467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675292412] [2024-10-25 15:39:04,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:39:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:04,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:04,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:04,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-25 15:39:04,385 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:39:04,385 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:39:04,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:39:04,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:04,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 15:39:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675292412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:04,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:39:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956090089] [2024-10-25 15:39:04,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:39:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:39:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:39:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:04,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:04,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:04,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:04,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:04,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:04,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:04,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:39:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash -543057293, now seen corresponding path program 3 times [2024-10-25 15:39:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297124630] [2024-10-25 15:39:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:39:04,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:39:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:39:04,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:39:04,773 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:39:04,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:39:04,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:39:04,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-25 15:39:04,775 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:39:04,775 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-25 15:39:04,776 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:39:04,776 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-25 15:39:04,795 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-25 15:39:04,802 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:39:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:39:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:04,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:39:04,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-25 15:39:04,810 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:39:04,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-25 15:39:04,812 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:39:04,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:39:06,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -117734180, now seen corresponding path program 1 times [2024-10-25 15:39:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337731209] [2024-10-25 15:39:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 15:39:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337731209] [2024-10-25 15:39:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337731209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:39:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:39:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:39:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900649728] [2024-10-25 15:39:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:39:06,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:39:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:06,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:39:06,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:39:06,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:06,882 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-25 15:39:14,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:14,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1065484084, now seen corresponding path program 1 times [2024-10-25 15:39:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631007708] [2024-10-25 15:39:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631007708] [2024-10-25 15:39:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631007708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158410838] [2024-10-25 15:39:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:14,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-25 15:39:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:14,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:39:14,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:14,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158410838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:14,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:39:14,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798050191] [2024-10-25 15:39:14,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:14,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:39:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:14,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:39:14,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:39:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:14,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:14,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:14,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:14,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:16,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-25 15:39:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-25 15:39:16,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash -707119066, now seen corresponding path program 2 times [2024-10-25 15:39:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369078972] [2024-10-25 15:39:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:16,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369078972] [2024-10-25 15:39:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369078972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102010044] [2024-10-25 15:39:16,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:39:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:16,389 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:16,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-25 15:39:16,504 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:39:16,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:39:16,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:39:16,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:16,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:39:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102010044] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:16,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:39:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204086270] [2024-10-25 15:39:16,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:39:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:39:16,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:39:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:16,573 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:16,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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) [2024-10-25 15:39:16,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:16,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:16,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:17,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:17,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1834433894, now seen corresponding path program 3 times [2024-10-25 15:39:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088406730] [2024-10-25 15:39:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088406730] [2024-10-25 15:39:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088406730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101171537] [2024-10-25 15:39:19,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:39:19,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:19,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:19,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-25 15:39:19,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 15:39:19,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:39:19,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-25 15:39:19,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:19,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:39:19,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:39:19,783 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 79 treesize of output 56 [2024-10-25 15:39:20,185 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 79 treesize of output 56 [2024-10-25 15:39:20,587 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-25 15:39:20,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-25 15:39:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 15:39:20,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:20,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:39:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 2 not checked. [2024-10-25 15:39:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101171537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:21,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-25 15:39:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856669451] [2024-10-25 15:39:21,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:21,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-25 15:39:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-25 15:39:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-10-25 15:39:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:21,025 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:24,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-25 15:39:24,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:24,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash -247776335, now seen corresponding path program 1 times [2024-10-25 15:39:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824283878] [2024-10-25 15:39:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-25 15:39:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824283878] [2024-10-25 15:39:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824283878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:39:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:39:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:39:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024621665] [2024-10-25 15:39:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:39:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:39:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:39:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:39:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:24,466 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:24,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:24,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:24,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:24,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:24,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:24,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:26,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-25 15:39:26,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:26,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1366610943, now seen corresponding path program 1 times [2024-10-25 15:39:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901202921] [2024-10-25 15:39:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901202921] [2024-10-25 15:39:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901202921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940738080] [2024-10-25 15:39:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:29,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:29,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:29,426 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:29,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-25 15:39:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:29,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-25 15:39:29,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:30,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:39:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:39:30,445 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 79 treesize of output 56 [2024-10-25 15:39:30,612 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 [2024-10-25 15:39:30,963 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 79 treesize of output 56 [2024-10-25 15:39:31,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:39:31,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-25 15:39:31,367 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 79 treesize of output 56 [2024-10-25 15:39:31,756 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:39:31,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:39:33,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:39:33,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 553 treesize of output 361 [2024-10-25 15:39:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:39:35,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:35,191 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:39:35,397 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 18 treesize of output 12 [2024-10-25 15:39:35,411 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_562 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_562 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2024-10-25 15:39:35,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_11| Int) (v_ArrVal_562 (Array Int Int))) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_11|) (< |v_t_funThread1of2ForFork0_~i~0#1_11| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_11| 28))) 0))) is different from false [2024-10-25 15:39:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-25 15:39:35,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940738080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:35,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:35,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 10] total 36 [2024-10-25 15:39:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311721924] [2024-10-25 15:39:35,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:35,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-25 15:39:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-25 15:39:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=999, Unknown=3, NotChecked=198, Total=1332 [2024-10-25 15:39:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:35,613 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:35,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:35,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:35,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:35,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:35,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:35,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:35,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-25 15:39:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:45,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-25 15:39:45,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 422182801, now seen corresponding path program 1 times [2024-10-25 15:39:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288824735] [2024-10-25 15:39:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288824735] [2024-10-25 15:39:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288824735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163938079] [2024-10-25 15:39:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:45,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:45,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:45,860 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:45,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-25 15:39:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:46,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 15:39:46,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:46,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:39:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163938079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:39:46,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:39:46,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-25 15:39:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47981025] [2024-10-25 15:39:46,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:39:46,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-25 15:39:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:39:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 15:39:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-25 15:39:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:46,088 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:39:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-25 15:39:46,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:39:47,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-25 15:39:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-25 15:39:48,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:39:48,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:39:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash 993901123, now seen corresponding path program 1 times [2024-10-25 15:39:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:39:48,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457453859] [2024-10-25 15:39:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:39:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:39:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:39:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457453859] [2024-10-25 15:39:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457453859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:39:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875131751] [2024-10-25 15:39:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:39:50,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:39:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:39:50,860 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:39:50,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-25 15:39:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:39:51,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-25 15:39:51,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:39:51,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:39:51,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:39:51,942 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 86 treesize of output 61 [2024-10-25 15:39:52,153 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 86 treesize of output 61 [2024-10-25 15:39:52,398 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 [2024-10-25 15:39:52,745 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 86 treesize of output 61 [2024-10-25 15:39:52,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:39:52,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:39:53,205 INFO L349 Elim1Store]: treesize reduction 154, result has 57.7 percent of original size [2024-10-25 15:39:53,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 55 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 95 treesize of output 252 [2024-10-25 15:39:53,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:39:53,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:39:54,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:39:54,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-25 15:39:55,249 INFO L349 Elim1Store]: treesize reduction 176, result has 40.9 percent of original size [2024-10-25 15:39:55,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 56 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 11 case distinctions, treesize of input 269 treesize of output 287 [2024-10-25 15:39:59,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:39:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 10 case distinctions, treesize of input 554 treesize of output 362 [2024-10-25 15:40:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:40:00,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:00,625 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_770 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_770) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-10-25 15:40:00,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:00,658 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 23 treesize of output 24 [2024-10-25 15:40:00,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:00,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-25 15:40:00,676 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 22 treesize of output 18 [2024-10-25 15:40:00,970 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_15| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_15| 0) (forall ((v_ArrVal_767 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0)) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_15|))) (or (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_15| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_15| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_15|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-25 15:40:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-25 15:40:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875131751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:01,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 11] total 40 [2024-10-25 15:40:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113035014] [2024-10-25 15:40:01,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-25 15:40:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-25 15:40:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1307, Unknown=27, NotChecked=150, Total=1640 [2024-10-25 15:40:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:01,336 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:01,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:01,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:01,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:01,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:01,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:40:01,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:01,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:40:01,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:40:01,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:40:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:40:08,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-25 15:40:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-25 15:40:08,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:40:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash -803001141, now seen corresponding path program 2 times [2024-10-25 15:40:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:08,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809584644] [2024-10-25 15:40:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:08,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:40:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809584644] [2024-10-25 15:40:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809584644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:40:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656441029] [2024-10-25 15:40:11,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:40:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:11,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:40:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-25 15:40:11,855 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:40:11,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:40:11,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-25 15:40:11,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:40:12,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:40:12,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:40:12,685 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 79 treesize of output 56 [2024-10-25 15:40:12,882 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 79 treesize of output 56 [2024-10-25 15:40:13,091 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 [2024-10-25 15:40:13,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:40:13,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:40:13,652 INFO L349 Elim1Store]: treesize reduction 217, result has 34.4 percent of original size [2024-10-25 15:40:13,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 153 [2024-10-25 15:40:13,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:40:13,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:40:14,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:40:14,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:40:14,433 INFO L349 Elim1Store]: treesize reduction 180, result has 51.5 percent of original size [2024-10-25 15:40:14,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 139 treesize of output 264 [2024-10-25 15:40:15,151 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 484 treesize of output 373 [2024-10-25 15:40:16,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:40:16,053 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 484 treesize of output 461 [2024-10-25 15:40:16,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:16,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 485 treesize of output 519 [2024-10-25 15:40:26,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:26,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1040 treesize of output 588 [2024-10-25 15:40:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:40:28,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:29,007 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_879 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_879) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2024-10-25 15:40:29,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:29,151 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 23 treesize of output 24 [2024-10-25 15:40:29,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:40:29,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-25 15:40:29,163 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 22 treesize of output 18 [2024-10-25 15:40:29,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse2 (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))))) (and (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 .cse0 v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|)))) (or (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse2) (or .cse2 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2024-10-25 15:40:29,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))))) (and (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) .cse1 v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|)))) (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2024-10-25 15:40:29,418 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int)) (or (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_17| |v_t_funThread1of2ForFork0_~i~0#1_17|) (< |v_t_funThread2of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_17|))) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|)))) is different from false [2024-10-25 15:40:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-25 15:40:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656441029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:30,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:30,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 12] total 44 [2024-10-25 15:40:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145117925] [2024-10-25 15:40:30,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:30,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-25 15:40:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-25 15:40:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1440, Unknown=22, NotChecked=324, Total=1980 [2024-10-25 15:40:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:30,170 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:30,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:40:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:40:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:40:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:40:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-25 15:40:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-25 15:40:37,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-25 15:40:37,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-25 15:40:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-25 15:40:37,264 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-25 15:40:37,264 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-25 15:40:37,266 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:40:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:37,268 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:40:37,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-25 15:40:37,273 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:40:37,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:40:37,273 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:37,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:40:37,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:37,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash -219783028, now seen corresponding path program 1 times [2024-10-25 15:40:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229200288] [2024-10-25 15:40:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229200288] [2024-10-25 15:40:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229200288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:40:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:40:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:40:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548734808] [2024-10-25 15:40:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:40:37,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:40:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:40:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:40:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:37,751 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:37,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:37,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-25 15:40:38,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1459804062, now seen corresponding path program 1 times [2024-10-25 15:40:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648344800] [2024-10-25 15:40:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:38,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648344800] [2024-10-25 15:40:38,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648344800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:40:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315318323] [2024-10-25 15:40:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:38,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:38,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:38,110 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:40:38,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-25 15:40:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:38,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:40:38,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:40:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315318323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:38,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:38,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:40:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738112875] [2024-10-25 15:40:38,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:38,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:40:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:40:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:40:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:38,266 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:38,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:38,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:38,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:38,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-25 15:40:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:38,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:38,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -575926864, now seen corresponding path program 2 times [2024-10-25 15:40:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789321346] [2024-10-25 15:40:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789321346] [2024-10-25 15:40:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789321346] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:40:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130563039] [2024-10-25 15:40:38,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:40:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:38,581 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:40:38,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-25 15:40:38,718 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:40:38,718 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:40:38,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:40:38,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:40:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:40:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130563039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:38,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:40:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258036484] [2024-10-25 15:40:38,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:38,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:40:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:38,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:40:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:40:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:38,784 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:38,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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) [2024-10-25 15:40:38,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:38,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:38,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:38,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-25 15:40:39,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:39,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:39,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 902803568, now seen corresponding path program 3 times [2024-10-25 15:40:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081874086] [2024-10-25 15:40:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:40:39,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:40:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:40:39,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:40:39,094 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:40:39,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:40:39,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:40:39,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-25 15:40:39,098 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:40:39,098 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-25 15:40:39,098 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:40:39,098 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-25 15:40:39,131 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-25 15:40:39,133 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:39,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:40:39,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:39,136 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:40:39,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-25 15:40:39,139 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:40:39,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:40:39,140 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:39,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:40:39,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:39,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash -960986124, now seen corresponding path program 1 times [2024-10-25 15:40:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:39,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036655565] [2024-10-25 15:40:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036655565] [2024-10-25 15:40:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036655565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:40:40,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:40:40,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:40:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328352973] [2024-10-25 15:40:40,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:40:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:40:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:40:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:40:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:40,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:40,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:40,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:40,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-25 15:40:40,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:40,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash 97974495, now seen corresponding path program 1 times [2024-10-25 15:40:40,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:40,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066321180] [2024-10-25 15:40:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066321180] [2024-10-25 15:40:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066321180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:40:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836951503] [2024-10-25 15:40:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:40,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:40,776 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:40:40,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-25 15:40:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:40,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:40:40,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:40:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:40,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836951503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:40,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:40,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:40:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731100675] [2024-10-25 15:40:40,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:40,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:40:40,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:40,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:40:40,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:40:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:40,924 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:40,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:40,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:40,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:40,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-25 15:40:41,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:41,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1874118272, now seen corresponding path program 2 times [2024-10-25 15:40:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899787265] [2024-10-25 15:40:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899787265] [2024-10-25 15:40:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899787265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:40:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605450635] [2024-10-25 15:40:41,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:40:41,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:40:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:41,241 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:40:41,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-25 15:40:41,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:40:41,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:40:41,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:40:41,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:40:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:41,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:40:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:40:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605450635] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:40:41,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:40:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:40:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431636081] [2024-10-25 15:40:41,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:40:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:40:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:40:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:40:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:41,454 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:41,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:40:41,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:41,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:41,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:40:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:40:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:40:41,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-25 15:40:41,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-25 15:40:41,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:40:41,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1400088032, now seen corresponding path program 3 times [2024-10-25 15:40:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:41,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135407639] [2024-10-25 15:40:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:40:41,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:40:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:40:41,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:40:41,824 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:40:41,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:40:41,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:40:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-25 15:40:41,825 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:40:41,825 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-25 15:40:41,825 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:40:41,825 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-25 15:40:41,861 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-25 15:40:41,864 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:40:41,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:40:41,867 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:40:41,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-10-25 15:40:41,871 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:40:41,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-25 15:40:41,872 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@20ea470f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:40:41,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:40:43,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:40:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:40:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 626551190, now seen corresponding path program 1 times [2024-10-25 15:40:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:40:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439485934] [2024-10-25 15:40:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:40:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:40:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:40:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-25 15:40:43,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:40:43,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439485934] [2024-10-25 15:40:43,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439485934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:40:43,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:40:43,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:40:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721300295] [2024-10-25 15:40:43,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:40:43,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:40:43,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:40:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:40:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:40:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:40:43,181 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:40:43,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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) [2024-10-25 15:40:43,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:41:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:41:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-25 15:41:07,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:41:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:41:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1809594357, now seen corresponding path program 1 times [2024-10-25 15:41:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:41:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796110287] [2024-10-25 15:41:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:41:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:41:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:41:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:08,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:41:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796110287] [2024-10-25 15:41:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796110287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:41:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886755628] [2024-10-25 15:41:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:41:08,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:41:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:41:08,057 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:41:08,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-25 15:41:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:41:08,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:41:08,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:41:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:08,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:41:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886755628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:41:08,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:41:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:41:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285975231] [2024-10-25 15:41:08,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:41:08,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:41:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:41:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:41:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:41:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:41:08,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:41:08,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:41:08,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:41:08,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:41:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:41:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:41:16,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-25 15:41:17,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:41:17,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:41:17,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:41:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash 242927382, now seen corresponding path program 2 times [2024-10-25 15:41:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:41:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545679431] [2024-10-25 15:41:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:41:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:41:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:41:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:41:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545679431] [2024-10-25 15:41:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545679431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:41:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610677094] [2024-10-25 15:41:17,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:41:17,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:41:17,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:41:17,263 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:41:17,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-25 15:41:17,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:41:17,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:41:17,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:41:17,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:41:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:17,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:41:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:41:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610677094] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:41:17,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:41:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:41:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344419373] [2024-10-25 15:41:17,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:41:17,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:41:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:41:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:41:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:41:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:41:17,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:41:17,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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) [2024-10-25 15:41:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:41:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:41:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:41:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:41:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:41:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:41:26,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-25 15:41:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-25 15:41:27,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:41:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:41:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1628555958, now seen corresponding path program 3 times [2024-10-25 15:41:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:41:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418934917] [2024-10-25 15:41:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:41:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:41:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:41:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:41:49,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:41:49,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418934917] [2024-10-25 15:41:49,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418934917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:41:49,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008045328] [2024-10-25 15:41:49,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:41:49,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:41:49,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:41:49,419 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:41:49,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-25 15:41:50,749 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-25 15:41:50,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:41:50,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-10-25 15:41:50,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:41:51,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-25 15:41:51,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:41:51,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:41:51,591 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 100 treesize of output 71 [2024-10-25 15:41:51,861 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-25 15:41:51,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 27 [2024-10-25 15:41:52,396 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 100 treesize of output 71 [2024-10-25 15:41:52,769 INFO L349 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2024-10-25 15:41:52,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 48 [2024-10-25 15:41:53,478 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 100 treesize of output 71 [2024-10-25 15:41:54,005 INFO L349 Elim1Store]: treesize reduction 56, result has 45.1 percent of original size [2024-10-25 15:41:54,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 71 [2024-10-25 15:41:54,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:54,547 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 53 treesize of output 42 [2024-10-25 15:41:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:54,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:54,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:54,825 INFO L349 Elim1Store]: treesize reduction 217, result has 34.4 percent of original size [2024-10-25 15:41:54,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 183 [2024-10-25 15:41:55,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:55,221 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 53 treesize of output 42 [2024-10-25 15:41:56,265 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 147 treesize of output 116 [2024-10-25 15:41:57,028 INFO L349 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2024-10-25 15:41:57,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 62 [2024-10-25 15:41:58,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:58,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:58,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:41:58,245 INFO L349 Elim1Store]: treesize reduction 120, result has 61.4 percent of original size [2024-10-25 15:41:58,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 82 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 150 treesize of output 301 [2024-10-25 15:41:59,405 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-25 15:41:59,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 107 treesize of output 183 [2024-10-25 15:42:00,273 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 152 treesize of output 123 [2024-10-25 15:42:00,847 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-25 15:42:00,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 159 treesize of output 235 [2024-10-25 15:42:07,797 INFO L349 Elim1Store]: treesize reduction 208, result has 40.9 percent of original size [2024-10-25 15:42:07,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 79 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 13 case distinctions, treesize of input 721 treesize of output 489 [2024-10-25 15:43:14,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:14,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:14,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 10 case distinctions, treesize of input 3995 treesize of output 2087 [2024-10-25 15:43:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-25 15:43:19,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:43:20,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:43:20,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:43:20,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:43:20,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2024-10-25 15:43:21,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse5)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse5)) 0))))) is different from false [2024-10-25 15:43:21,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse5)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse5)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0)))) is different from false [2024-10-25 15:43:26,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int) (|t_funThread2of4ForFork0_~p~0#1.base| Int)) (let ((.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (not (= (select (select (store (let ((.cse0 (store |c_#pthreadsMutex| |t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |t_funThread2of4ForFork0_~p~0#1.base|) (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1)))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1))) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse1)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (store (select (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3))) (store (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse1)) 0)))) is different from false [2024-10-25 15:43:29,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:29,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 85 [2024-10-25 15:43:29,740 INFO L349 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2024-10-25 15:43:29,740 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 3 case distinctions, treesize of input 40 treesize of output 42 [2024-10-25 15:43:29,831 INFO L349 Elim1Store]: treesize reduction 57, result has 48.6 percent of original size [2024-10-25 15:43:29,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 106 [2024-10-25 15:43:29,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:29,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2024-10-25 15:43:29,868 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 37 treesize of output 30 [2024-10-25 15:43:29,932 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 8 treesize of output 4 [2024-10-25 15:43:29,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:29,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 108 [2024-10-25 15:43:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 44 refuted. 3 times theorem prover too weak. 21 trivial. 9 not checked. [2024-10-25 15:43:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008045328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:43:41,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:43:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 28] total 71 [2024-10-25 15:43:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080754899] [2024-10-25 15:43:41,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:43:41,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-25 15:43:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:43:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-25 15:43:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3635, Unknown=206, NotChecked=924, Total=5112 [2024-10-25 15:43:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:43:41,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:43:41,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.2083333333333335) internal successors, (231), 71 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:43:41,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:41,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:43:41,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:43:41,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:44:20,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse25 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse35 (select .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse35 1)))) (.cse0 (= (select .cse25 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse21 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse22 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse26 (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse35))) (.cse1 (select |c_#memory_int| 4)) (.cse23 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse24 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse20 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse16 (let ((.cse18 (let ((.cse19 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse17 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18))) (store (store .cse17 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse20)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse21 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse21 .cse22 .cse23 .cse24) (and .cse21 (= (select (store .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse23 .cse24)) .cse22 (= (select .cse26 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse27 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse27)) 0)) (= (select (store (select (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse28 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29))) (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse27)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse26))) (store (store .cse33 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse23 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse24)))) is different from false [2024-10-25 15:44:54,165 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 295 DAG size of output: 239 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:44:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:44:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:44:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:44:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-25 15:44:57,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-10-25 15:44:57,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:44:57,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:44:57,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:44:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 240461887, now seen corresponding path program 1 times [2024-10-25 15:44:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:44:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936766338] [2024-10-25 15:44:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:44:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:44:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:44:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-25 15:44:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:44:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936766338] [2024-10-25 15:44:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936766338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:44:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:44:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:44:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800646873] [2024-10-25 15:44:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:44:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:44:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:44:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:44:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:44:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:44:58,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:44:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:44:58,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:44:58,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:44:58,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:44:58,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-10-25 15:44:58,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-25 15:45:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:05,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-25 15:45:05,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:45:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1813811236, now seen corresponding path program 1 times [2024-10-25 15:45:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679426786] [2024-10-25 15:45:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:45:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679426786] [2024-10-25 15:45:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679426786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066776127] [2024-10-25 15:45:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:06,046 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:06,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-25 15:45:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:06,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:45:06,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:45:06,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:45:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066776127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:06,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-25 15:45:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402207806] [2024-10-25 15:45:06,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:06,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:45:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:45:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:45:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:06,402 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:06,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:06,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:06,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:06,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-10-25 15:45:06,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:06,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:07,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse13 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse15 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse0 (select |c_#memory_int| 4)) (.cse16 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse17 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse2)) 0)))) (<= 0 (+ 9 .cse7)) (or (= (select .cse0 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse8 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse8)) 0)) (= (select (store (select (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse9 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (store (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse8)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 56) 0)) (or (= (select .cse0 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (or (= (select .cse0 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse7 0) (or (= (select .cse0 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 32) 0)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse13 (or (= (select .cse0 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse0 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 60) 0)) (let ((.cse14 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (or (and (= (select .cse14 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse13 .cse15 .cse16 .cse17) (and .cse13 (= (select (store .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse16 .cse17))) .cse15 (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse18 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse18)) 0)) (= (select (store (select (let ((.cse20 (let ((.cse21 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse20))) (store (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse20) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse18)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse0 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse0 196) 0)) .cse16 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse17)) is different from false [2024-10-25 15:45:10,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse27 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse45 (select .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse20 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse45 1)))) (.cse0 (= (select .cse27 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse33 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse36 (store .cse44 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse45))) (.cse34 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse35 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (let ((.cse13 (select |c_#memory_int| 4))) (let ((.cse11 (= (select .cse13 196) 0)) (.cse1 (= (select .cse13 252) 0)) (.cse2 (= (select .cse13 140) 0)) (.cse3 (= (select .cse13 12) 0)) (.cse4 (= (select .cse13 168) 0)) (.cse5 (= (select .cse13 224) 0)) (.cse6 (= (select .cse13 32) 0)) (.cse7 (= (select .cse13 0) 0)) (.cse8 (= (select .cse13 56) 0)) (.cse9 (= (select .cse13 28) 0)) (.cse12 (= (select .cse13 84) 0)) (.cse10 (= (select .cse13 60) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse12) (and (= (select .cse13 112) 0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and (or (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and (or (and (or (and .cse1 .cse3 .cse4 .cse5 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse6 .cse7 .cse8 .cse9) (and .cse2 (or (and .cse6 (or (and .cse1 .cse3 .cse4 .cse5 .cse7 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse9) (and (or (and .cse7 (or (and .cse1 (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse9) (and (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (or (and .cse3 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) .cse4) .cse9)) .cse5))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse3 .cse4 .cse5 .cse9))) (and .cse1 .cse3 .cse4 .cse5 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse9)) .cse8))) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9)))) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)))) .cse12)) .cse10)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse15 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse15)) 0)) (= (select (store (select (let ((.cse17 (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17))) (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse15)) 0)))) (<= 0 (+ 9 .cse20)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse21 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse21)) 0)) (= (select (store (select (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse21)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse20 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse26 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse32 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse28 (let ((.cse30 (let ((.cse31 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse29 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse30))) (store (store .cse29 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse30) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse32)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse32)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse33 (or (and .cse0 .cse33 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse34 .cse35) (and .cse33 (= (select (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse27 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse34 .cse35)) (= (select .cse36 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse37)) 0)) (= (select (store (select (let ((.cse39 (let ((.cse40 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse38 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39))) (store (store .cse38 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse37)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse36))) (store (store .cse43 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse43 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse43 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse34 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse35)))) is different from false [2024-10-25 15:45:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-25 15:45:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:45:12,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-10-25 15:45:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:12,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:45:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -135914044, now seen corresponding path program 1 times [2024-10-25 15:45:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232660058] [2024-10-25 15:45:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:46:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:46:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:46:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232660058] [2024-10-25 15:46:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232660058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:46:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077408786] [2024-10-25 15:46:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:46:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:46:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:46:17,382 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:46:17,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-25 15:46:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:46:17,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-25 15:46:17,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:46:18,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:46:18,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:46:18,959 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 79 treesize of output 56 [2024-10-25 15:46:19,130 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 [2024-10-25 15:46:19,354 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 79 treesize of output 56 [2024-10-25 15:46:19,555 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-25 15:46:19,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-25 15:46:19,877 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 79 treesize of output 56 [2024-10-25 15:46:20,123 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-25 15:46:20,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2024-10-25 15:46:20,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:20,373 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 36 treesize of output 27 [2024-10-25 15:46:20,631 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:20,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:46:21,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:21,012 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 36 treesize of output 27 [2024-10-25 15:46:22,243 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 239 treesize of output 196 [2024-10-25 15:46:23,058 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-10-25 15:46:23,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 25 [2024-10-25 15:46:24,221 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:24,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 248 treesize of output 350 [2024-10-25 15:46:25,162 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 79 treesize of output 56 [2024-10-25 15:46:25,507 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:46:25,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 141 [2024-10-25 15:46:27,064 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:46:27,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 461 treesize of output 340 [2024-10-25 15:46:53,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:46:53,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1895 treesize of output 1103 [2024-10-25 15:46:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:46:58,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:47:02,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:47:03,150 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2024-10-25 15:47:03,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse4 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) is different from false [2024-10-25 15:47:06,037 INFO L349 Elim1Store]: treesize reduction 81, result has 27.7 percent of original size [2024-10-25 15:47:06,037 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 3 case distinctions, treesize of input 51 treesize of output 47 [2024-10-25 15:47:06,091 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-10-25 15:47:06,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 77 [2024-10-25 15:47:06,098 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 25 treesize of output 18 [2024-10-25 15:47:06,217 WARN L851 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse2 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse2) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse2) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse2) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse2)))) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|))) (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse5 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse5) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse5) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse5) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))))) is different from false [2024-10-25 15:47:06,258 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_~#a~0.base|))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse4 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28) |c_~#a~0.offset|))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) .cse4) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse4) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse4) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse4)))) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) is different from false [2024-10-25 15:47:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 55 trivial. 13 not checked. [2024-10-25 15:47:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077408786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:47:07,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:47:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 20] total 61 [2024-10-25 15:47:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438039485] [2024-10-25 15:47:07,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:47:07,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-25 15:47:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:47:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-25 15:47:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2780, Unknown=162, NotChecked=570, Total=3782 [2024-10-25 15:47:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:07,080 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:47:07,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.2903225806451615) internal successors, (204), 61 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:47:07,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:30,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse23 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse33 (select .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse33 1)))) (.cse0 (= (select .cse23 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse19 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse20 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse24 (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse33))) (.cse1 (select |c_#memory_int| 4)) (.cse21 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse22 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse18 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse14 (let ((.cse16 (let ((.cse17 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse15 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16))) (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse18)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse18)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse19 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse19 .cse20 .cse21 .cse22) (and .cse19 (= (select (store .cse23 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse23 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse21 .cse22)) .cse20 (= (select .cse24 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse25 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse25)) 0)) (= (select (store (select (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse26 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27))) (store (store .cse26 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse26 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse25)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24))) (store (store .cse31 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse21 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse22)))) is different from false [2024-10-25 15:47:33,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:37,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse44 (select .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse36 (store .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse44)))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse36)) (.cse35 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse8 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse43 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse44 1)))) (.cse0 (= (select .cse35 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse31 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse32 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (.cse2 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse17 (select .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse1 (select |c_#memory_int| 4)) (.cse33 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse34 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (or (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 28) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse3 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse3)) 0)) (= (select (store (select (let ((.cse5 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse3)) 0)))) (<= 0 (+ 9 .cse8)) (or (= (select .cse1 224) 0) (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse9)) 0)) (= (select (store (select (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11))) (store (store .cse10 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse10 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse9)) 0)))) (or (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 56) 0)) (or (= (select .cse1 140) 0) (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse14 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse2 (+ |c_~#a~0.offset| 4 .cse14)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse14)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= (select .cse1 252) 0) (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= .cse8 0) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608))) (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))) (store .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (or (= (select .cse1 12) 0) (= 12 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse20 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse2 (+ |c_~#a~0.offset| 4 .cse20)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse23 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse24) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse21 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20)) 0)))) (or (= 32 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 32) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse30 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse26 (let ((.cse28 (let ((.cse29 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse27 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse28))) (store (store .cse27 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse28) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse30)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse30)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse31 (or (= (select .cse1 112) 0) (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= (select .cse1 168) 0) (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (= 60 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 60) 0)) (or (and .cse0 .cse31 .cse32 .cse33 .cse34) (and .cse31 (= (select (store .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse33 .cse34)) .cse32 (= (select .cse36 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse37 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse2 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse37)) 0)) (= (select (store (select (let ((.cse39 (let ((.cse40 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse38 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39))) (store (store .cse38 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse37)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (= (select .cse1 0) 0) (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (or (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 84) 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse42 (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse17 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (or (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select .cse1 196) 0)) .cse33 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse34)))))) is different from false [2024-10-25 15:47:42,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:44,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:46,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:49,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:51,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:03,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:16,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:17,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:19,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:21,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:22,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse28 (select .cse27 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse0 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse13 (store .cse27 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse28))) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (<= 0 (+ 9 .cse0)) (<= .cse0 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse1 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ .cse2 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse9 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse6 |c_~#a~0.base| (store (select .cse6 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse9 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse9 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse10 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse1 (+ .cse10 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse11 (let ((.cse12 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse10 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select .cse13 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_~#__global_lock~0.offset| 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (let ((.cse23 (select |c_#memory_int| 4))) (let ((.cse21 (= (select .cse23 196) 0)) (.cse14 (= (select .cse23 252) 0)) (.cse15 (= (select .cse23 168) 0)) (.cse16 (= (select .cse23 224) 0)) (.cse17 (= (select .cse23 0) 0)) (.cse18 (= (select .cse23 112) 0)) (.cse19 (= (select .cse23 56) 0)) (.cse20 (= (select .cse23 28) 0)) (.cse22 (= (select .cse23 84) 0))) (or (and .cse14 .cse15 .cse16 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and (= (select .cse23 140) 0) (or (and (or (and .cse14 .cse15 .cse16 .cse17 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse18 .cse20 .cse22) (and (or (and .cse14 .cse15 .cse16 .cse17 .cse20 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse22) (and .cse18 (or (and (or (and .cse16 (or (and (or (and .cse14 .cse20 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) (and .cse15 (or (and .cse14 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse20)))) .cse17) (and .cse14 .cse15 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse20))) (and .cse14 .cse15 .cse17 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse20)) .cse22) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse14 .cse15 .cse16 .cse17 .cse20)))) .cse19)) .cse21) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse22)))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse29 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse24 (let ((.cse25 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse26 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse27 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse28 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse25 |c_~#a~0.base| (store (select .cse25 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse29 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse29 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse27 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse30 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse1 (+ .cse30 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse31 (let ((.cse32 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse30 |c_~#a~0.offset|)) 0)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2024-10-25 15:48:24,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:26,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:28,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:30,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:33,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:36,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:39,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse53 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse54 (select .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse46 (store .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse54)))) (let ((.cse28 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse46)) (.cse37 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse20 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse53 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse54 1)))) (.cse0 (= (select .cse37 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse43 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse14 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse29 (select .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse44 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse45 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (let ((.cse13 (select |c_#memory_int| 4))) (let ((.cse11 (= (select .cse13 196) 0)) (.cse1 (= (select .cse13 252) 0)) (.cse2 (= (select .cse13 140) 0)) (.cse3 (= (select .cse13 12) 0)) (.cse4 (= (select .cse13 168) 0)) (.cse5 (= (select .cse13 224) 0)) (.cse6 (= (select .cse13 32) 0)) (.cse7 (= (select .cse13 0) 0)) (.cse8 (= (select .cse13 56) 0)) (.cse9 (= (select .cse13 28) 0)) (.cse12 (= (select .cse13 84) 0)) (.cse10 (= (select .cse13 60) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse12) (and (= (select .cse13 112) 0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and (or (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and (or (and (or (and .cse1 .cse3 .cse4 .cse5 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse6 .cse7 .cse8 .cse9) (and .cse2 (or (and .cse6 (or (and .cse1 .cse3 .cse4 .cse5 .cse7 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) .cse9) (and (or (and .cse7 (or (and .cse1 (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) .cse9) (and (or (and .cse3 .cse4 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (and (or (and .cse3 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) .cse4) .cse9)) .cse5))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252)) .cse3 .cse4 .cse5 .cse9))) (and .cse1 .cse3 .cse4 .cse5 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) .cse9)) .cse8))) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9)))) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)))) .cse12)) .cse10)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse15 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse15)) 0)) (= (select (store (select (let ((.cse17 (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17))) (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse15)) 0)))) (<= 0 (+ 9 .cse20)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse21 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse21)) 0)) (= (select (store (select (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse22 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23))) (store (store .cse22 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse22 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse21)) 0)))) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse26 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse14 (+ |c_~#a~0.offset| 4 .cse26)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse27 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse26)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse20 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse30 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse14 (+ |c_~#a~0.offset| 4 .cse30)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse31 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse34 (let ((.cse35 (select .cse33 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse35 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse32 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse34))) (store (store .cse32 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse32 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse33 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse34) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse31 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse30)) 0)))) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse36 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse42 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse38 (let ((.cse40 (let ((.cse41 (select (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse39 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40))) (store (store .cse39 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse39 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse38 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse42)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse42)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse43 (or (and .cse0 .cse43 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse44 .cse45) (and .cse43 (= (select (store .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse37 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse44 .cse45)) (= (select .cse46 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse47 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse14 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse47)) 0)) (= (select (store (select (let ((.cse49 (let ((.cse50 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse51 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse51 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse48 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse49))) (store (store .cse48 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse48 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse49) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse47)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse52 (store (store .cse28 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse28 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse52 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse52 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse44 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse45)))))) is different from false [2024-10-25 15:48:42,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:44,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:46,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:49:13,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse72 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse73 (select .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse65 (store .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse73)))) (let ((.cse15 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse65)) (.cse24 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse7 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse73 1)))) (.cse0 (= (select .cse24 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (.cse62 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse16 (select .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse63 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse64 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and .cse0 (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse2)) 0)))) (<= 0 (+ 9 .cse7)) (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse8 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse8)) 0)) (= (select (store (select (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse9 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (store (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse8)) 0)))) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse13 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse1 (+ |c_~#a~0.offset| 4 .cse13)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse13)) 0)))) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= .cse7 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse17 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (not (= (select .cse1 (+ |c_~#a~0.offset| 4 .cse17)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (= (select (select (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse19 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21))) (store (store .cse19 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610))))))) (store .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse17)) 0)))) (forall ((v_ArrVal_1610 Int) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse23 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (let ((.cse56 (select |c_#memory_int| 4))) (let ((.cse35 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse28 (= (select .cse56 32) 0)) (.cse44 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0))) (.cse25 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252))) (.cse30 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224))) (.cse46 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse41 (= (select .cse56 252) 0)) (.cse26 (= (select .cse56 12) 0)) (.cse27 (= (select .cse56 168) 0)) (.cse33 (= (select .cse56 224) 0)) (.cse29 (= (select .cse56 0) 0)) (.cse31 (= (select .cse56 56) 0)) (.cse32 (= (select .cse56 28) 0))) (let ((.cse34 (= (select .cse56 140) 0)) (.cse49 (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse31 .cse32)) (.cse54 (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse46 .cse32)) (.cse55 (and .cse26 .cse27 .cse30 .cse32)) (.cse47 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (.cse50 (and .cse25 .cse26 .cse27 .cse33 .cse32)) (.cse45 (and .cse41 .cse26 .cse27 .cse33 .cse44 .cse32)) (.cse48 (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32))) (let ((.cse53 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168))) (.cse39 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84))) (.cse40 (or (and .cse34 (or .cse49 (and (or .cse54 (and (or (and (or (and .cse41 (or .cse55 (and .cse26 .cse27 .cse47 .cse33))) .cse50) .cse29) .cse45) .cse31)) .cse28))) .cse48)) (.cse52 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse51 (= (select .cse56 112) 0)) (.cse36 (= (select .cse56 60) 0)) (.cse37 (= (select .cse56 196) 0)) (.cse38 (= (select .cse56 84) 0))) (or (and (let ((.cse43 (or (and .cse41 .cse26 .cse27 .cse30 .cse32) .cse50))) (or (and .cse25 (or (and (or (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse26 .cse27 .cse33 .cse29 .cse31 .cse32)) .cse34) (and .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse36 .cse37 .cse38) (and (or (and .cse39 .cse40 .cse37) (and (or (and (let ((.cse42 (or (and .cse44 .cse31) (and .cse29 .cse46)))) (or (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse42 .cse32) (and .cse34 (or (and .cse28 (or (and .cse43 .cse44 .cse31) (and (or .cse45 (and .cse43 .cse29)) .cse46))) (and .cse41 .cse26 .cse27 .cse33 .cse42 .cse32))))) .cse37) (and .cse47 (or (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31) (and .cse34 (or (and .cse28 (or (and .cse31 (or (and .cse41 .cse26 .cse27 .cse33 .cse44) (and .cse29 (or (and .cse41 .cse26 .cse27 .cse30) (and .cse25 .cse26 .cse27 .cse33))))) (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse46))) (and .cse41 .cse26 .cse27 .cse33 .cse29 .cse31)))) .cse37)) .cse38)) .cse36) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 (or (and (or (and (or (and .cse47 .cse29) (and .cse44 .cse32)) .cse38) (and .cse39 .cse29 .cse32)) .cse31) (and .cse29 .cse46 .cse32 .cse38)) .cse37) (and (or .cse48 (and .cse34 (or .cse49 (and .cse43 .cse28 .cse29 .cse31)))) .cse37 .cse38))) .cse51) (and (or (and (or (and .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38) (and (or (and (or (and .cse41 .cse26 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32) (and .cse34 (or (and (or (and .cse31 (or (and .cse41 .cse26 .cse33 .cse44 .cse32) (and .cse29 (or (and .cse25 .cse26 .cse33 .cse32) (and .cse41 (or (and (or (and .cse26 .cse47) .cse32) .cse33) (and .cse26 .cse30 .cse32))))))) (and .cse41 .cse26 .cse33 .cse29 .cse46 .cse32)) .cse28) (and .cse41 .cse26 .cse33 .cse29 .cse31 .cse32)))) .cse37 .cse38) (and .cse39 .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37)) .cse36)) .cse51) (and .cse41 .cse34 .cse26 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse37 .cse52 .cse38)) .cse53) (and .cse51 .cse30 .cse36 (or (and .cse41 .cse34 .cse26 .cse27 .cse29 .cse31 .cse32) (and .cse41 .cse26 .cse27 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse37 .cse38) (and (or (and (or (and .cse39 .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37) (and (or (and .cse34 (or (and (or (and .cse41 .cse27 .cse33 .cse29 .cse46 .cse32) (and (or (and .cse41 .cse27 .cse33 .cse44 .cse32) (and .cse29 (or (and .cse41 (or (and .cse27 .cse30 .cse32) (and .cse27 .cse47 .cse33))) (and .cse25 .cse27 .cse33 .cse32)))) .cse31)) .cse28) (and .cse41 .cse27 .cse33 .cse29 .cse31 .cse32))) (and .cse41 .cse27 .cse33 .cse35 .cse28 .cse29 .cse31 .cse32)) .cse37 .cse38)) .cse36) (and .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38)) .cse51) (and (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (or (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse52 .cse38) (and (or (and .cse36 (or (and .cse39 .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32) (and (or .cse48 (and .cse34 (or (and .cse28 (or .cse54 (and (or (and .cse29 (or (and .cse41 (or .cse55 (and (or (and .cse26 .cse27 .cse47) (and (or (and .cse26 .cse53) .cse27) .cse32)) .cse33))) .cse50)) .cse45) .cse31))) .cse49))) .cse38))) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse38)) .cse51))) (and (or (and (or (and .cse39 .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37) (and .cse40 .cse37 .cse38)) .cse36) (and .cse41 .cse34 .cse26 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse37 .cse38)) .cse52) (and .cse41 .cse34 .cse27 .cse33 .cse28 .cse29 .cse31 .cse32 .cse36 .cse37 .cse52 .cse38) (and .cse41 .cse26 .cse27 .cse33 .cse35 .cse29 .cse51 .cse31 .cse32 .cse36 .cse37 .cse38)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1610 Int) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse61 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (= (select (select (let ((.cse57 (let ((.cse59 (let ((.cse60 (select (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse58 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse59))) (store (store .cse58 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse58 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse59) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))))) (store .cse57 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse61)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse61)) 0))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse62 (or (and .cse0 .cse62 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) .cse63 .cse64) (and .cse62 (= (select (store .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset| 0) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= (select .cse24 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1) .cse63 .cse64)) (= (select .cse65 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1606 Int) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_9| Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (let ((.cse66 (* |v_t_funThread4of4ForFork0_~i~0#1_9| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_9|) (< |v_t_funThread4of4ForFork0_~i~0#1_9| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1603) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse66)) 0)) (= (select (store (select (let ((.cse68 (let ((.cse69 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1598) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse70 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse70 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse69 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse69 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse67 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse68))) (store (store .cse67 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse67 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1604) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse68) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612) (+ |c_~#a~0.offset| .cse66)) 0)))) (<= 0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) (<= |c_~#__global_lock~0.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1612 Int)) (= (select (select (let ((.cse71 (store (store .cse15 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1606)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1610)))) (store .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse71 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1612))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) .cse63 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse64)))))) is different from false [2024-10-25 15:49:14,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse56 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse61 (select .cse56 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse33 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse46 (store .cse56 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse61))) (.cse50 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse56 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse61 1)))) (.cse34 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (let ((.cse24 (select |c_#memory_int| 4))) (let ((.cse8 (= (select .cse24 168) 0)) (.cse1 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0))) (.cse7 (= (select .cse24 252) 0)) (.cse10 (= (select .cse24 28) 0)) (.cse14 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 168)))) (let ((.cse26 (and .cse7 .cse10 .cse14)) (.cse23 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 28))) (.cse13 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 252))) (.cse25 (and .cse7 .cse8 .cse1 .cse10)) (.cse19 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 84))) (.cse2 (= (select .cse24 224) 0)) (.cse12 (= (select .cse24 0) 0))) (let ((.cse18 (not (= 112 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse22 (and .cse19 .cse7 .cse8 .cse2 .cse12 .cse10)) (.cse20 (or (and (or .cse26 (and .cse8 (or (and .cse7 .cse23) (and .cse13 .cse10)))) .cse12) .cse25)) (.cse6 (= (select .cse24 84) 0)) (.cse3 (= (select .cse24 112) 0)) (.cse5 (or .cse26 (and .cse13 .cse8 .cse10)))) (let ((.cse16 (not (= 196 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse21 (or .cse25 (and .cse12 .cse5))) (.cse17 (or (and .cse7 .cse8 .cse2 .cse12 .cse10 .cse18 .cse6) (and (or .cse22 (and .cse2 .cse20 .cse6)) .cse3))) (.cse4 (= (select .cse24 56) 0)) (.cse15 (not (= 140 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse0 (= (select .cse24 140) 0)) (.cse9 (not (= 56 |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (.cse11 (= (select .cse24 196) 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse9 .cse3 .cse10 .cse6)) .cse11) (and .cse0 (or (and .cse7 .cse2 .cse12 .cse9 .cse3 .cse10 .cse6) (and .cse13 .cse2 .cse12 .cse3 .cse4 .cse10 .cse6)) .cse11 .cse14) (and .cse7 .cse8 .cse2 .cse15 .cse12 .cse3 .cse4 .cse10 .cse16 .cse6) (and .cse0 .cse16 (or (and .cse17 .cse4) (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10 .cse6))) (and (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 224)) (or (and .cse7 .cse8 .cse15 .cse12 .cse3 .cse4 .cse10 .cse11 .cse6) (and (or (and (or (and .cse4 (or (and .cse7 .cse8 .cse12 .cse10 .cse18 .cse6) (and (or (and .cse19 .cse7 .cse8 .cse12 .cse10) (and .cse20 .cse6)) .cse3))) (and .cse7 .cse8 .cse12 .cse9 .cse3 .cse10 .cse6)) .cse11) (and .cse7 .cse8 .cse12 .cse3 .cse4 .cse10 .cse16 .cse6)) .cse0))) (and .cse19 .cse0 (or (and .cse2 .cse3 .cse21 .cse4) (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10)) .cse11) (and .cse0 (or (and .cse7 .cse8 .cse2 .cse12 .cse9 .cse10 .cse6) (and (or (and .cse2 .cse21 .cse6) .cse22) .cse4)) .cse11 .cse18) (and .cse11 (or (and (or (and .cse15 .cse17) (and (or (and .cse7 .cse8 .cse23 .cse2 .cse12 .cse18 .cse6) (and (or (and .cse19 .cse7 .cse8 .cse23 .cse2 .cse12) (and .cse2 (or (and .cse12 (or (and .cse13 .cse8 .cse23) (and .cse7 .cse23 .cse14))) (and .cse7 .cse8 .cse23 .cse1)) .cse6)) .cse3)) .cse0)) .cse4) (and .cse7 (or (and .cse15 .cse10) (and .cse0 .cse23)) .cse8 .cse2 .cse12 .cse9 .cse3 .cse6))) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse9 .cse3 .cse10 .cse11 .cse6))))))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse28 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (let ((.cse27 (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base|) (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1)))) (store .cse27 |c_~#a~0.base| (store (select .cse27 |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1))) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse28 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse29 (let ((.cse30 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse32 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse30 |c_~#a~0.base| (store (select .cse30 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse28 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (<= 0 (+ 9 .cse33)) (<= .cse33 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse35 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse34 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4) 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse35 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse36 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse36 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse36 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032) (+ .cse35 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse42 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse38 (let ((.cse39 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse40 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse39 |c_~#a~0.base| (store (select .cse39 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse42 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse34 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse42 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse43 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse34 (+ .cse43 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse46) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse45 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse45 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse44 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse43 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= (select .cse46 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_~#__global_lock~0.offset| 0) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse51 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (= (select (select (let ((.cse47 (let ((.cse48 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse49 (select (store .cse50 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse49 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse49 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse48 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse48 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse47 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse47 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse51 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse51 |c_~#a~0.offset| 4)) 0))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2026 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse55 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (= (select (select (let ((.cse52 (let ((.cse53 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse54 (select (store .cse50 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse53 |c_~#a~0.base| (store (select .cse53 |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse52 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse52 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse55 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse34 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2026) |c_~#a~0.base|) (+ .cse55 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|)))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse56 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) (forall ((v_ArrVal_2032 Int) (v_ArrVal_2031 Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_13| Int)) (let ((.cse57 (* |v_t_funThread4of4ForFork0_~i~0#1_13| 28))) (or (< |v_t_funThread4of4ForFork0_~i~0#1_13| 0) (not (= (select .cse34 (+ .cse57 |c_~#a~0.offset| 4)) 0)) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_13|) (= (select (select (let ((.cse58 (let ((.cse59 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse60 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2029))) (store .cse59 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse59 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2031))))) (store .cse58 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse58 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2032))) |c_~#a~0.base|) (+ .cse57 |c_~#a~0.offset|)) 0)))) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:49:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:49:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-25 15:49:21,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-25 15:49:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:49:21,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:49:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:49:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 839196724, now seen corresponding path program 4 times [2024-10-25 15:49:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:49:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732086875] [2024-10-25 15:49:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:49:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:49:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:49:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:49:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:49:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732086875] [2024-10-25 15:49:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732086875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:49:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896794924] [2024-10-25 15:49:35,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-25 15:49:35,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:49:35,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:49:35,896 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:49:35,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-25 15:49:37,407 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-25 15:49:37,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:49:37,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-25 15:49:37,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:49:38,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:49:38,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:49:38,483 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 79 treesize of output 56 [2024-10-25 15:49:38,644 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 [2024-10-25 15:49:38,922 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 79 treesize of output 56 [2024-10-25 15:49:39,126 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-25 15:49:39,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-25 15:49:39,462 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 79 treesize of output 56 [2024-10-25 15:49:39,906 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-25 15:49:39,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 45 [2024-10-25 15:49:40,217 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 36 treesize of output 27 [2024-10-25 15:49:40,497 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:49:40,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:49:41,004 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 36 treesize of output 27 [2024-10-25 15:49:42,437 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 239 treesize of output 196 [2024-10-25 15:49:43,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:43,369 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-10-25 15:49:43,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 25 [2024-10-25 15:49:44,685 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:49:44,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 246 treesize of output 261 [2024-10-25 15:49:46,254 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:49:46,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 47 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 322 treesize of output 424 [2024-10-25 15:49:48,119 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 128 treesize of output 103 [2024-10-25 15:49:48,645 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:49:48,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 186 [2024-10-25 15:49:53,442 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:49:53,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 501 treesize of output 380 [2024-10-25 15:50:11,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:50:11,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1708 treesize of output 1016 [2024-10-25 15:50:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:50:13,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:50:13,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:50:13,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:50:13,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 Int) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197)))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201)))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|))) is different from false [2024-10-25 15:50:14,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 Int) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_2195 (Array Int Int))) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (= (select (select (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse2 (store (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (let ((.cse1 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204))) |c_~#a~0.base|) (+ .cse5 |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2195) |c_~#a~0.base|) (+ .cse5 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) is different from false [2024-10-25 15:50:14,720 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 Int) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_2195 (Array Int Int))) (let ((.cse6 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (select (let ((.cse0 (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse2 (store (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (let ((.cse1 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204))) |c_~#a~0.base|) (+ .cse6 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2195) |c_~#a~0.base|) (+ .cse6 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) is different from false [2024-10-25 15:50:25,254 INFO L349 Elim1Store]: treesize reduction 81, result has 33.6 percent of original size [2024-10-25 15:50:25,255 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 4 case distinctions, treesize of input 77 treesize of output 86 [2024-10-25 15:50:25,334 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-10-25 15:50:25,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 126 [2024-10-25 15:50:25,344 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 25 treesize of output 18 [2024-10-25 15:50:25,403 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 12 treesize of output 8 [2024-10-25 15:50:25,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:50:25,425 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 29 treesize of output 29 [2024-10-25 15:50:27,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse10 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse0 (store (select .cse2 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse0) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store .cse2 |c_~#a~0.base| .cse0) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))) .cse4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse5 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse5) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse8 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse9 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse6 (store (select .cse8 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse6) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store .cse8 |c_~#a~0.base| .cse6) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) .cse5) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse5) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse5) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or .cse10 (and (or .cse4 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse13 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse14 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse14 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse11 (store (select .cse13 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse11) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store .cse13 |c_~#a~0.base| .cse11) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse15 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse15) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse18 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse19 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse16 (store (select .cse18 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse16) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse17 (select (store .cse18 |c_~#a~0.base| .cse16) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse17 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) .cse15) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse15) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse15) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse20 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse20) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse23 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse24 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse21 (store (select .cse23 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse21) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse22 (select (store .cse23 |c_~#a~0.base| .cse21) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse22 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) .cse20) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse20) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))))))) (or .cse10 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse25 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse25) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (let ((.cse28 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse29 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196))) (let ((.cse26 (store (select .cse28 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store (store |c_#memory_int| |c_~#a~0.base| .cse26) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse27 (select (store .cse28 |c_~#a~0.base| .cse26) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse27 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse27 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) .cse25) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse25) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))))))) is different from false [2024-10-25 15:50:29,768 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse0 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) .cse0) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse0) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse0) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2197 Int) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2201 Int) (v_ArrVal_2200 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2204 Int) (v_ArrVal_2196 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2190) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2196) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2197))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2200) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2201) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2204) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-25 15:50:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 16 not checked. [2024-10-25 15:50:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896794924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:50:30,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:50:30,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 21] total 65 [2024-10-25 15:50:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009342215] [2024-10-25 15:50:30,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:50:30,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-25 15:50:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:50:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-25 15:50:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3160, Unknown=16, NotChecked=840, Total=4290 [2024-10-25 15:50:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:50:30,786 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:50:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.515151515151515) internal successors, (232), 65 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-25 15:50:30,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:50:43,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:50:46,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:50:59,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:01,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:04,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:07,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:10,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:12,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:15,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:17,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:51:27,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15