/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 06:32:09,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 06:32:09,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 06:32:09,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 06:32:09,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 06:32:09,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 06:32:09,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 06:32:09,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 06:32:09,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 06:32:09,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 06:32:09,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 06:32:09,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 06:32:09,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 06:32:09,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 06:32:09,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 06:32:09,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 06:32:09,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 06:32:09,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 06:32:09,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 06:32:09,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 06:32:09,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 06:32:09,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 06:32:09,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 06:32:09,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 06:32:09,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 06:32:09,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 06:32:09,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 06:32:09,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 06:32:09,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 06:32:09,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 06:32:09,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 06:32:09,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 06:32:09,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 06:32:09,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 06:32:09,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 06:32:09,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 06:32:09,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 06:32:09,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 06:32:09,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 06:32:09,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 06:32:09,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 06:32:09,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 06:32:09,253 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 06:32:09,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 06:32:09,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 06:32:09,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 06:32:09,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 06:32:09,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 06:32:09,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 06:32:09,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 06:32:09,256 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 06:32:09,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 06:32:09,257 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 06:32:09,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 06:32:09,258 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 06:32:09,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 06:32:09,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 06:32:09,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 06:32:09,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 06:32:09,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 06:32:09,260 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 06:32:09,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 06:32:09,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 06:32:09,261 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 06:32:09,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 06:32:09,261 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 06:32:09,261 INFO L138 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/UAutomizer-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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 06:32:09,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 06:32:09,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 06:32:09,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 06:32:09,473 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 06:32:09,474 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 06:32:09,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2023-05-04 06:32:09,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dba25dba/a3faa5a61d5a499392ef0dd56eab69ac/FLAGca01db2a6 [2023-05-04 06:32:09,867 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 06:32:09,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2023-05-04 06:32:09,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dba25dba/a3faa5a61d5a499392ef0dd56eab69ac/FLAGca01db2a6 [2023-05-04 06:32:09,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dba25dba/a3faa5a61d5a499392ef0dd56eab69ac [2023-05-04 06:32:09,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 06:32:09,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 06:32:09,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 06:32:09,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 06:32:09,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 06:32:09,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:32:09" (1/1) ... [2023-05-04 06:32:09,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707baf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:09, skipping insertion in model container [2023-05-04 06:32:09,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:32:09" (1/1) ... [2023-05-04 06:32:09,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 06:32:09,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 06:32:10,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2023-05-04 06:32:10,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 06:32:10,157 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 06:32:10,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2023-05-04 06:32:10,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 06:32:10,210 INFO L208 MainTranslator]: Completed translation [2023-05-04 06:32:10,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10 WrapperNode [2023-05-04 06:32:10,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 06:32:10,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 06:32:10,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 06:32:10,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 06:32:10,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,263 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2023-05-04 06:32:10,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 06:32:10,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 06:32:10,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 06:32:10,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 06:32:10,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 06:32:10,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 06:32:10,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 06:32:10,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 06:32:10,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (1/1) ... [2023-05-04 06:32:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 06:32:10,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:10,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 06:32:10,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 06:32:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 06:32:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 06:32:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 06:32:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 06:32:10,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 06:32:10,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 06:32:10,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 06:32:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 06:32:10,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 06:32:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 06:32:10,396 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 06:32:10,484 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 06:32:10,485 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 06:32:10,811 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 06:32:10,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 06:32:10,935 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-04 06:32:10,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:32:10 BoogieIcfgContainer [2023-05-04 06:32:10,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 06:32:10,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 06:32:10,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 06:32:10,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 06:32:10,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 06:32:09" (1/3) ... [2023-05-04 06:32:10,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4754fb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:32:10, skipping insertion in model container [2023-05-04 06:32:10,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:32:10" (2/3) ... [2023-05-04 06:32:10,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4754fb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:32:10, skipping insertion in model container [2023-05-04 06:32:10,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:32:10" (3/3) ... [2023-05-04 06:32:10,945 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2023-05-04 06:32:10,952 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 06:32:10,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 06:32:10,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 06:32:10,963 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 06:32:11,053 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 06:32:11,094 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 06:32:11,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 06:32:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:11,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 06:32:11,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 06:32:11,145 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 06:32:11,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 06:32:11,165 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5365ffae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 06:32:11,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 06:32:11,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash -79636629, now seen corresponding path program 1 times [2023-05-04 06:32:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975580059] [2023-05-04 06:32:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 06:32:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975580059] [2023-05-04 06:32:11,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975580059] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:32:11,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:32:11,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 06:32:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868233057] [2023-05-04 06:32:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:32:11,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 06:32:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:32:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 06:32:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 06:32:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:11,769 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:32:11,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 06:32:11,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 06:32:11,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1702339689, now seen corresponding path program 1 times [2023-05-04 06:32:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:11,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229373772] [2023-05-04 06:32:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-05-04 06:32:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229373772] [2023-05-04 06:32:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229373772] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:32:12,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:32:12,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 06:32:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179568688] [2023-05-04 06:32:12,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:32:12,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 06:32:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:32:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 06:32:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 06:32:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:12,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:32:12,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 06:32:12,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:12,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:12,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 06:32:12,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -36627128, now seen corresponding path program 1 times [2023-05-04 06:32:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329734101] [2023-05-04 06:32:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329734101] [2023-05-04 06:32:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329734101] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:32:12,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68414368] [2023-05-04 06:32:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:12,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:12,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:12,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 06:32:12,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 06:32:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:12,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 06:32:12,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:32:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 06:32:13,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:32:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 06:32:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68414368] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:32:13,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:32:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2023-05-04 06:32:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444816890] [2023-05-04 06:32:13,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:32:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-05-04 06:32:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:32:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-05-04 06:32:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2023-05-04 06:32:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:13,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:32:13,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 06:32:13,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:13,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:13,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 06:32:13,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 06:32:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 06:32:14,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1989877349, now seen corresponding path program 1 times [2023-05-04 06:32:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174077012] [2023-05-04 06:32:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:14,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174077012] [2023-05-04 06:32:14,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174077012] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:32:14,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228137194] [2023-05-04 06:32:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:14,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:14,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 06:32:14,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 06:32:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:14,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-04 06:32:14,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:32:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:15,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:32:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:15,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228137194] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:32:15,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:32:15,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 38 [2023-05-04 06:32:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242329527] [2023-05-04 06:32:15,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:32:15,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-04 06:32:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:32:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-04 06:32:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2023-05-04 06:32:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:15,492 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:32:15,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.657894736842105) internal successors, (291), 38 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 06:32:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 06:32:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 06:32:16,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-04 06:32:16,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 06:32:16,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:16,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2080482226, now seen corresponding path program 2 times [2023-05-04 06:32:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824511439] [2023-05-04 06:32:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824511439] [2023-05-04 06:32:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824511439] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:32:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631092970] [2023-05-04 06:32:17,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 06:32:17,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:17,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 06:32:17,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 06:32:17,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 06:32:17,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:32:17,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 06:32:17,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:32:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:17,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:32:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:32:18,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631092970] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:32:18,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:32:18,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2023-05-04 06:32:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696105703] [2023-05-04 06:32:18,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:32:18,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 06:32:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:32:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 06:32:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2023-05-04 06:32:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:18,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:32:18,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.4324324324324325) internal successors, (238), 37 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 06:32:18,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:18,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:18,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 06:32:18,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-04 06:32:18,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:32:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:32:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 06:32:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-04 06:32:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 06:32:18,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 06:32:19,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:19,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 06:32:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:32:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 268008350, now seen corresponding path program 3 times [2023-05-04 06:32:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:32:19,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171051405] [2023-05-04 06:32:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:32:19,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:32:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:32:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:32:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:32:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171051405] [2023-05-04 06:32:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171051405] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:32:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716918450] [2023-05-04 06:32:25,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 06:32:25,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:32:25,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:32:25,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 06:32:25,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 06:32:26,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-04 06:32:26,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:32:26,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 148 conjunts are in the unsatisfiable core [2023-05-04 06:32:26,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:32:27,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 06:32:28,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2023-05-04 06:32:28,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:28,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2023-05-04 06:32:29,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:29,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2023-05-04 06:32:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:31,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:31,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:31,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:31,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 06:32:31,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 06:32:31,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 107 [2023-05-04 06:32:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:32:31,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:32:35,084 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ |c_thread1Thread1of1ForFork2_#t~post1#1| 1) c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* 4 |c_thread1Thread1of1ForFork2_#t~post1#1|) 4)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~M~0 1))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse0 .cse2))) (+ c_~res1~0 (select .cse0 .cse3) 1))) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< .cse4 |v_thread3Thread1of1ForFork1_~i~2#1_27|) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (+ c_~res1~0 (select .cse5 .cse3)) (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse6)) (select .cse5 (+ c_~A~0.offset .cse6 4)) (select .cse5 .cse2))))) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< .cse4 |v_thread3Thread1of1ForFork1_~i~2#1_27|) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0))))) (< (+ 2 |c_thread1Thread1of1ForFork2_#t~post1#1|) c_~N~0)) is different from false [2023-05-04 06:32:35,530 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse5 (+ c_~M~0 1))) (and (forall ((|thread1Thread1of1ForFork2_~i~0#1| Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse1 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse2 (+ c_~A~0.offset .cse1)))) (let ((.cse3 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse3)) (select .cse0 (+ c_~A~0.offset .cse3 4)) (select .cse0 .cse4))))) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< .cse5 |v_thread3Thread1of1ForFork1_~i~2#1_27|) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0))) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0))) (forall ((|thread1Thread1of1ForFork2_~i~0#1| Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse7 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse6 (+ c_~A~0.offset .cse7 4)) (select .cse6 .cse4))) (let ((.cse8 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse6 (+ c_~A~0.offset .cse8 4)) (select .cse2 (+ c_~A~0.offset .cse8)) 1)))) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< .cse5 |v_thread3Thread1of1ForFork1_~i~2#1_27|) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0))) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0))))) is different from false [2023-05-04 06:32:35,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((~M~0 Int)) (or (< |c_thread2Thread1of1ForFork0_~i~1#1| ~M~0) (forall ((|thread1Thread1of1ForFork2_~i~0#1| Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse1 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse2 (+ c_~A~0.offset .cse1)))) (let ((.cse3 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse3)) (select .cse0 (+ c_~A~0.offset .cse3 4)))))) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0))) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0))))) (forall ((~M~0 Int)) (or (< |c_thread2Thread1of1ForFork0_~i~1#1| ~M~0) (forall ((|thread1Thread1of1ForFork2_~i~0#1| Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int))) (or (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse5 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset .cse5 4)))) (let ((.cse6 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse4 (+ c_~A~0.offset .cse6 4)) (select .cse2 (+ c_~A~0.offset .cse6)) 1)))))))))))) is different from false [2023-05-04 06:32:36,881 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (|thread1Thread1of1ForFork2_~i~0#1| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (let ((.cse3 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) c_~res1~0 (select .cse0 (+ c_~A~0.offset .cse3 4)) 1))))))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (|thread1Thread1of1ForFork2_~i~0#1| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (or (not (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 2) c_~N~0) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse6 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse5 (* |thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)) c_~res1~0 (select .cse6 (+ c_~A~0.offset .cse5 4)))) (let ((.cse7 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse6 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse7 4)))))))))) is different from false [2023-05-04 06:32:37,194 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))))) (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_subst_2 Int)) (or (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (let ((.cse3 (* 4 v_subst_2))) (+ .cse2 c_~res1~0 (select .cse0 (+ c_~A~0.offset .cse3 4)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse3)) 1))))) (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (or (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse7 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse6 (* 4 v_subst_1))) (+ .cse2 c_~res1~0 (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse6)) (select .cse7 (+ c_~A~0.offset .cse6 4)))) (let ((.cse8 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse7 (+ c_~A~0.offset .cse8)) (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse7 (+ c_~A~0.offset .cse8 4))))))) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0))))) is different from false [2023-05-04 06:32:37,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse3 (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse2 (* 4 v_subst_1))) (+ .cse0 c_~res1~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) (select .cse3 (+ c_~A~0.offset .cse2 4)))) (let ((.cse4 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse3 (+ c_~A~0.offset .cse4)) (select .cse3 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse3 (+ c_~A~0.offset .cse4 4))))))) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_subst_2 Int)) (or (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse5 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse5 (+ c_~A~0.offset .cse6)) (select .cse5 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (let ((.cse7 (* 4 v_subst_2))) (+ .cse0 c_~res1~0 (select .cse5 (+ c_~A~0.offset .cse7 4)) (select (select .cse8 c_~A~0.base) (+ c_~A~0.offset .cse7)) 1))))))))) is different from false [2023-05-04 06:32:37,564 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_1 Int)) (or (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (<= (let ((.cse1 (* 4 v_subst_1))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~res1~0 (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse4 4)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse4)) (select .cse0 (+ c_~A~0.offset (* ~M~0 4))))))))))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_2 Int)) (or (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (< (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse5 (+ c_~A~0.offset .cse6 4)) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse6)) (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse8 (* 4 v_subst_2))) (+ (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset .cse8)) c_~res1~0 (select .cse5 (+ c_~A~0.offset .cse8 4)) (select (select .cse9 c_~A~0.base) c_~A~0.offset) 1)))))) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0)))) is different from false [2023-05-04 06:32:38,191 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_2 Int)) (or (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (< (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (let ((.cse3 (* 4 v_subst_2))) (+ (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3)) (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3 4)) 1)))))) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_1 Int)) (or (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse8 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (<= (let ((.cse7 (* 4 v_subst_1))) (+ (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ .cse7 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res1~0 (select .cse8 (+ .cse7 |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)))) (let ((.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse8 (+ .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (select .cse8 (+ .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) (select .cse8 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))))) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0)))) is different from false [2023-05-04 06:32:38,313 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_1 Int)) (or (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse3 (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (<= (let ((.cse2 (* 4 v_subst_1))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse4 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~res2~0 (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_2 Int)) (or (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse5 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~res2~0 (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse7 (* 4 v_subst_2))) (+ (select .cse5 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0 1))))))))) is different from false [2023-05-04 06:32:38,377 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_1 Int)) (or (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (let ((.cse1 (* 4 v_subst_1))) (+ (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res1~0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse0 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (select .cse0 (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (not (< (+ v_subst_1 1) c_~N~0)) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_1) c_~N~0))) (forall ((v_ArrVal_180 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_27| Int) (v_ArrVal_181 (Array Int Int)) (~M~0 Int) (v_ArrVal_179 (Array Int Int)) (v_subst_2 Int)) (or (not (< (+ v_subst_2 1) c_~N~0)) (< (+ ~M~0 1) |v_thread3Thread1of1ForFork1_~i~2#1_27|) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_27| 4))) (+ (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse8 (* 4 v_subst_2))) (+ (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res1~0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))))) (< 0 ~M~0) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 1) c_~N~0)) (<= (+ |v_thread3Thread1of1ForFork1_~i~2#1_27| 3) c_~N~0) (< (+ 2 v_subst_2) c_~N~0)))) is different from false [2023-05-04 06:32:39,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 06:32:39,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 175 treesize of output 116 [2023-05-04 06:32:39,756 INFO L356 Elim1Store]: treesize reduction 92, result has 42.1 percent of original size [2023-05-04 06:32:39,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59894 treesize of output 51512 [2023-05-04 06:32:40,084 INFO L356 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2023-05-04 06:32:40,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51126 treesize of output 37844 [2023-05-04 06:32:40,436 INFO L356 Elim1Store]: treesize reduction 92, result has 42.1 percent of original size [2023-05-04 06:32:40,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 36790 treesize of output 30968 [2023-05-04 06:32:40,744 INFO L356 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2023-05-04 06:32:40,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 30582 treesize of output 20888 Received shutdown request... [2023-05-04 06:46:25,573 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-04 06:46:25,575 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 06:46:25,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 06:46:25,609 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 06:46:25,609 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 06:46:25,609 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 06:46:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:46:25,781 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-04 06:46:25,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 06:46:25,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 06:46:25,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 06:46:25,789 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-05-04 06:46:25,792 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 06:46:25,793 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 06:46:25,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 06:46:25 BasicIcfg [2023-05-04 06:46:25,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 06:46:25,795 INFO L158 Benchmark]: Toolchain (without parser) took 855905.77ms. Allocated memory was 212.9MB in the beginning and 541.1MB in the end (delta: 328.2MB). Free memory was 155.0MB in the beginning and 348.1MB in the end (delta: -193.1MB). Peak memory consumption was 309.0MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,796 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory was 172.1MB in the beginning and 172.1MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 06:46:25,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.49ms. Allocated memory is still 212.9MB. Free memory was 154.9MB in the beginning and 185.9MB in the end (delta: -31.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.68ms. Allocated memory is still 212.9MB. Free memory was 185.9MB in the beginning and 183.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,797 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 181.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,797 INFO L158 Benchmark]: RCFGBuilder took 631.93ms. Allocated memory is still 212.9MB. Free memory was 181.8MB in the beginning and 147.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,797 INFO L158 Benchmark]: TraceAbstraction took 854855.14ms. Allocated memory was 212.9MB in the beginning and 541.1MB in the end (delta: 328.2MB). Free memory was 146.7MB in the beginning and 348.1MB in the end (delta: -201.4MB). Peak memory consumption was 300.1MB. Max. memory is 8.0GB. [2023-05-04 06:46:25,799 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory was 172.1MB in the beginning and 172.1MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.49ms. Allocated memory is still 212.9MB. Free memory was 154.9MB in the beginning and 185.9MB in the end (delta: -31.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.68ms. Allocated memory is still 212.9MB. Free memory was 185.9MB in the beginning and 183.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 181.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 631.93ms. Allocated memory is still 212.9MB. Free memory was 181.8MB in the beginning and 147.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 854855.14ms. Allocated memory was 212.9MB in the beginning and 541.1MB in the end (delta: 328.2MB). Free memory was 146.7MB in the beginning and 348.1MB in the end (delta: -201.4MB). Peak memory consumption was 300.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2642, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 280, dependent conditional: 264, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1497, independent: 1481, independent conditional: 0, independent unconditional: 1481, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1497, independent: 1479, independent conditional: 0, independent unconditional: 1479, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2378, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1497, unknown conditional: 0, unknown unconditional: 1497] , Statistics on independence cache: Total cache size (in pairs): 1497, Positive cache size: 1481, Positive conditional cache size: 0, Positive unconditional cache size: 1481, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 264 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 176, Number of trivial persistent sets: 135, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1731, independent: 1715, independent conditional: 0, independent unconditional: 1715, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2642, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 280, dependent conditional: 264, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 647, independent unconditional: 1715, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2378, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1497, independent: 1481, independent conditional: 0, independent unconditional: 1481, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1497, independent: 1479, independent conditional: 0, independent unconditional: 1479, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2378, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1497, unknown conditional: 0, unknown unconditional: 1497] , Statistics on independence cache: Total cache size (in pairs): 1497, Positive cache size: 1481, Positive conditional cache size: 0, Positive unconditional cache size: 1481, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 264 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 854.7s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1074 NumberOfCodeBlocks, 1074 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 4252 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1161 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 178/324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown