/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-32214ab [2023-05-20 02:35:39,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 02:35:39,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 02:35:39,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 02:35:39,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 02:35:39,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 02:35:39,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 02:35:39,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 02:35:39,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 02:35:39,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 02:35:39,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 02:35:39,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 02:35:39,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 02:35:39,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 02:35:39,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 02:35:39,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 02:35:39,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 02:35:39,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 02:35:39,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 02:35:39,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 02:35:39,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 02:35:39,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 02:35:39,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 02:35:39,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 02:35:39,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 02:35:39,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 02:35:39,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 02:35:39,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 02:35:39,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 02:35:39,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 02:35:39,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 02:35:39,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 02:35:39,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 02:35:39,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 02:35:39,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 02:35:39,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 02:35:39,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 02:35:39,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 02:35:39,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 02:35:39,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 02:35:39,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 02:35:39,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 02:35:39,513 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 02:35:39,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 02:35:39,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 02:35:39,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 02:35:39,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 02:35:39,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 02:35:39,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 02:35:39,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 02:35:39,515 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 02:35:39,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 02:35:39,515 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 02:35:39,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 02:35:39,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 02:35:39,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 02:35:39,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 02:35:39,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 02:35:39,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 02:35:39,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 02:35:39,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 02:35:39,519 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 02:35:39,519 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-20 02:35:39,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 02:35:39,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 02:35:39,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 02:35:39,727 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 02:35:39,728 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 02:35:39,729 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-20 02:35:39,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7ca9ad5/3dcc0940713145bc962d7c6dc1a882b6/FLAG11a9bd888 [2023-05-20 02:35:40,134 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 02:35:40,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2023-05-20 02:35:40,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7ca9ad5/3dcc0940713145bc962d7c6dc1a882b6/FLAG11a9bd888 [2023-05-20 02:35:40,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7ca9ad5/3dcc0940713145bc962d7c6dc1a882b6 [2023-05-20 02:35:40,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 02:35:40,154 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 02:35:40,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 02:35:40,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 02:35:40,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 02:35:40,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595b9fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40, skipping insertion in model container [2023-05-20 02:35:40,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 02:35:40,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 02:35:40,341 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-20 02:35:40,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 02:35:40,356 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 02:35:40,375 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-20 02:35:40,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 02:35:40,391 INFO L208 MainTranslator]: Completed translation [2023-05-20 02:35:40,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40 WrapperNode [2023-05-20 02:35:40,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 02:35:40,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 02:35:40,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 02:35:40,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 02:35:40,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,425 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2023-05-20 02:35:40,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 02:35:40,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 02:35:40,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 02:35:40,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 02:35:40,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,444 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 02:35:40,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 02:35:40,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 02:35:40,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 02:35:40,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (1/1) ... [2023-05-20 02:35:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 02:35:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:40,475 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-20 02:35:40,477 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-20 02:35:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 02:35:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 02:35:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 02:35:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 02:35:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 02:35:40,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 02:35:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 02:35:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 02:35:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 02:35:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 02:35:40,510 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 02:35:40,621 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 02:35:40,623 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 02:35:40,935 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 02:35:41,053 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 02:35:41,053 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-20 02:35:41,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 02:35:41 BoogieIcfgContainer [2023-05-20 02:35:41,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 02:35:41,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 02:35:41,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 02:35:41,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 02:35:41,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 02:35:40" (1/3) ... [2023-05-20 02:35:41,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fce072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 02:35:41, skipping insertion in model container [2023-05-20 02:35:41,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:35:40" (2/3) ... [2023-05-20 02:35:41,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fce072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 02:35:41, skipping insertion in model container [2023-05-20 02:35:41,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 02:35:41" (3/3) ... [2023-05-20 02:35:41,069 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2023-05-20 02:35:41,074 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 02:35:41,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 02:35:41,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 02:35:41,088 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 02:35:41,172 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 02:35:41,212 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 02:35:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 02:35:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:41,215 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-20 02:35:41,218 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-20 02:35:41,249 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 02:35:41,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 02:35:41,271 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;@3d8a0671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 02:35:41,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-20 02:35:41,562 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-20 02:35:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -79636629, now seen corresponding path program 1 times [2023-05-20 02:35:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322395720] [2023-05-20 02:35:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:41,795 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-20 02:35:41,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:41,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322395720] [2023-05-20 02:35:41,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322395720] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 02:35:41,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 02:35:41,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 02:35:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915964631] [2023-05-20 02:35:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 02:35:41,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 02:35:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:35:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 02:35:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 02:35:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:41,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:35:41,824 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-20 02:35:41,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:41,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 02:35:41,875 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-20 02:35:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1702339689, now seen corresponding path program 1 times [2023-05-20 02:35:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:41,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439041095] [2023-05-20 02:35:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:42,195 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-20 02:35:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439041095] [2023-05-20 02:35:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439041095] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 02:35:42,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 02:35:42,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 02:35:42,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375438100] [2023-05-20 02:35:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 02:35:42,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 02:35:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:35:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 02:35:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-20 02:35:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:42,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:35:42,198 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-20 02:35:42,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:42,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 02:35:42,287 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-20 02:35:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -36627128, now seen corresponding path program 1 times [2023-05-20 02:35:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413347328] [2023-05-20 02:35:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:42,536 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-20 02:35:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:42,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413347328] [2023-05-20 02:35:42,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413347328] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:35:42,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647551646] [2023-05-20 02:35:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:35:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:42,558 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-20 02:35:42,572 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-20 02:35:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:42,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 02:35:42,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:35:42,982 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-20 02:35:42,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:35:43,226 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-20 02:35:43,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647551646] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:35:43,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:35:43,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2023-05-20 02:35:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006899134] [2023-05-20 02:35:43,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:35:43,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-05-20 02:35:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:35:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-05-20 02:35:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2023-05-20 02:35:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:43,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:35:43,231 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-20 02:35:43,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:43,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:43,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 02:35:43,678 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-20 02:35:43,871 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-20 02:35:43,872 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-20 02:35:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1989877349, now seen corresponding path program 1 times [2023-05-20 02:35:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352233130] [2023-05-20 02:35:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:44,155 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-20 02:35:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352233130] [2023-05-20 02:35:44,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352233130] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:35:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143976206] [2023-05-20 02:35:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:35:44,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:44,158 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-20 02:35:44,172 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-20 02:35:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:44,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-20 02:35:44,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:35:44,620 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-20 02:35:44,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:35:44,959 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-20 02:35:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143976206] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:35:44,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:35:44,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 38 [2023-05-20 02:35:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699851102] [2023-05-20 02:35:44,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:35:44,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-20 02:35:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:35:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-20 02:35:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2023-05-20 02:35:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:44,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:35:44,961 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-20 02:35:44,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:44,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:44,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 02:35:44,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 02:35:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 02:35:45,879 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-20 02:35:46,060 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-20 02:35:46,060 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-20 02:35:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2080482226, now seen corresponding path program 2 times [2023-05-20 02:35:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:46,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147608105] [2023-05-20 02:35:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:46,419 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-20 02:35:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147608105] [2023-05-20 02:35:46,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147608105] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:35:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004654637] [2023-05-20 02:35:46,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 02:35:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:35:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:46,421 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-20 02:35:46,452 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-20 02:35:46,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 02:35:46,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 02:35:46,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 02:35:46,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:35:46,878 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-20 02:35:46,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:35:47,234 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-20 02:35:47,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004654637] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:35:47,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:35:47,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2023-05-20 02:35:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883904840] [2023-05-20 02:35:47,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:35:47,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-20 02:35:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:35:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-20 02:35:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2023-05-20 02:35:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:47,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:35:47,237 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-20 02:35:47,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:47,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:47,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-20 02:35:47,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 02:35:47,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:35:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:35:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 02:35:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 02:35:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 02:35:47,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-20 02:35:48,070 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-20 02:35:48,071 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-20 02:35:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:35:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash 268008350, now seen corresponding path program 3 times [2023-05-20 02:35:48,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:35:48,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565960036] [2023-05-20 02:35:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:35:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:35:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:35:53,287 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-20 02:35:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:35:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565960036] [2023-05-20 02:35:53,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565960036] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:35:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171131963] [2023-05-20 02:35:53,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 02:35:53,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:35:53,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:35:53,289 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-20 02:35:53,290 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-20 02:35:53,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-20 02:35:53,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 02:35:53,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 148 conjunts are in the unsatisfiable core [2023-05-20 02:35:53,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:35:54,704 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-20 02:35:55,407 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-20 02:35:55,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:55,736 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-20 02:35:56,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:56,289 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-20 02:35:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:58,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 02:35:58,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 02:35:58,315 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-20 02:35:58,797 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-20 02:35:58,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:36:01,538 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-20 02:36:01,898 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-20 02:36:01,992 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-20 02:36:03,126 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-20 02:36:03,341 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-20 02:36:03,524 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-20 02:36:03,629 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-20 02:36:04,113 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-20 02:36:04,211 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-20 02:36:04,270 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-20 02:36:05,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 02:36:05,379 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-20 02:36:05,550 INFO L356 Elim1Store]: treesize reduction 92, result has 42.1 percent of original size [2023-05-20 02:36:05,551 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-20 02:36:05,757 INFO L356 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2023-05-20 02:36:05,758 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-20 02:36:06,006 INFO L356 Elim1Store]: treesize reduction 92, result has 42.1 percent of original size [2023-05-20 02:36:06,006 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-20 02:36:06,242 INFO L356 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2023-05-20 02:36:06,243 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-20 02:50:09,098 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-20 02:50:09,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-20 02:50:09,119 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-20 02:50:09,125 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-20 02:50:09,125 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-20 02:50:09,136 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-20 02:50:09,313 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-20 02:50:09,314 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-2-2-1 context. [2023-05-20 02:50:09,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-20 02:50:09,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-20 02:50:09,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-20 02:50:09,319 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-05-20 02:50:09,321 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 02:50:09,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 02:50:09,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 02:50:09 BasicIcfg [2023-05-20 02:50:09,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 02:50:09,323 INFO L158 Benchmark]: Toolchain (without parser) took 869169.78ms. Allocated memory was 200.3MB in the beginning and 769.7MB in the end (delta: 569.4MB). Free memory was 138.8MB in the beginning and 606.3MB in the end (delta: -467.6MB). Peak memory consumption was 449.2MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,324 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 02:50:09,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.97ms. Allocated memory was 200.3MB in the beginning and 308.3MB in the end (delta: 108.0MB). Free memory was 138.5MB in the beginning and 274.9MB in the end (delta: -136.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.49ms. Allocated memory is still 308.3MB. Free memory was 274.9MB in the beginning and 272.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,324 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 308.3MB. Free memory was 272.8MB in the beginning and 271.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,325 INFO L158 Benchmark]: RCFGBuilder took 608.71ms. Allocated memory is still 308.3MB. Free memory was 271.1MB in the beginning and 236.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,325 INFO L158 Benchmark]: TraceAbstraction took 868263.64ms. Allocated memory was 308.3MB in the beginning and 769.7MB in the end (delta: 461.4MB). Free memory was 235.8MB in the beginning and 606.3MB in the end (delta: -370.5MB). Peak memory consumption was 439.3MB. Max. memory is 8.0GB. [2023-05-20 02:50:09,326 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 200.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.97ms. Allocated memory was 200.3MB in the beginning and 308.3MB in the end (delta: 108.0MB). Free memory was 138.5MB in the beginning and 274.9MB in the end (delta: -136.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.49ms. Allocated memory is still 308.3MB. Free memory was 274.9MB in the beginning and 272.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 308.3MB. Free memory was 272.8MB in the beginning and 271.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 608.71ms. Allocated memory is still 308.3MB. Free memory was 271.1MB in the beginning and 236.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 868263.64ms. Allocated memory was 308.3MB in the beginning and 769.7MB in the end (delta: 461.4MB). Free memory was 235.8MB in the beginning and 606.3MB in the end (delta: -370.5MB). Peak memory consumption was 439.3MB. 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: 159, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 104, dependent conditional: 0, dependent unconditional: 104, 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: 159, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 104, dependent conditional: 0, dependent unconditional: 104, 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-2-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-2-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-2-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-2-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: 868.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.4s, 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.1s 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