./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 12:17:25,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 12:17:25,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 12:17:25,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 12:17:25,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 12:17:26,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 12:17:26,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 12:17:26,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 12:17:26,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 12:17:26,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 12:17:26,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 12:17:26,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 12:17:26,018 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 12:17:26,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 12:17:26,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 12:17:26,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 12:17:26,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 12:17:26,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 12:17:26,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 12:17:26,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 12:17:26,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 12:17:26,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 12:17:26,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 12:17:26,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 12:17:26,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 12:17:26,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 12:17:26,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 12:17:26,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 12:17:26,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 12:17:26,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 12:17:26,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:17:26,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 12:17:26,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 12:17:26,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 12:17:26,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 12:17:26,028 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 12:17:26,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 12:17:26,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 12:17:26,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 12:17:26,030 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 12:17:26,031 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 12:17:26,032 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2024-09-22 12:17:26,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 12:17:26,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 12:17:26,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 12:17:26,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 12:17:26,311 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 12:17:26,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-09-22 12:17:27,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 12:17:28,071 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 12:17:28,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-09-22 12:17:28,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f654fed6c/dd546135e9fd4152b828af147228cfff/FLAG87041c6c1 [2024-09-22 12:17:28,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f654fed6c/dd546135e9fd4152b828af147228cfff [2024-09-22 12:17:28,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 12:17:28,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-22 12:17:28,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 12:17:28,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 12:17:28,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 12:17:28,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:17:28" (1/1) ... [2024-09-22 12:17:28,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f4cd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:28, skipping insertion in model container [2024-09-22 12:17:28,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:17:28" (1/1) ... [2024-09-22 12:17:28,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 12:17:28,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2024-09-22 12:17:28,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:17:28,903 INFO L200 MainTranslator]: Completed pre-run [2024-09-22 12:17:28,985 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2024-09-22 12:17:29,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:17:29,088 INFO L204 MainTranslator]: Completed translation [2024-09-22 12:17:29,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29 WrapperNode [2024-09-22 12:17:29,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 12:17:29,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 12:17:29,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 12:17:29,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 12:17:29,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,153 INFO L138 Inliner]: procedures = 271, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 213 [2024-09-22 12:17:29,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 12:17:29,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 12:17:29,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 12:17:29,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 12:17:29,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 12:17:29,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 12:17:29,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 12:17:29,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 12:17:29,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (1/1) ... [2024-09-22 12:17:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:17:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:29,247 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-09-22 12:17:29,249 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-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-22 12:17:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-22 12:17:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 12:17:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-22 12:17:29,288 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-22 12:17:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 12:17:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 12:17:29,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 12:17:29,290 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 12:17:29,418 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 12:17:29,420 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 12:17:29,712 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 12:17:29,713 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 12:17:29,877 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 12:17:29,877 INFO L318 CfgBuilder]: Removed 23 assume(true) statements. [2024-09-22 12:17:29,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:17:29 BoogieIcfgContainer [2024-09-22 12:17:29,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 12:17:29,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 12:17:29,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 12:17:29,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 12:17:29,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 12:17:28" (1/3) ... [2024-09-22 12:17:29,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783ae4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:17:29, skipping insertion in model container [2024-09-22 12:17:29,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:17:29" (2/3) ... [2024-09-22 12:17:29,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783ae4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:17:29, skipping insertion in model container [2024-09-22 12:17:29,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:17:29" (3/3) ... [2024-09-22 12:17:29,894 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2024-09-22 12:17:29,915 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 12:17:29,915 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-22 12:17:29,916 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 12:17:29,974 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-22 12:17:30,028 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:17:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:30,032 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-09-22 12:17:30,034 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-09-22 12:17:30,087 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:17:30,107 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-22 12:17:30,117 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:30,118 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:17:30,287 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:30,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1947151098, now seen corresponding path program 1 times [2024-09-22 12:17:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295559867] [2024-09-22 12:17:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-22 12:17:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:30,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295559867] [2024-09-22 12:17:30,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295559867] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:17:30,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:17:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:17:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802568370] [2024-09-22 12:17:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:17:30,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:17:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:30,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:17:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:17:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:30,655 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:30,656 INFO L475 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-09-22 12:17:30,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:31,275 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 12:17:31,275 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:31,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1393481553, now seen corresponding path program 1 times [2024-09-22 12:17:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457146714] [2024-09-22 12:17:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457146714] [2024-09-22 12:17:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457146714] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540258471] [2024-09-22 12:17:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:31,491 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-09-22 12:17:31,494 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-09-22 12:17:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:31,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:17:31,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:31,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540258471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:31,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:17:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724062963] [2024-09-22 12:17:31,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:31,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:17:31,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:31,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:17:31,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:17:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:31,661 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:31,661 INFO L475 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-09-22 12:17:31,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:31,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:31,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-22 12:17:32,006 WARN L456 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-09-22 12:17:32,007 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:32,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash -121528289, now seen corresponding path program 2 times [2024-09-22 12:17:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630362682] [2024-09-22 12:17:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:32,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630362682] [2024-09-22 12:17:32,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630362682] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499113112] [2024-09-22 12:17:32,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:17:32,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:32,165 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-09-22 12:17:32,166 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-09-22 12:17:32,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:17:32,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:17:32,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:17:32,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:32,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499113112] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:32,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:17:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923124544] [2024-09-22 12:17:32,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:32,352 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:17:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:17:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:17:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:32,354 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:32,354 INFO L475 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-09-22 12:17:32,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:32,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:32,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:32,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:32,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-22 12:17:32,678 WARN L456 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-09-22 12:17:32,678 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:32,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -346958305, now seen corresponding path program 3 times [2024-09-22 12:17:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734334602] [2024-09-22 12:17:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734334602] [2024-09-22 12:17:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734334602] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621827761] [2024-09-22 12:17:33,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:17:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:33,074 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-09-22 12:17:33,076 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-09-22 12:17:33,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-22 12:17:33,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:17:33,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-22 12:17:33,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:33,213 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 7 treesize of output 6 [2024-09-22 12:17:33,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:17:33,309 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-09-22 12:17:33,335 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 15 treesize of output 10 [2024-09-22 12:17:33,405 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 15 treesize of output 10 [2024-09-22 12:17:33,447 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 39 treesize of output 33 [2024-09-22 12:17:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-22 12:17:33,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:39,539 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#a~0.base|) (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2024-09-22 12:17:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2024-09-22 12:17:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621827761] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:39,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-22 12:17:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648104759] [2024-09-22 12:17:39,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:39,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:17:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:17:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=94, Unknown=2, NotChecked=20, Total=156 [2024-09-22 12:17:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:39,689 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:39,689 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 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-09-22 12:17:39,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:39,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:39,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:39,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-22 12:17:40,278 WARN L456 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-09-22 12:17:40,279 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:40,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1798675042, now seen corresponding path program 1 times [2024-09-22 12:17:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53876514] [2024-09-22 12:17:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53876514] [2024-09-22 12:17:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53876514] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464267831] [2024-09-22 12:17:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:40,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:40,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:40,350 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-09-22 12:17:40,352 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-09-22 12:17:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:40,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:17:40,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:40,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-22 12:17:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-22 12:17:40,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-22 12:17:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464267831] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:17:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-22 12:17:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-09-22 12:17:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142730159] [2024-09-22 12:17:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:17:40,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:17:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:17:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-22 12:17:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:40,467 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:40,467 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-09-22 12:17:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:40,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:40,611 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-09-22 12:17:40,795 WARN L456 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-09-22 12:17:40,795 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:40,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1533527440, now seen corresponding path program 1 times [2024-09-22 12:17:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110941919] [2024-09-22 12:17:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110941919] [2024-09-22 12:17:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110941919] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444767639] [2024-09-22 12:17:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:40,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:40,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:17:40,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-22 12:17:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:40,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:17:40,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:41,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444767639] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:41,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-22 12:17:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74881290] [2024-09-22 12:17:41,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:41,026 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:17:41,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:17:41,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:17:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,028 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:41,028 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:17:41,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:41,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:41,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:41,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 12:17:41,121 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 12:17:41,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-22 12:17:41,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:41,327 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-22 12:17:41,328 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-09-22 12:17:41,333 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:41,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:17:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:41,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:17:41,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-09-22 12:17:41,341 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:17:41,342 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:17:41,342 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:41,342 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:17:41,387 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:17:41,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2015966958, now seen corresponding path program 1 times [2024-09-22 12:17:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020162725] [2024-09-22 12:17:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020162725] [2024-09-22 12:17:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020162725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:17:41,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:17:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:17:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273414331] [2024-09-22 12:17:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:17:41,436 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:17:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:17:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:17:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,437 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:41,437 INFO L475 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-09-22 12:17:41,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,467 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-22 12:17:41,468 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:17:41,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1542578883, now seen corresponding path program 1 times [2024-09-22 12:17:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:41,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432873486] [2024-09-22 12:17:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432873486] [2024-09-22 12:17:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432873486] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501790188] [2024-09-22 12:17:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:41,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:41,511 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-09-22 12:17:41,512 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-09-22 12:17:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:41,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:17:41,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:41,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501790188] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:41,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:17:41,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031630182] [2024-09-22 12:17:41,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:41,622 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:17:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:17:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:17:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,623 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:41,624 INFO L475 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-09-22 12:17:41,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:41,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-22 12:17:41,858 WARN L456 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-09-22 12:17:41,859 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:17:41,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 302486067, now seen corresponding path program 2 times [2024-09-22 12:17:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978798088] [2024-09-22 12:17:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:41,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978798088] [2024-09-22 12:17:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978798088] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803161722] [2024-09-22 12:17:41,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:17:41,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:41,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:17:41,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-22 12:17:42,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:17:42,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:17:42,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:17:42,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:42,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 12:17:42,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803161722] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:42,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:42,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:17:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113725820] [2024-09-22 12:17:42,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:42,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:17:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:42,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:17:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:17:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:42,082 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:42,082 INFO L475 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-09-22 12:17:42,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:42,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:42,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:42,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-22 12:17:42,327 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:42,328 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:17:42,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 287492147, now seen corresponding path program 3 times [2024-09-22 12:17:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:42,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92014581] [2024-09-22 12:17:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:17:42,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:17:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:17:42,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:17:42,388 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:17:42,389 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:17:42,389 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:17:42,389 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-22 12:17:42,391 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:17:42,392 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-09-22 12:17:42,393 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:17:42,393 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-22 12:17:42,420 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-22 12:17:42,424 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:42,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:17:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:42,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:17:42,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-09-22 12:17:42,431 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:17:42,431 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-09-22 12:17:42,432 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:17:42,433 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:17:42,697 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:42,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1880231194, now seen corresponding path program 1 times [2024-09-22 12:17:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249409402] [2024-09-22 12:17:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-22 12:17:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249409402] [2024-09-22 12:17:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249409402] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:17:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:17:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:17:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329124588] [2024-09-22 12:17:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:17:42,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:17:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:17:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:17:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:42,747 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:42,747 INFO L475 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-09-22 12:17:42,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:46,511 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-22 12:17:46,511 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:46,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1923559998, now seen corresponding path program 1 times [2024-09-22 12:17:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776288415] [2024-09-22 12:17:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776288415] [2024-09-22 12:17:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776288415] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:46,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210054266] [2024-09-22 12:17:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:46,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:46,571 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-09-22 12:17:46,573 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-09-22 12:17:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:46,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:17:46,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:46,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210054266] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:46,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:17:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161683964] [2024-09-22 12:17:46,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:46,708 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:17:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:17:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:17:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:46,709 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:46,710 INFO L475 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-09-22 12:17:46,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:46,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:47,907 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-09-22 12:17:48,090 WARN L456 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-09-22 12:17:48,090 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:48,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1413028058, now seen corresponding path program 2 times [2024-09-22 12:17:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586283139] [2024-09-22 12:17:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:48,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586283139] [2024-09-22 12:17:48,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586283139] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980778937] [2024-09-22 12:17:48,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:17:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:48,195 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-09-22 12:17:48,197 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-09-22 12:17:48,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:17:48,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:17:48,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:17:48,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:48,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 12:17:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980778937] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:48,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:17:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964970340] [2024-09-22 12:17:48,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:48,364 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:17:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:17:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:17:48,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:48,365 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:48,366 INFO L475 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-09-22 12:17:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:49,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-22 12:17:49,755 WARN L456 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-09-22 12:17:49,755 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:49,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1263366106, now seen corresponding path program 3 times [2024-09-22 12:17:49,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:49,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392848204] [2024-09-22 12:17:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:17:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392848204] [2024-09-22 12:17:50,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392848204] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:17:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197142080] [2024-09-22 12:17:50,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:17:50,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:17:50,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:17:50,020 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-09-22 12:17:50,022 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-09-22 12:17:50,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-22 12:17:50,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:17:50,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-22 12:17:50,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:17:50,144 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 7 treesize of output 6 [2024-09-22 12:17:50,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:17:50,223 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-09-22 12:17:50,245 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 15 treesize of output 10 [2024-09-22 12:17:50,291 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 15 treesize of output 10 [2024-09-22 12:17:50,390 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 39 treesize of output 33 [2024-09-22 12:17:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-22 12:17:50,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:17:54,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2024-09-22 12:17:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2024-09-22 12:17:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197142080] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:17:54,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:17:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-22 12:17:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928742517] [2024-09-22 12:17:54,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:17:54,573 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:17:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:17:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2024-09-22 12:17:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:54,574 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:54,574 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 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-09-22 12:17:54,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:54,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:54,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:54,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:17:56,092 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-09-22 12:17:56,274 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-22 12:17:56,275 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:56,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1802509125, now seen corresponding path program 1 times [2024-09-22 12:17:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219616229] [2024-09-22 12:17:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:17:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-22 12:17:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:17:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219616229] [2024-09-22 12:17:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219616229] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:17:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:17:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 12:17:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413220811] [2024-09-22 12:17:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:17:56,380 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:17:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:17:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:17:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:17:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:56,383 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:17:56,383 INFO L475 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-09-22 12:17:56,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:56,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:56,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:56,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:17:56,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:17:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:17:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:17:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:17:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:17:57,253 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-22 12:17:57,253 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:17:57,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:17:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 414534591, now seen corresponding path program 1 times [2024-09-22 12:17:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:17:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588734027] [2024-09-22 12:17:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:17:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:17:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:18:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588734027] [2024-09-22 12:18:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588734027] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560232355] [2024-09-22 12:18:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:30,332 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-09-22 12:18:30,333 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-09-22 12:18:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:30,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-22 12:18:30,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:30,451 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 7 treesize of output 6 [2024-09-22 12:18:30,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:18:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:18:30,548 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 15 treesize of output 10 [2024-09-22 12:18:30,597 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 16 treesize of output 12 [2024-09-22 12:18:30,663 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 15 treesize of output 10 [2024-09-22 12:18:30,745 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:18:30,745 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 25 treesize of output 11 [2024-09-22 12:18:30,826 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 15 treesize of output 10 [2024-09-22 12:18:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:18:30,983 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 55 treesize of output 49 [2024-09-22 12:18:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:31,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:31,151 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-09-22 12:18:31,347 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 25 treesize of output 16 [2024-09-22 12:18:31,485 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_665 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_17| |v_t_funThread1of2ForFork0_~i~0#1_17|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |~#a~0.offset|)) 0))) is different from false [2024-09-22 12:18:33,490 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (|~#a~0.offset| Int) (v_ArrVal_665 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |~#a~0.offset|)) 0)) is different from false [2024-09-22 12:18:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-09-22 12:18:33,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560232355] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:33,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 11] total 38 [2024-09-22 12:18:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250363993] [2024-09-22 12:18:33,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:33,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-22 12:18:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-22 12:18:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1095, Unknown=8, NotChecked=210, Total=1482 [2024-09-22 12:18:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:33,616 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:33,616 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 38 states have internal predecessors, (93), 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-09-22 12:18:33,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:33,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:33,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:33,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:33,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:33,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-22 12:18:38,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-22 12:18:38,832 WARN L456 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-09-22 12:18:38,833 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:38,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 628520283, now seen corresponding path program 1 times [2024-09-22 12:18:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:38,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976053667] [2024-09-22 12:18:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976053667] [2024-09-22 12:18:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976053667] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803923625] [2024-09-22 12:18:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:38,911 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-09-22 12:18:38,914 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-09-22 12:18:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:39,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-22 12:18:39,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:39,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:18:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803923625] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:39,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-22 12:18:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664893990] [2024-09-22 12:18:39,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:39,195 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 12:18:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 12:18:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-22 12:18:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:39,195 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:39,196 INFO L475 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-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-22 12:18:39,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:18:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:18:39,811 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-09-22 12:18:39,998 WARN L456 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-09-22 12:18:39,998 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:39,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 508369869, now seen corresponding path program 1 times [2024-09-22 12:18:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329486609] [2024-09-22 12:18:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-22 12:18:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:18:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329486609] [2024-09-22 12:18:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329486609] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:18:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690674576] [2024-09-22 12:18:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:18:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:18:40,430 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-09-22 12:18:40,432 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-09-22 12:18:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:18:40,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-22 12:18:40,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:18:40,582 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 7 treesize of output 6 [2024-09-22 12:18:40,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:18:40,627 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-09-22 12:18:40,639 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 15 treesize of output 10 [2024-09-22 12:18:40,655 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 15 treesize of output 10 [2024-09-22 12:18:40,697 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 15 treesize of output 10 [2024-09-22 12:18:40,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:18:40,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2024-09-22 12:18:40,803 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 39 treesize of output 33 [2024-09-22 12:18:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-22 12:18:40,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:18:44,865 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2024-09-22 12:18:48,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_874 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_874) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2024-09-22 12:18:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 2 not checked. [2024-09-22 12:18:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690674576] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:18:49,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:18:49,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-09-22 12:18:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202811780] [2024-09-22 12:18:49,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:18:49,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-22 12:18:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:18:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-22 12:18:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=181, Unknown=2, NotChecked=58, Total=306 [2024-09-22 12:18:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:49,038 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:18:49,038 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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-09-22 12:18:49,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:18:49,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:18:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:18:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:18:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:18:49,395 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-09-22 12:18:49,582 WARN L456 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-09-22 12:18:49,582 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:18:49,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:18:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash 621309892, now seen corresponding path program 1 times [2024-09-22 12:18:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:18:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041507722] [2024-09-22 12:18:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:18:49,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:18:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:19:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041507722] [2024-09-22 12:19:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041507722] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056722101] [2024-09-22 12:19:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:02,422 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:19:02,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-22 12:19:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:02,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-22 12:19:02,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:02,551 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 7 treesize of output 6 [2024-09-22 12:19:02,633 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:02,633 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-09-22 12:19:02,665 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 15 treesize of output 10 [2024-09-22 12:19:02,744 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 15 treesize of output 10 [2024-09-22 12:19:02,824 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 16 treesize of output 12 [2024-09-22 12:19:02,928 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 15 treesize of output 10 [2024-09-22 12:19:02,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:19:02,993 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 21 treesize of output 16 [2024-09-22 12:19:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:19:03,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:19:03,072 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 21 treesize of output 16 [2024-09-22 12:19:03,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:19:03,131 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 25 treesize of output 11 [2024-09-22 12:19:03,206 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 55 treesize of output 49 [2024-09-22 12:19:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:19:03,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:03,486 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_967 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_967) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0))) is different from false [2024-09-22 12:19:03,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:19:03,519 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-09-22 12:19:03,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:19:03,525 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-09-22 12:19:03,527 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-09-22 12:19:03,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) .cse3) 0)))) (and (or (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse0) (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)))) (or (= .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1))) .cse3) 0))))))) is different from false [2024-09-22 12:19:03,674 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse1 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_23| |v_t_funThread1of2ForFork0_~i~0#1_23|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)))) is different from false [2024-09-22 12:19:05,687 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse1 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0))) is different from false [2024-09-22 12:19:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-09-22 12:19:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056722101] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:05,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 41 [2024-09-22 12:19:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321972127] [2024-09-22 12:19:05,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:05,917 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-22 12:19:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-22 12:19:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1187, Unknown=9, NotChecked=300, Total=1722 [2024-09-22 12:19:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:05,920 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:05,920 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 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-09-22 12:19:05,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:05,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:05,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:19:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:19:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 12:19:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-22 12:19:09,212 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 12:19:09,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-22 12:19:09,412 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:09,416 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-09-22 12:19:09,416 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-09-22 12:19:09,419 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:19:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:09,423 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:19:09,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-09-22 12:19:09,427 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:19:09,427 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:19:09,427 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:09,427 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:19:09,508 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:09,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash 610766412, now seen corresponding path program 1 times [2024-09-22 12:19:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:09,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263797978] [2024-09-22 12:19:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:09,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263797978] [2024-09-22 12:19:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263797978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:19:09,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:19:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:19:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750452470] [2024-09-22 12:19:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:19:09,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:19:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:19:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:19:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:09,538 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:09,538 INFO L475 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-09-22 12:19:09,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:09,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-22 12:19:09,596 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:09,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash -629254622, now seen corresponding path program 1 times [2024-09-22 12:19:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484289827] [2024-09-22 12:19:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484289827] [2024-09-22 12:19:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484289827] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542573853] [2024-09-22 12:19:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:09,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:09,630 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-09-22 12:19:09,631 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-09-22 12:19:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:09,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:19:09,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:09,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542573853] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:09,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:19:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127895711] [2024-09-22 12:19:09,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:09,776 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:19:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:19:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:19:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:09,778 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:09,778 INFO L475 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-09-22 12:19:09,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:09,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:09,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-09-22 12:19:10,021 WARN L456 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-09-22 12:19:10,022 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:10,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -984269254, now seen corresponding path program 2 times [2024-09-22 12:19:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25252832] [2024-09-22 12:19:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25252832] [2024-09-22 12:19:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25252832] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704994604] [2024-09-22 12:19:10,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:19:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:10,085 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:19:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-22 12:19:10,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:19:10,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:19:10,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:19:10,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:10,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 12:19:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704994604] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:10,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:19:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170091047] [2024-09-22 12:19:10,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:10,269 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:19:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:19:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:19:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:10,270 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:10,270 INFO L475 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-09-22 12:19:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:10,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:10,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:10,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-22 12:19:10,512 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-22 12:19:10,513 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:10,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash -639716038, now seen corresponding path program 3 times [2024-09-22 12:19:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198413656] [2024-09-22 12:19:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:19:10,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:19:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:19:10,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:19:10,546 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:19:10,546 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:19:10,546 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:19:10,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-22 12:19:10,547 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:19:10,548 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-09-22 12:19:10,548 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:19:10,548 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-22 12:19:10,587 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-09-22 12:19:10,591 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:10,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:19:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:10,595 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:19:10,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-09-22 12:19:10,598 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:19:10,599 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 12:19:10,599 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:10,599 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-22 12:19:10,705 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:10,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1791461566, now seen corresponding path program 1 times [2024-09-22 12:19:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536616728] [2024-09-22 12:19:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536616728] [2024-09-22 12:19:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536616728] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:19:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:19:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:19:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173544619] [2024-09-22 12:19:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:19:10,739 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:19:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:19:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:19:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:10,740 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:10,740 INFO L475 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-09-22 12:19:10,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:10,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-22 12:19:10,862 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:10,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1199104161, now seen corresponding path program 1 times [2024-09-22 12:19:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253250304] [2024-09-22 12:19:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253250304] [2024-09-22 12:19:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253250304] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80673992] [2024-09-22 12:19:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:10,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:10,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:10,900 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-09-22 12:19:10,902 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-09-22 12:19:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:11,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:19:11,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:11,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80673992] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:11,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:19:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230619716] [2024-09-22 12:19:11,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:11,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:19:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:19:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:19:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:11,052 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:11,052 INFO L475 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-09-22 12:19:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:11,103 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-09-22 12:19:11,291 WARN L456 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-09-22 12:19:11,291 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:11,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1870444982, now seen corresponding path program 2 times [2024-09-22 12:19:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801274835] [2024-09-22 12:19:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801274835] [2024-09-22 12:19:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801274835] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540532031] [2024-09-22 12:19:11,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:19:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:11,390 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:19:11,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-22 12:19:11,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:19:11,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:19:11,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:19:11,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:11,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-22 12:19:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540532031] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:11,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:19:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197771314] [2024-09-22 12:19:11,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:11,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:19:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:19:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:19:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:11,581 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:11,582 INFO L475 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-09-22 12:19:11,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:11,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:11,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:11,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-09-22 12:19:11,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-22 12:19:11,872 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 12:19:11,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1613218262, now seen corresponding path program 3 times [2024-09-22 12:19:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463914146] [2024-09-22 12:19:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:19:11,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 12:19:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 12:19:11,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 12:19:11,944 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 12:19:11,945 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-09-22 12:19:11,945 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-22 12:19:11,945 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-22 12:19:11,946 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-22 12:19:11,947 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-09-22 12:19:11,947 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 12:19:11,947 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-09-22 12:19:11,981 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-09-22 12:19:11,984 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:19:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:11,986 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 12:19:11,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-09-22 12:19:11,989 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:19:11,989 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-09-22 12:19:11,990 INFO L336 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;@7cdd0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:19:11,990 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:19:12,155 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:12,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1966826592, now seen corresponding path program 1 times [2024-09-22 12:19:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:12,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230976481] [2024-09-22 12:19:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-22 12:19:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230976481] [2024-09-22 12:19:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230976481] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:19:12,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:19:12,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:19:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643879587] [2024-09-22 12:19:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:19:12,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:19:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:19:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:19:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:12,202 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:12,202 INFO L475 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-09-22 12:19:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:32,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-22 12:19:32,956 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:32,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1591150591, now seen corresponding path program 1 times [2024-09-22 12:19:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520037018] [2024-09-22 12:19:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520037018] [2024-09-22 12:19:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520037018] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780334547] [2024-09-22 12:19:33,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:33,024 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-09-22 12:19:33,027 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-09-22 12:19:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:33,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:19:33,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:33,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780334547] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:33,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:19:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066357387] [2024-09-22 12:19:33,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:33,256 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:19:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:33,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:19:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:19:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:33,257 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:33,258 INFO L475 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-09-22 12:19:33,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:33,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:42,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-09-22 12:19:42,804 WARN L456 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-09-22 12:19:42,805 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:42,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash -539969258, now seen corresponding path program 2 times [2024-09-22 12:19:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193102402] [2024-09-22 12:19:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193102402] [2024-09-22 12:19:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193102402] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073745146] [2024-09-22 12:19:42,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:19:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:42,902 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-09-22 12:19:42,904 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-09-22 12:19:43,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:19:43,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:19:43,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:19:43,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:19:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:43,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:19:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-22 12:19:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073745146] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:19:43,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:19:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:19:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670347071] [2024-09-22 12:19:43,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:19:43,183 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:19:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:19:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:19:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:19:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:43,184 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:19:43,184 INFO L475 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-09-22 12:19:43,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:43,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:43,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:19:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:19:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:19:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:19:52,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-09-22 12:19:53,085 WARN L456 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-09-22 12:19:53,085 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:19:53,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:19:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash -224911242, now seen corresponding path program 3 times [2024-09-22 12:19:53,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:19:53,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139077025] [2024-09-22 12:19:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:19:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:19:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:19:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:19:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:19:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139077025] [2024-09-22 12:19:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139077025] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:19:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029102684] [2024-09-22 12:19:59,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:19:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:19:59,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:19:59,758 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-09-22 12:19:59,759 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-09-22 12:20:01,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-22 12:20:01,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:20:01,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-22 12:20:01,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:01,598 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 7 treesize of output 6 [2024-09-22 12:20:01,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:20:01,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 12:20:01,776 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 15 treesize of output 10 [2024-09-22 12:20:01,859 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 16 treesize of output 12 [2024-09-22 12:20:01,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 15 treesize of output 10 [2024-09-22 12:20:02,060 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-09-22 12:20:02,061 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 41 treesize of output 35 [2024-09-22 12:20:02,189 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 15 treesize of output 10 [2024-09-22 12:20:02,313 INFO L349 Elim1Store]: treesize reduction 58, result has 36.3 percent of original size [2024-09-22 12:20:02,314 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 53 treesize of output 54 [2024-09-22 12:20:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:02,450 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 45 treesize of output 36 [2024-09-22 12:20:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:20:02,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:02,561 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 45 treesize of output 36 [2024-09-22 12:20:02,748 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 31 treesize of output 26 [2024-09-22 12:20:02,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:02,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:02,891 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-09-22 12:20:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 25 [2024-09-22 12:20:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2024-09-22 12:20:03,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2024-09-22 12:20:03,473 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 45 treesize of output 40 [2024-09-22 12:20:03,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2024-09-22 12:20:03,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-09-22 12:20:04,161 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 111 treesize of output 105 [2024-09-22 12:20:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:04,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:04,345 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-09-22 12:20:04,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-09-22 12:20:04,400 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse5 (select |c_#memory_int| |c_~#a~0.base|)) (.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-09-22 12:20:04,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|)) (.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ .cse7 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1709) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset| 4)) 0))))) is different from false [2024-09-22 12:20:06,263 INFO L349 Elim1Store]: treesize reduction 142, result has 29.7 percent of original size [2024-09-22 12:20:06,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 126 [2024-09-22 12:20:06,341 INFO L349 Elim1Store]: treesize reduction 38, result has 45.7 percent of original size [2024-09-22 12:20:06,342 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 164 treesize of output 162 [2024-09-22 12:20:06,361 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-09-22 12:20:06,428 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-22 12:20:06,428 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 26 treesize of output 12 [2024-09-22 12:20:06,511 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-09-22 12:20:06,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2024-09-22 12:20:08,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse8 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (or .cse0 (and (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= (select (let ((.cse2 (let ((.cse5 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse9 .cse8 (+ (select .cse9 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse7 .cse8 (+ (- 1) (select .cse7 .cse8)))))) (store .cse6 .cse5 (+ (select .cse6 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5)))))) (.cse3 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse10 (let ((.cse13 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse16 .cse8 (+ (select .cse16 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse15 .cse8 (+ (- 1) (select .cse15 .cse8)))))) (store .cse14 .cse13 (+ (select .cse14 .cse13) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) (.cse11 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse24 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse17 (let ((.cse20 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse19 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse21 (let ((.cse22 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse23 .cse8 (+ (select .cse23 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse22 .cse8 (+ (- 1) (select .cse22 .cse8)))))) (store .cse21 .cse20 (+ (select .cse21 .cse20) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse19 .cse20 (+ (- 1) (select .cse19 .cse20)))))) (.cse18 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))) .cse24) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse26 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse25 (let ((.cse28 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse27 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse31 .cse8 (+ (select .cse31 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse30 .cse8 (+ (- 1) (select .cse30 .cse8)))))) (store .cse29 .cse28 (+ (select .cse29 .cse28) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse27 .cse28 (+ (- 1) (select .cse27 .cse28))))))) (store .cse25 .cse26 (+ (select .cse25 .cse26) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse33 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse32 (let ((.cse35 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse34 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse36 (let ((.cse37 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse38 .cse8 (+ (select .cse38 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse37 .cse8 (+ (- 1) (select .cse37 .cse8)))))) (store .cse36 .cse35 (+ (select .cse36 .cse35) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse34 .cse35 (+ (- 1) (select .cse34 .cse35))))))) (store .cse32 .cse33 (+ (select .cse32 .cse33) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (let ((.cse40 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse46 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse39 (let ((.cse42 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse41 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse43 (let ((.cse44 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse45 .cse8 (+ (select .cse45 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse44 .cse8 (+ (- 1) (select .cse44 .cse8)))))) (store .cse43 .cse42 (+ (select .cse43 .cse42) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse41 .cse42 (+ (- 1) (select .cse41 .cse42))))))) (store .cse39 .cse40 (+ (select .cse39 .cse40) 1))) .cse46) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse50 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (let ((.cse48 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse54 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse47 (let ((.cse49 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse51 (let ((.cse52 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse53 .cse8 (+ (select .cse53 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse52 .cse8 (+ (- 1) (select .cse52 .cse8)))))) (store .cse51 .cse50 (+ (select .cse51 .cse50) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse49 .cse50 (+ (- 1) (select .cse49 .cse50)))))) (store .cse47 .cse48 (+ (select .cse47 .cse48) 1))) .cse54) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= .cse48 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))) (= .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse56 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) (.cse58 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse55 (let ((.cse57 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse59 (let ((.cse60 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse61 .cse8 (+ (select .cse61 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse60 .cse8 (+ (- 1) (select .cse60 .cse8)))))) (store .cse59 .cse58 (+ (select .cse59 .cse58) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse57 .cse58 (+ (- 1) (select .cse57 .cse58)))))) (store .cse55 .cse56 (+ (select .cse55 .cse56) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse56 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= .cse58 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (or .cse0 (and (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse65 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse62 (let ((.cse64 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse66 (let ((.cse67 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse68 .cse8 (+ (select .cse68 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse67 .cse8 (+ (- 1) (select .cse67 .cse8)))))) (store .cse66 .cse65 (+ (select .cse66 .cse65) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse64 .cse65 (+ (- 1) (select .cse64 .cse65))))) (.cse63 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse62 .cse63 (+ (select .cse62 .cse63) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))) (= .cse65 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse72 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse69 (let ((.cse71 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse73 (let ((.cse74 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse75 .cse8 (+ (select .cse75 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse74 .cse8 (+ (- 1) (select .cse74 .cse8)))))) (store .cse73 .cse72 (+ (select .cse73 .cse72) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse71 .cse72 (+ (- 1) (select .cse71 .cse72))))) (.cse70 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse69 .cse70 (+ (select .cse69 .cse70) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse76 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= .cse76 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse83 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse77 (let ((.cse79 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse80 (let ((.cse81 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse82 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse82 .cse8 (+ (select .cse82 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse81 .cse8 (+ (- 1) (select .cse81 .cse8)))))) (store .cse80 .cse76 (+ (select .cse80 .cse76) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse79 .cse76 (+ (- 1) (select .cse79 .cse76))))) (.cse78 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse77 .cse78 (+ (select .cse77 .cse78) 1))) .cse83) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse83 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))))))) (or .cse0 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse85 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) (.cse87 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse84 (let ((.cse86 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse88 (let ((.cse89 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse90 .cse8 (+ (select .cse90 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse89 .cse8 (+ (- 1) (select .cse89 .cse8)))))) (store .cse88 .cse87 (+ (select .cse88 .cse87) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse86 .cse87 (+ (- 1) (select .cse86 .cse87)))))) (store .cse84 .cse85 (+ (select .cse84 .cse85) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse85 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse87 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) is different from false [2024-09-22 12:20:10,924 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse8 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (or .cse0 (and (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= (select (let ((.cse2 (let ((.cse5 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse9 .cse8 (+ (select .cse9 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse7 .cse8 (+ (- 1) (select .cse7 .cse8)))))) (store .cse6 .cse5 (+ (select .cse6 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5)))))) (.cse3 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse10 (let ((.cse13 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse16 .cse8 (+ (select .cse16 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse15 .cse8 (+ (- 1) (select .cse15 .cse8)))))) (store .cse14 .cse13 (+ (select .cse14 .cse13) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) (.cse11 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse24 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse17 (let ((.cse20 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse19 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse21 (let ((.cse22 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse23 .cse8 (+ (select .cse23 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse22 .cse8 (+ (- 1) (select .cse22 .cse8)))))) (store .cse21 .cse20 (+ (select .cse21 .cse20) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse19 .cse20 (+ (- 1) (select .cse19 .cse20)))))) (.cse18 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))) .cse24) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse26 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse25 (let ((.cse28 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse27 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse31 .cse8 (+ (select .cse31 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse30 .cse8 (+ (- 1) (select .cse30 .cse8)))))) (store .cse29 .cse28 (+ (select .cse29 .cse28) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse27 .cse28 (+ (- 1) (select .cse27 .cse28))))))) (store .cse25 .cse26 (+ (select .cse25 .cse26) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse33 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse32 (let ((.cse35 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse34 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse36 (let ((.cse37 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse38 .cse8 (+ (select .cse38 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse37 .cse8 (+ (- 1) (select .cse37 .cse8)))))) (store .cse36 .cse35 (+ (select .cse36 .cse35) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse34 .cse35 (+ (- 1) (select .cse34 .cse35))))))) (store .cse32 .cse33 (+ (select .cse32 .cse33) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (let ((.cse40 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse46 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse39 (let ((.cse42 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse41 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse43 (let ((.cse44 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse45 .cse8 (+ (select .cse45 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse44 .cse8 (+ (- 1) (select .cse44 .cse8)))))) (store .cse43 .cse42 (+ (select .cse43 .cse42) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse41 .cse42 (+ (- 1) (select .cse41 .cse42))))))) (store .cse39 .cse40 (+ (select .cse39 .cse40) 1))) .cse46) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse50 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (let ((.cse48 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse54 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse47 (let ((.cse49 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse51 (let ((.cse52 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse53 .cse8 (+ (select .cse53 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse52 .cse8 (+ (- 1) (select .cse52 .cse8)))))) (store .cse51 .cse50 (+ (select .cse51 .cse50) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse49 .cse50 (+ (- 1) (select .cse49 .cse50)))))) (store .cse47 .cse48 (+ (select .cse47 .cse48) 1))) .cse54) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse54 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= .cse48 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))) (= .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse56 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) (.cse58 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse55 (let ((.cse57 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse59 (let ((.cse60 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse61 .cse8 (+ (select .cse61 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse60 .cse8 (+ (- 1) (select .cse60 .cse8)))))) (store .cse59 .cse58 (+ (select .cse59 .cse58) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse57 .cse58 (+ (- 1) (select .cse57 .cse58)))))) (store .cse55 .cse56 (+ (select .cse55 .cse56) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse56 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= .cse58 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (or .cse0 (and (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse65 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse62 (let ((.cse64 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse66 (let ((.cse67 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse68 .cse8 (+ (select .cse68 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse67 .cse8 (+ (- 1) (select .cse67 .cse8)))))) (store .cse66 .cse65 (+ (select .cse66 .cse65) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse64 .cse65 (+ (- 1) (select .cse64 .cse65))))) (.cse63 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse62 .cse63 (+ (select .cse62 .cse63) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))) (= .cse65 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (or .cse1 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse72 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= (select (let ((.cse69 (let ((.cse71 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse73 (let ((.cse74 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse75 .cse8 (+ (select .cse75 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse74 .cse8 (+ (- 1) (select .cse74 .cse8)))))) (store .cse73 .cse72 (+ (select .cse73 .cse72) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse71 .cse72 (+ (- 1) (select .cse71 .cse72))))) (.cse70 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse69 .cse70 (+ (select .cse69 .cse70) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= .cse72 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (let ((.cse76 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= .cse76 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse83 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse77 (let ((.cse79 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse80 (let ((.cse81 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse82 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse82 .cse8 (+ (select .cse82 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse81 .cse8 (+ (- 1) (select .cse81 .cse8)))))) (store .cse80 .cse76 (+ (select .cse80 .cse76) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse79 .cse76 (+ (- 1) (select .cse79 .cse76))))) (.cse78 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse77 .cse78 (+ (select .cse77 .cse78) 1))) .cse83) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse83 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|)))))))) (or .cse0 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (let ((.cse85 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) (.cse87 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse84 (let ((.cse86 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse88 (let ((.cse89 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse90 .cse8 (+ (select .cse90 .cse8) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse89 .cse8 (+ (- 1) (select .cse89 .cse8)))))) (store .cse88 .cse87 (+ (select .cse88 .cse87) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse86 .cse87 (+ (- 1) (select .cse86 .cse87)))))) (store .cse84 .cse85 (+ (select .cse84 .cse85) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= .cse85 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse87 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) is different from true [2024-09-22 12:20:12,996 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread3of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse0 (let ((.cse3 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse7 .cse6 (+ (select .cse7 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6))))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1704 (Array Int Int))) (or (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= (select (let ((.cse8 (let ((.cse11 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse12 (let ((.cse14 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704) |c_~#a~0.base|))) (store .cse15 .cse14 (+ (select .cse15 .cse14) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|))) (store .cse13 .cse14 (+ (- 1) (select .cse13 .cse14))))))) (store .cse12 .cse11 (+ (select .cse12 .cse11) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse10 .cse11 (+ (- 1) (select .cse10 .cse11)))))) (.cse9 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread3of4ForFork0_~i~0#1_15|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:20:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 7 refuted. 5 times theorem prover too weak. 55 trivial. 14 not checked. [2024-09-22 12:20:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029102684] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:14,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19, 21] total 66 [2024-09-22 12:20:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120252432] [2024-09-22 12:20:14,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:14,253 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-09-22 12:20:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-09-22 12:20:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3339, Unknown=23, NotChecked=738, Total=4422 [2024-09-22 12:20:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:14,255 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:14,255 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.462686567164179) internal successors, (232), 66 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-09-22 12:20:14,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:14,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:14,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:14,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-22 12:20:33,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-09-22 12:20:33,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:33,453 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:33,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1907337545, now seen corresponding path program 1 times [2024-09-22 12:20:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960433463] [2024-09-22 12:20:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-22 12:20:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960433463] [2024-09-22 12:20:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960433463] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:20:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:20:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 12:20:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987475267] [2024-09-22 12:20:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:20:33,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:20:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:20:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:20:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:33,573 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:33,574 INFO L475 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-09-22 12:20:33,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:33,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:33,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:33,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-09-22 12:20:33,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-22 12:20:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:41,420 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-22 12:20:41,421 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:41,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1947348964, now seen corresponding path program 1 times [2024-09-22 12:20:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405170707] [2024-09-22 12:20:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405170707] [2024-09-22 12:20:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405170707] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:41,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577666516] [2024-09-22 12:20:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:41,586 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-09-22 12:20:41,587 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-09-22 12:20:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:41,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:20:41,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:41,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:42,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577666516] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:42,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-22 12:20:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004957495] [2024-09-22 12:20:42,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:42,009 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:20:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:20:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:20:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:42,011 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:42,011 INFO L475 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-09-22 12:20:42,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:42,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:42,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:42,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-09-22 12:20:42,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:42,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-22 12:20:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:20:42,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-09-22 12:20:43,081 WARN L456 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-09-22 12:20:43,081 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:20:43,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:20:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1514713480, now seen corresponding path program 1 times [2024-09-22 12:20:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:20:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764124151] [2024-09-22 12:20:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:20:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-22 12:20:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:20:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764124151] [2024-09-22 12:20:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764124151] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:20:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034702016] [2024-09-22 12:20:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:20:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:20:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:20:45,502 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-09-22 12:20:45,505 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-09-22 12:20:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:20:45,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-22 12:20:45,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:20:45,725 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 7 treesize of output 6 [2024-09-22 12:20:45,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:20:45,804 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-09-22 12:20:45,830 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 15 treesize of output 10 [2024-09-22 12:20:45,885 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 16 treesize of output 12 [2024-09-22 12:20:45,949 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 15 treesize of output 10 [2024-09-22 12:20:46,012 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-09-22 12:20:46,012 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 29 treesize of output 28 [2024-09-22 12:20:46,106 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 15 treesize of output 10 [2024-09-22 12:20:46,189 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-09-22 12:20:46,190 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 41 treesize of output 43 [2024-09-22 12:20:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:46,261 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 45 treesize of output 36 [2024-09-22 12:20:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:20:46,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:20:46,329 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 45 treesize of output 36 [2024-09-22 12:20:46,428 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 31 treesize of output 26 [2024-09-22 12:20:46,519 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-09-22 12:20:46,519 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 49 treesize of output 25 [2024-09-22 12:20:46,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2024-09-22 12:20:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2024-09-22 12:20:46,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 77 [2024-09-22 12:20:47,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 152 [2024-09-22 12:20:47,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 173 [2024-09-22 12:20:47,807 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 345 treesize of output 316 [2024-09-22 12:20:48,205 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 369 treesize of output 339 [2024-09-22 12:20:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:20:48,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:20:51,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-09-22 12:20:55,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse0 (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28)) (.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0) 1)) |c_~#__global_lock~0.base| v_ArrVal_2164) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse2 (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_2167)) (.cse3 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |c_~#a~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))) (+ |c_~#a~0.offset| .cse0) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1)) 0)))) is different from false [2024-09-22 12:20:55,596 INFO L349 Elim1Store]: treesize reduction 35, result has 40.7 percent of original size [2024-09-22 12:20:55,596 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 2 case distinctions, treesize of input 49 treesize of output 40 [2024-09-22 12:20:55,621 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2024-09-22 12:20:55,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 57 [2024-09-22 12:20:55,627 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-09-22 12:20:55,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) .cse2 v_ArrVal_2167)) (.cse1 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28)) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_19| |v_t_funThread4of4ForFork0_~i~0#1_19|)))) (or (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse3 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) .cse2 v_ArrVal_2167)) (.cse4 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |c_~#a~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28)) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse5 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28)))) (or (= .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse6 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) .cse2 v_ArrVal_2167)) (.cse7 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |c_~#a~0.offset|))) (store .cse6 .cse7 (select .cse6 .cse7))) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28)) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse5) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_19| |v_t_funThread4of4ForFork0_~i~0#1_19|)))))) is different from false [2024-09-22 12:20:57,695 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread1of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) (+ (* |v_t_funThread1of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|) v_ArrVal_2167)) (.cse1 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_19| |v_t_funThread4of4ForFork0_~i~0#1_19|) (= |v_t_funThread1of4ForFork0_~i~0#1_19| |v_t_funThread4of4ForFork0_~i~0#1_19|))) (or (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread1of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse2 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) (+ (* |v_t_funThread1of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|) v_ArrVal_2167)) (.cse3 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |~#a~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-09-22 12:20:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 55 trivial. 11 not checked. [2024-09-22 12:20:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034702016] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:20:58,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:20:58,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 47 [2024-09-22 12:20:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652375177] [2024-09-22 12:20:58,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:20:58,047 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-22 12:20:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:20:58,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-22 12:20:58,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1582, Unknown=52, NotChecked=348, Total=2256 [2024-09-22 12:20:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:58,049 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:20:58,050 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.791666666666667) internal successors, (230), 47 states have internal predecessors, (230), 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-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:20:58,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:20:59,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) (.cse1 (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (let ((.cse3 (+ |c_~#a~0.offset| .cse1)) (.cse14 (select |c_#memory_int| |c_~#a~0.base|)) (.cse17 (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) (.cse8 (+ |c_~#a~0.offset| .cse6)) (.cse15 (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse4 (select |c_#memory_int| 4)) (.cse0 (select |c_#pthreadsMutex| 4)) (.cse16 (forall ((v_ArrVal_2167 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse18 (store .cse14 (+ |c_~#a~0.offset| .cse17) v_ArrVal_2167))) (store .cse18 .cse3 (select .cse18 .cse3))) .cse8 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse15) 0)))) (and (not (= |c_t_funThread4of4ForFork0_~i~0#1| |c_t_funThread2of4ForFork0_~i~0#1|)) (= (select .cse0 (+ |c_~#a~0.offset| 4 .cse1)) 1) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (= (store .cse2 .cse3 (select .cse4 .cse3)) .cse4) (exists ((|t_funThread1of4ForFork0_~i~0#1| Int)) (and (= (store (let ((.cse5 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse2 .cse5 (select .cse4 .cse5))) .cse3 (+ (select .cse2 .cse3) 1)) .cse4) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread1of4ForFork0_~i~0#1|))))) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |c_t_funThread3of4ForFork0_~i~0#1|)) (= 1 (select .cse0 (+ |c_~#a~0.offset| .cse6 4))) (or (exists ((|t_funThread1of4ForFork0_~i~0#1| Int) (|t_funThread2of4ForFork0_~i~0#1| Int)) (and (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread2of4ForFork0_~i~0#1|)) (= (let ((.cse7 (let ((.cse10 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (store (let ((.cse9 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse2 .cse9 (select .cse4 .cse9))) .cse10 (select .cse2 .cse10))))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) .cse4) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread1of4ForFork0_~i~0#1|)))) (= (store .cse2 .cse8 (select .cse4 .cse8)) .cse4) (exists ((v_prenex_1 Int)) (and (= (let ((.cse11 (let ((.cse12 (+ (* 28 v_prenex_1) |c_~#a~0.offset|))) (store .cse2 .cse12 (select .cse4 .cse12))))) (store .cse11 .cse8 (+ (select .cse11 .cse8) 1))) .cse4) (not (= |c_t_funThread4of4ForFork0_~i~0#1| v_prenex_1))))) (exists ((|t_funThread1of4ForFork0_~i~0#1| Int)) (and (= (let ((.cse13 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse2 .cse13 (select .cse4 .cse13))) .cse4) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread1of4ForFork0_~i~0#1|)))) (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse14 .cse3 (select .cse14 .cse3)) .cse8 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse15) 0)) (or (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) .cse16) (= .cse2 .cse4) (<= |c_~#__global_lock~0.base| 3) (= |c_~#a~0.base| 4) (= (select .cse0 (+ |c_~#a~0.offset| .cse17 4)) 1) .cse16)))) is different from true [2024-09-22 12:21:03,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|)) (.cse3 (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse0 (= (select .cse1 .cse3) 0)) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (and (<= 1 |c_t_funThread4of4ForFork0___VERIFIER_assert_~cond#1|) .cse0 (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 .cse2 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse3) 0)) (let ((.cse4 (= |c_t_funThread4of4ForFork0_~i~0#1| |c_t_funThread3of4ForFork0_~i~0#1|))) (or (and (not .cse4) .cse0) (and (= (select .cse1 .cse2) 1) .cse4))) (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse1 .cse5 (+ (- 1) (select .cse1 .cse5)))) .cse2 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse3) 0))))) is different from false [2024-09-22 12:21:03,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (and (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse2) 0)) (let ((.cse3 (= |c_t_funThread4of4ForFork0_~i~0#1| |c_t_funThread3of4ForFork0_~i~0#1|))) (or (and (not .cse3) (= (select .cse0 .cse2) 0)) (and (= (select .cse0 .cse1) 1) .cse3))))) is different from false [2024-09-22 12:21:15,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:18,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:19,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:20,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:23,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:24,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:27,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:28,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:21:29,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:21:31,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:21:37,628 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 [0, 1] [2024-09-22 12:21:39,675 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 [0, 1] [2024-09-22 12:21:47,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:22:36,151 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-09-22 12:22:38,221 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-09-22 12:22:40,229 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-09-22 12:22:42,303 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-09-22 12:22:44,359 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-09-22 12:22:47,509 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-09-22 12:22:49,554 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-09-22 12:23:18,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:23:37,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 12:24:01,620 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-09-22 12:24:03,625 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-09-22 12:24:05,777 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-09-22 12:24:07,801 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-09-22 12:24:09,849 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-09-22 12:24:11,867 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-09-22 12:24:13,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:24:15,979 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-09-22 12:24:17,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:24:19,493 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-09-22 12:24:36,911 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-09-22 12:24:50,131 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-09-22 12:24:53,180 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-09-22 12:24:55,291 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-09-22 12:25:07,733 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-09-22 12:25:08,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:25:10,826 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-09-22 12:25:12,830 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-09-22 12:25:15,869 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-09-22 12:25:17,930 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-09-22 12:25:19,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 12:25:21,885 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-09-22 12:25:32,205 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-09-22 12:25:34,308 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-09-22 12:25:36,330 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-09-22 12:25:45,490 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-09-22 12:25:47,509 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-09-22 12:25:49,596 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-09-22 12:25:59,788 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-09-22 12:26:01,874 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-09-22 12:26:03,912 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-09-22 12:26:09,861 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (.cse17 (select |c_#memory_int| |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28))) (.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28))) (.cse19 (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse18 (forall ((v_ArrVal_2167 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse22 (store .cse17 .cse5 v_ArrVal_2167))) (store .cse22 .cse16 (select .cse22 .cse16))) .cse7 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse19) 0)))) (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (|v_t_funThread2of4ForFork0_~i~0#1_20| Int) (v_ArrVal_2167 Int) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse1 (* |v_t_funThread3of4ForFork0_~i~0#1_19| 28)) (.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse0 (+ |c_~#a~0.offset| 4 .cse1) 1)) |c_~#__global_lock~0.base| v_ArrVal_2164) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse2 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse3 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2157) |c_~#a~0.base|) .cse5 v_ArrVal_2167)) (.cse4 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_20| 28) |c_~#a~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ |c_~#a~0.offset| .cse1) v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse2)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |c_t_funThread3of4ForFork0_~i~0#1|)) (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse10 (select |c_#memory_int| 4))) (or (exists ((|t_funThread1of4ForFork0_~i~0#1| Int) (|t_funThread2of4ForFork0_~i~0#1| Int)) (and (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread2of4ForFork0_~i~0#1|)) (= (let ((.cse6 (let ((.cse11 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (store (let ((.cse9 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse8 .cse9 (select .cse10 .cse9))) .cse11 (select .cse8 .cse11))))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))) .cse10) (not (= |c_t_funThread4of4ForFork0_~i~0#1| |t_funThread1of4ForFork0_~i~0#1|)))) (= (store .cse8 .cse7 (select .cse10 .cse7)) .cse10) (exists ((v_prenex_1 Int)) (and (= (let ((.cse12 (let ((.cse13 (+ (* 28 v_prenex_1) |c_~#a~0.offset|))) (store .cse8 .cse13 (select .cse10 .cse13))))) (store .cse12 .cse7 (+ (select .cse12 .cse7) 1))) .cse10) (not (= |c_t_funThread4of4ForFork0_~i~0#1| v_prenex_1)))))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2167 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse14 (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) (or (not (= (select .cse0 (+ |c_~#a~0.offset| .cse14 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse15 (store .cse17 .cse5 v_ArrVal_2167))) (store .cse15 .cse16 (select .cse15 .cse16))) .cse7 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse14)) 0)))) (or (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) .cse18) (forall ((v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse17 .cse16 (+ (- 1) (select .cse17 .cse16))) .cse7 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) .cse19) 0)) (= |c_~#a~0.base| 4) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_19| Int) (v_ArrVal_2167 Int) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse20 (* |v_t_funThread4of4ForFork0_~i~0#1_19| 28))) (or (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|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2164) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse21 (store .cse17 .cse5 v_ArrVal_2167))) (store .cse21 .cse16 (select .cse21 .cse16))) .cse7 v_ArrVal_2171)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2173) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse20)) 0)))) .cse18))) is different from true [2024-09-22 12:26:13,277 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-09-22 12:26:15,372 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-09-22 12:26:17,394 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-09-22 12:26:19,424 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-09-22 12:26:25,850 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-09-22 12:26:27,895 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-09-22 12:26:29,899 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-09-22 12:26:31,911 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-09-22 12:26:33,977 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-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:26:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:26:39,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-09-22 12:26:39,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:26:39,695 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:26:39,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:26:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1544458527, now seen corresponding path program 1 times [2024-09-22 12:26:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:26:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460876106] [2024-09-22 12:26:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:26:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:26:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:26:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-09-22 12:26:39,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:26:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460876106] [2024-09-22 12:26:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460876106] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:26:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506735571] [2024-09-22 12:26:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:26:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:26:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:26:39,892 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:26:39,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-09-22 12:26:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:26:40,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-22 12:26:40,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:26:40,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-22 12:26:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:26:40,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-22 12:26:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-09-22 12:26:40,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:26:40,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:26:40,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-22 12:26:40,349 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 33 treesize of output 25 [2024-09-22 12:26:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-09-22 12:26:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506735571] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:26:40,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:26:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-09-22 12:26:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774680280] [2024-09-22 12:26:40,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:26:40,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-22 12:26:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:26:40,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-22 12:26:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2024-09-22 12:26:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:26:40,428 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:26:40,428 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 13 states have internal predecessors, (169), 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-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:26:40,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:27:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:27:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:05,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-09-22 12:27:05,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-09-22 12:27:05,871 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:27:05,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:27:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1741916445, now seen corresponding path program 1 times [2024-09-22 12:27:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:27:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545572414] [2024-09-22 12:27:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:27:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:27:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:27:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-22 12:27:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:27:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545572414] [2024-09-22 12:27:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545572414] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:27:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543535077] [2024-09-22 12:27:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:27:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:27:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:27:07,224 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:27:07,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-09-22 12:27:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:27:07,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-22 12:27:07,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:27:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-22 12:27:07,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:27:07,514 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-09-22 12:27:07,537 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 15 treesize of output 10 [2024-09-22 12:27:07,581 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 16 treesize of output 12 [2024-09-22 12:27:07,644 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 15 treesize of output 10 [2024-09-22 12:27:07,707 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2024-09-22 12:27:07,707 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 35 treesize of output 36 [2024-09-22 12:27:07,816 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 15 treesize of output 10 [2024-09-22 12:27:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:27:07,924 INFO L349 Elim1Store]: treesize reduction 47, result has 31.9 percent of original size [2024-09-22 12:27:07,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2024-09-22 12:27:08,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:27:08,013 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 42 treesize of output 33 [2024-09-22 12:27:08,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:27:08,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:27:08,089 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 42 treesize of output 33 [2024-09-22 12:27:08,214 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 31 treesize of output 26 [2024-09-22 12:27:08,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:27:08,323 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-09-22 12:27:08,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 29 [2024-09-22 12:27:08,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 31 treesize of output 26 [2024-09-22 12:27:08,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2024-09-22 12:27:08,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2024-09-22 12:27:08,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2024-09-22 12:27:08,652 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 109 treesize of output 95 [2024-09-22 12:27:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:27:08,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:27:08,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2458 Int)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2458) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_2461) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)))) is different from false [2024-09-22 12:27:08,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (let ((.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (= (select (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2458) .cse1 v_ArrVal_2461)) (+ |c_~#a~0.offset| .cse2)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2454) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0))))) is different from false [2024-09-22 12:27:09,877 INFO L349 Elim1Store]: treesize reduction 101, result has 25.2 percent of original size [2024-09-22 12:27:09,878 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 4 case distinctions, treesize of input 72 treesize of output 61 [2024-09-22 12:27:09,920 INFO L349 Elim1Store]: treesize reduction 38, result has 48.6 percent of original size [2024-09-22 12:27:09,920 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 68 treesize of output 73 [2024-09-22 12:27:09,926 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-09-22 12:27:09,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (forall ((v_ArrVal_2449 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (let ((.cse2 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28)))) (or (= 0 (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2449) |c_~#a~0.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) v_ArrVal_2458) .cse1 v_ArrVal_2461) .cse2)) (= .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|)))) (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (or (= 0 (select (store (store (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_2449) |c_~#a~0.base|))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) v_ArrVal_2458) .cse1 v_ArrVal_2461) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28)))) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|)))) (or (forall ((v_ArrVal_2449 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (= 0 (select (store (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_2449) |c_~#a~0.base|))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) v_ArrVal_2458) .cse1 v_ArrVal_2461) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2024-09-22 12:27:11,998 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2449 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (or (= |v_t_funThread1of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|) (= (select (let ((.cse1 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2449) |c_~#a~0.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) v_ArrVal_2458) .cse1 v_ArrVal_2461)) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2449 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2461 Int) (v_ArrVal_2456 (Array Int Int)) (|v_t_funThread1of4ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (v_ArrVal_2458 Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse3 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store (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_2449) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2456) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) v_ArrVal_2458) .cse3 v_ArrVal_2461)) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)))) is different from false [2024-09-22 12:27:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 7 refuted. 1 times theorem prover too weak. 55 trivial. 16 not checked. [2024-09-22 12:27:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543535077] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:27:12,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:27:12,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 18] total 42 [2024-09-22 12:27:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684754001] [2024-09-22 12:27:12,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:27:12,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-22 12:27:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:27:12,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-22 12:27:12,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1256, Unknown=25, NotChecked=308, Total=1806 [2024-09-22 12:27:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:27:12,313 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:27:12,314 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.9767441860465116) internal successors, (171), 42 states have internal predecessors, (171), 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-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:12,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:27:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:27:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:27:45,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-09-22 12:27:45,829 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-09-22 12:27:45,830 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:27:45,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:27:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2008592292, now seen corresponding path program 1 times [2024-09-22 12:27:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:27:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816671268] [2024-09-22 12:27:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:27:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:27:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:27:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-09-22 12:27:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:27:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816671268] [2024-09-22 12:27:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816671268] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:27:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62399844] [2024-09-22 12:27:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:27:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:27:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:27:45,996 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:27:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-09-22 12:27:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:27:46,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-22 12:27:46,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:27:46,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-22 12:27:46,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:27:46,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 16 treesize of output 11 [2024-09-22 12:27:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-09-22 12:27:46,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:27:46,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:27:46,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-22 12:27:46,440 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 33 treesize of output 25 [2024-09-22 12:27:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-09-22 12:27:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62399844] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:27:46,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:27:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-09-22 12:27:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092796696] [2024-09-22 12:27:46,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:27:46,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:27:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:27:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:27:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-09-22 12:27:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:27:46,511 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:27:46,512 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 12 states have internal predecessors, (134), 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-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:27:46,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:28:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:28:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:28:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:28:08,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-09-22 12:28:08,291 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-09-22 12:28:08,291 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:28:08,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:28:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1809142697, now seen corresponding path program 1 times [2024-09-22 12:28:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:28:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812311972] [2024-09-22 12:28:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:28:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:28:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:28:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 12:28:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:28:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812311972] [2024-09-22 12:28:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812311972] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:28:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887701194] [2024-09-22 12:28:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:28:18,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:28:18,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:28:18,033 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 12:28:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-09-22 12:28:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:28:18,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-09-22 12:28:18,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:28:18,272 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 7 treesize of output 6 [2024-09-22 12:28:18,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:28:18,369 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-09-22 12:28:18,415 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 15 treesize of output 10 [2024-09-22 12:28:18,484 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 16 treesize of output 12 [2024-09-22 12:28:18,571 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 15 treesize of output 10 [2024-09-22 12:28:18,665 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-09-22 12:28:18,665 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 41 treesize of output 35 [2024-09-22 12:28:18,795 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 15 treesize of output 10 [2024-09-22 12:28:19,190 INFO L349 Elim1Store]: treesize reduction 58, result has 36.3 percent of original size [2024-09-22 12:28:19,190 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 53 treesize of output 54 [2024-09-22 12:28:19,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:28:19,351 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 45 treesize of output 36 [2024-09-22 12:28:19,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:28:19,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:28:19,489 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 45 treesize of output 36 [2024-09-22 12:28:19,677 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 31 treesize of output 26 [2024-09-22 12:28:19,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:28:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:28:19,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 12:28:19,847 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-09-22 12:28:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 25 [2024-09-22 12:28:20,014 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 31 treesize of output 26 [2024-09-22 12:28:20,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2024-09-22 12:28:20,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2024-09-22 12:28:20,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2024-09-22 12:28:20,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2024-09-22 12:28:23,245 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 115 treesize of output 101 [2024-09-22 12:28:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:28:23,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:28:24,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (v_ArrVal_2770 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2770) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (let ((.cse1 (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2774) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_2777)) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2024-09-22 12:28:24,112 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (v_ArrVal_2770 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2770) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (let ((.cse1 (let ((.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2774) .cse4 v_ArrVal_2777))) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2024-09-22 12:28:25,097 INFO L349 Elim1Store]: treesize reduction 142, result has 29.7 percent of original size [2024-09-22 12:28:25,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 126 [2024-09-22 12:28:25,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:28:25,120 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 116 treesize of output 118 [2024-09-22 12:28:25,129 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 32 treesize of output 25 [2024-09-22 12:28:25,153 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-22 12:28:25,153 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 26 treesize of output 12 [2024-09-22 12:28:25,179 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-09-22 12:28:25,209 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-09-22 12:28:25,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2024-09-22 12:28:25,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 12:28:25,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 12:28:25,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 78 [2024-09-22 12:28:27,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse10 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (or .cse0 (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28))) (.cse5 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= .cse1 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= (select (let ((.cse2 (store (store (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_2765) |c_~#a~0.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) .cse5 v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0) (= .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|))))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse6 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28))) (.cse9 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= (select (let ((.cse7 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) .cse9 v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse7 .cse6 (+ (select .cse7 .cse6) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0) (= .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) .cse10) (or .cse0 (and (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= (select (let ((.cse11 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse13 .cse4 (+ (select .cse13 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777)) (.cse12 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0))) .cse10) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int)) (let ((.cse15 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (or (forall ((v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse17 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= (select (let ((.cse14 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse16 .cse4 (+ (select .cse16 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) .cse17 v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0) (= .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|)))) (= .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse18 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= (select (let ((.cse19 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777)) (.cse20 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1))) .cse18) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (or (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= (select (let ((.cse22 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse24 .cse4 (+ (select .cse24 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777)) (.cse23 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (store .cse22 .cse23 (+ (select .cse22 .cse23) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|))) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|))))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int)) (let ((.cse25 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (or (= .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (let ((.cse29 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse26 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= .cse26 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= (select (let ((.cse27 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse28 .cse4 (+ (select .cse28 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) .cse29 v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse27 .cse25 (+ (select .cse27 .cse25) 1))) .cse26) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (or .cse0 (and (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int)) (let ((.cse30 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (or (= .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (or (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= (select (let ((.cse31 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse32 .cse4 (+ (select .cse32 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse31 .cse30 (+ (select .cse31 .cse30) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|))) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|)))))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse33 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (or (= .cse33 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= (select (let ((.cse34 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse35 .cse4 (+ (select .cse35 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse34 .cse33 (+ (select .cse34 .cse33) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|)) 0)))) .cse10) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int)) (let ((.cse36 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28)))) (or (= .cse36 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (let ((.cse37 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|))) (or (= .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= (select (let ((.cse38 (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse39 .cse4 (+ (select .cse39 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |c_~#a~0.offset|) v_ArrVal_2774) .cse4 v_ArrVal_2777))) (store .cse38 .cse36 (+ (select .cse38 .cse36) 1))) .cse37) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|)))) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|)))))))))) is different from false [2024-09-22 12:28:29,950 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (|v_t_funThread1of4ForFork0_~i~0#1_27| Int) (v_ArrVal_2765 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_27| Int) (|~#a~0.offset| Int) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (or (= (select (let ((.cse0 (let ((.cse3 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|))) (store (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_2765) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|) v_ArrVal_2774) .cse3 v_ArrVal_2777))) (.cse1 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of4ForFork0_~i~0#1_27| |v_t_funThread3of4ForFork0_~i~0#1_27|) (= |v_t_funThread1of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|)))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_27| Int) (|v_t_funThread1of4ForFork0_~i~0#1_27| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_27| Int)) (or (forall ((v_ArrVal_2765 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2774 Int) (v_ArrVal_2777 Int) (|v_t_funThread4of4ForFork0_~i~0#1_27| Int)) (or (= (select (let ((.cse4 (let ((.cse7 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|))) (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2765) |c_~#a~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2772) |c_~#a~0.base|) (+ (* |v_t_funThread3of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|) v_ArrVal_2774) .cse7 v_ArrVal_2777))) (.cse5 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_27| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= |v_t_funThread1of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread4of4ForFork0_~i~0#1_27|))) (= |v_t_funThread1of4ForFork0_~i~0#1_27| |v_t_funThread3of4ForFork0_~i~0#1_27|) (= |v_t_funThread3of4ForFork0_~i~0#1_27| |v_t_funThread2of4ForFork0_~i~0#1_27|)))))) is different from false [2024-09-22 12:28:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 55 trivial. 11 not checked. [2024-09-22 12:28:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887701194] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:28:30,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:28:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 19] total 64 [2024-09-22 12:28:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014199877] [2024-09-22 12:28:30,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:28:30,856 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-09-22 12:28:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:28:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-09-22 12:28:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3372, Unknown=19, NotChecked=484, Total=4160 [2024-09-22 12:28:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:28:30,858 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:28:30,858 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.276923076923077) internal successors, (213), 64 states have internal predecessors, (213), 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-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:28:30,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-22 12:28:30,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 12:28:30,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:28:43,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]