/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 03:09:58,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 03:09:58,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 03:09:58,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 03:09:58,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 03:09:58,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 03:09:58,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 03:09:58,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 03:09:58,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 03:09:58,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 03:09:58,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 03:09:58,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 03:09:58,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 03:09:58,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 03:09:58,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 03:09:58,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 03:09:58,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 03:09:58,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 03:09:58,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 03:09:58,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 03:09:58,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 03:09:58,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 03:09:58,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 03:09:58,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 03:09:58,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 03:09:58,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 03:09:58,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 03:09:58,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 03:09:58,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 03:09:58,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 03:09:58,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 03:09:58,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 03:09:58,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 03:09:58,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 03:09:58,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 03:09:58,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 03:09:58,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 03:09:58,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 03:09:58,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 03:09:58,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 03:09:58,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 03:09:58,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 03:09:58,467 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 03:09:58,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 03:09:58,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 03:09:58,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 03:09:58,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 03:09:58,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 03:09:58,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 03:09:58,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 03:09:58,470 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 03:09:58,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 03:09:58,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 03:09:58,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 03:09:58,472 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 03:09:58,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 03:09:58,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 03:09:58,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 03:09:58,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 03:09:58,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 03:09:58,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:09:58,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 03:09:58,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 03:09:58,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 03:09:58,475 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 03:09:58,475 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 -> true [2023-05-04 03:09:58,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 03:09:58,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 03:09:58,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 03:09:58,718 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 03:09:58,719 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 03:09:58,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-04 03:09:58,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e0f080f/c29536907e4240a0b676362bff066075/FLAGe040a32f6 [2023-05-04 03:09:59,149 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 03:09:59,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-04 03:09:59,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e0f080f/c29536907e4240a0b676362bff066075/FLAGe040a32f6 [2023-05-04 03:09:59,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e0f080f/c29536907e4240a0b676362bff066075 [2023-05-04 03:09:59,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 03:09:59,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 03:09:59,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 03:09:59,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 03:09:59,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 03:09:59,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6c5949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59, skipping insertion in model container [2023-05-04 03:09:59,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 03:09:59,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 03:09:59,782 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-bad-counter-queue.wvr.c[2428,2441] [2023-05-04 03:09:59,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:09:59,802 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 03:09:59,823 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-bad-counter-queue.wvr.c[2428,2441] [2023-05-04 03:09:59,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:09:59,842 INFO L208 MainTranslator]: Completed translation [2023-05-04 03:09:59,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59 WrapperNode [2023-05-04 03:09:59,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 03:09:59,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 03:09:59,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 03:09:59,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 03:09:59,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,879 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-05-04 03:09:59,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 03:09:59,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 03:09:59,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 03:09:59,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 03:09:59,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 03:09:59,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 03:09:59,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 03:09:59,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 03:09:59,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (1/1) ... [2023-05-04 03:09:59,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:09:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:09:59,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 03:09:59,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 03:09:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 03:09:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 03:09:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 03:09:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 03:09:59,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 03:09:59,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 03:09:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 03:09:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 03:09:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 03:09:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 03:09:59,994 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 03:10:00,104 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 03:10:00,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 03:10:00,383 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 03:10:00,504 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 03:10:00,504 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 03:10:00,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:10:00 BoogieIcfgContainer [2023-05-04 03:10:00,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 03:10:00,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 03:10:00,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 03:10:00,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 03:10:00,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 03:09:59" (1/3) ... [2023-05-04 03:10:00,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8d6ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:10:00, skipping insertion in model container [2023-05-04 03:10:00,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:09:59" (2/3) ... [2023-05-04 03:10:00,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8d6ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:10:00, skipping insertion in model container [2023-05-04 03:10:00,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:10:00" (3/3) ... [2023-05-04 03:10:00,520 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-05-04 03:10:00,527 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 03:10:00,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 03:10:00,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 03:10:00,541 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 03:10:00,618 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 03:10:00,657 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:10:00,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 03:10:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:00,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 03:10:00,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 03:10:00,698 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 03:10:00,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 03:10:00,733 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;@364e96eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:10:00,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 03:10:00,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 498614171, now seen corresponding path program 1 times [2023-05-04 03:10:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:00,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895545121] [2023-05-04 03:10:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:01,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895545121] [2023-05-04 03:10:01,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895545121] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:10:01,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:10:01,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 03:10:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319126795] [2023-05-04 03:10:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:10:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 03:10:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 03:10:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 03:10:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:01,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:01,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 03:10:01,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash -498458182, now seen corresponding path program 1 times [2023-05-04 03:10:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24984420] [2023-05-04 03:10:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:01,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24984420] [2023-05-04 03:10:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24984420] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:10:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:10:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 03:10:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20577929] [2023-05-04 03:10:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:10:01,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 03:10:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 03:10:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 03:10:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:01,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:01,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 03:10:01,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1588344948, now seen corresponding path program 1 times [2023-05-04 03:10:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:01,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043488036] [2023-05-04 03:10:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:02,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043488036] [2023-05-04 03:10:02,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043488036] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:02,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832504127] [2023-05-04 03:10:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:02,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:02,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:02,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 03:10:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:02,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 03:10:02,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:02,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:02,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832504127] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:02,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 03:10:02,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 03:10:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717494097] [2023-05-04 03:10:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:10:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 03:10:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 03:10:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 03:10:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:02,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:02,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:02,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:02,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 03:10:02,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 802378100, now seen corresponding path program 1 times [2023-05-04 03:10:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864065755] [2023-05-04 03:10:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:03,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864065755] [2023-05-04 03:10:03,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864065755] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:03,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096139684] [2023-05-04 03:10:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:03,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:03,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:03,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:03,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 03:10:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:03,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 03:10:03,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:03,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:03,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096139684] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:03,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:03,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 03:10:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489504524] [2023-05-04 03:10:03,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:03,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 03:10:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 03:10:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-04 03:10:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:03,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:03,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.583333333333333) internal successors, (182), 24 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:03,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:03,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:03,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:03,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:04,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-04 03:10:04,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:04,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash -334010782, now seen corresponding path program 2 times [2023-05-04 03:10:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712987951] [2023-05-04 03:10:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712987951] [2023-05-04 03:10:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712987951] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484086060] [2023-05-04 03:10:04,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 03:10:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:04,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:04,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 03:10:04,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 03:10:04,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:10:04,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 03:10:04,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 03:10:04,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 03:10:04,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484086060] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:04,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:04,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2023-05-04 03:10:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080612922] [2023-05-04 03:10:04,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-04 03:10:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-04 03:10:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-05-04 03:10:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:04,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.909090909090908) internal successors, (196), 22 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:04,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:04,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:04,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:06,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:06,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:06,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2128053518, now seen corresponding path program 3 times [2023-05-04 03:10:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:06,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816468215] [2023-05-04 03:10:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-04 03:10:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816468215] [2023-05-04 03:10:06,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816468215] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092221060] [2023-05-04 03:10:06,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 03:10:06,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:06,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:06,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 03:10:06,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-05-04 03:10:06,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:10:06,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-04 03:10:06,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 03:10:07,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 03:10:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092221060] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:07,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:07,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-05-04 03:10:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587148028] [2023-05-04 03:10:07,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:07,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 03:10:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 03:10:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2023-05-04 03:10:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:07,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:07,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.0) internal successors, (259), 37 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:07,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:07,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:07,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:07,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:07,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:07,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:08,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:08,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:08,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash -870478624, now seen corresponding path program 4 times [2023-05-04 03:10:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:08,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572870390] [2023-05-04 03:10:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:10:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:08,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572870390] [2023-05-04 03:10:08,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572870390] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:08,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841415879] [2023-05-04 03:10:08,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 03:10:08,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:08,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:08,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:08,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 03:10:08,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 03:10:08,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:10:08,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-04 03:10:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 03:10:09,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 03:10:09,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841415879] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:09,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:09,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 46 [2023-05-04 03:10:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512854130] [2023-05-04 03:10:09,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:09,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-05-04 03:10:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-05-04 03:10:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1737, Unknown=0, NotChecked=0, Total=2070 [2023-05-04 03:10:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:09,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:09,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.1521739130434785) internal successors, (283), 46 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:09,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 03:10:10,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:10,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:10,381 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2096597810, now seen corresponding path program 5 times [2023-05-04 03:10:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:10,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648909645] [2023-05-04 03:10:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 39 proven. 90 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:10:10,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:10,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648909645] [2023-05-04 03:10:10,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648909645] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:10,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057183533] [2023-05-04 03:10:10,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 03:10:10,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:10,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:10,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:10,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 03:10:10,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-05-04 03:10:10,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:10:10,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 03:10:10,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-05-04 03:10:11,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-05-04 03:10:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057183533] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:11,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 10] total 38 [2023-05-04 03:10:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760270488] [2023-05-04 03:10:11,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:11,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-04 03:10:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:11,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-04 03:10:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2023-05-04 03:10:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:11,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.894736842105263) internal successors, (262), 38 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 03:10:11,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 03:10:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 03:10:14,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:14,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:14,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1298826030, now seen corresponding path program 6 times [2023-05-04 03:10:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:14,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405815009] [2023-05-04 03:10:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:10:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 62 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-05-04 03:10:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:10:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405815009] [2023-05-04 03:10:15,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405815009] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:10:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516815367] [2023-05-04 03:10:15,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-04 03:10:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:10:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:10:15,023 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:10:15,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 03:10:15,506 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-05-04 03:10:15,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:10:15,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 36 conjunts are in the unsatisfiable core [2023-05-04 03:10:15,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:10:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 259 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 03:10:16,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:10:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 220 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 03:10:17,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516815367] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:10:17,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:10:17,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 30] total 73 [2023-05-04 03:10:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731258021] [2023-05-04 03:10:17,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:10:17,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-05-04 03:10:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:10:17,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-05-04 03:10:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=4566, Unknown=0, NotChecked=0, Total=5256 [2023-05-04 03:10:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:17,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:10:17,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.794520547945205) internal successors, (423), 73 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-05-04 03:10:17,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 03:10:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 03:10:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 03:10:18,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 03:10:18,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-05-04 03:10:18,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:10:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:10:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1890157888, now seen corresponding path program 7 times [2023-05-04 03:10:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:10:18,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174440885] [2023-05-04 03:10:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:10:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:10:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 03:10:18,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 03:10:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 03:10:18,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 03:10:18,681 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 03:10:18,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 03:10:18,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 03:10:18,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 03:10:18,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 03:10:18,691 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-05-04 03:10:18,695 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 03:10:18,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 03:10:18,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 03:10:18 BasicIcfg [2023-05-04 03:10:18,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 03:10:18,827 INFO L158 Benchmark]: Toolchain (without parser) took 19256.04ms. Allocated memory was 197.1MB in the beginning and 423.6MB in the end (delta: 226.5MB). Free memory was 165.5MB in the beginning and 287.4MB in the end (delta: -121.9MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,827 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 197.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 03:10:18,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.32ms. Allocated memory was 197.1MB in the beginning and 288.4MB in the end (delta: 91.2MB). Free memory was 165.3MB in the beginning and 256.2MB in the end (delta: -90.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 288.4MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,828 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 288.4MB. Free memory was 254.1MB in the beginning and 252.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,829 INFO L158 Benchmark]: RCFGBuilder took 599.48ms. Allocated memory is still 288.4MB. Free memory was 252.7MB in the beginning and 226.2MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,829 INFO L158 Benchmark]: TraceAbstraction took 18317.64ms. Allocated memory was 288.4MB in the beginning and 423.6MB in the end (delta: 135.3MB). Free memory was 225.2MB in the beginning and 287.4MB in the end (delta: -62.3MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. [2023-05-04 03:10:18,830 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.55ms. Allocated memory is still 197.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.32ms. Allocated memory was 197.1MB in the beginning and 288.4MB in the end (delta: 91.2MB). Free memory was 165.3MB in the beginning and 256.2MB in the end (delta: -90.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 288.4MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 288.4MB. Free memory was 254.1MB in the beginning and 252.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 599.48ms. Allocated memory is still 288.4MB. Free memory was 252.7MB in the beginning and 226.2MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18317.64ms. Allocated memory was 288.4MB in the beginning and 423.6MB in the end (delta: 135.3MB). Free memory was 225.2MB in the beginning and 287.4MB in the end (delta: -62.3MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3306, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 533, dependent conditional: 523, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 120, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 559, independent: 541, independent conditional: 0, independent unconditional: 541, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 559, independent: 540, independent conditional: 0, independent unconditional: 540, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 83, dependent conditional: 39, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2921, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 130, dependent conditional: 12, dependent unconditional: 118, unknown: 559, unknown conditional: 8, unknown unconditional: 551] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 541, Positive conditional cache size: 0, Positive unconditional cache size: 541, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 8, Independence queries for same thread: 505 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 118, Number of trivial persistent sets: 98, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 615, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3306, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 533, dependent conditional: 523, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 120, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 559, independent: 541, independent conditional: 0, independent unconditional: 541, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 559, independent: 540, independent conditional: 0, independent unconditional: 540, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 83, dependent conditional: 39, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2921, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 130, dependent conditional: 12, dependent unconditional: 118, unknown: 559, unknown conditional: 8, unknown unconditional: 551] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 541, Positive conditional cache size: 0, Positive unconditional cache size: 541, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 8, Independence queries for same thread: 505 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, A={0:0}, counter=0, N=7, t1={6:0}, t2={5:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=7] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=7] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={3:0}, N=7, size=7] [L97] 0 int i = 0; VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-9, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=0, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-10, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=10, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-4, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=11, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=9, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L100] 0 return arr; VAL [\old(size)=7, \result={3:0}, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, counter=0, create_fresh_int_array(N)={3:0}, N=7, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, counter=0, N=7, pthread_create(&t1, 0, thread1, 0)=-2, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, counter=0, i=0, N=7] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, counter=0, N=7, pthread_create(&t2, 0, thread2, 0)=-1, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, counter=0, i=0, N=7] [L83] 0 \read(t1) VAL [\read(t1)=-2, A={3:0}, counter=0, N=7, t1={6:0}, t2={5:0}] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-9, i=0, N=7, tmp=-9] [L49] 1 i++ VAL [A={3:0}, counter=-9, i=1, N=7, tmp=-9] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=0, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=1, N=7, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=0, i=1, N=7, tmp=0] [L49] 1 i++ VAL [A={3:0}, counter=0, i=2, N=7, tmp=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=1, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=2, N=7, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-10, i=2, N=7, tmp=-10] [L49] 1 i++ VAL [A={3:0}, counter=-10, i=3, N=7, tmp=-10] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=2, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=3, N=7, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=10, i=3, N=7, tmp=10] [L49] 1 i++ VAL [A={3:0}, counter=10, i=4, N=7, tmp=10] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=3, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=4, N=7, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-4, i=4, N=7, tmp=-4] [L49] 1 i++ VAL [A={3:0}, counter=-4, i=5, N=7, tmp=-4] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=4, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=5, N=7, tmp=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=-11, i=5, N=7, tmp=-11] [L62] 2 i++ VAL [A={3:0}, counter=-11, i=6, N=7, tmp=-11] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=7, i=5, N=7, tmp=7] [L49] 1 i++ VAL [A={3:0}, counter=7, i=6, N=7, tmp=7] [L67] 2 counter = tmp VAL [A={3:0}, counter=-20, i=6, N=7, tmp=-20] [L62] 2 i++ VAL [A={3:0}, counter=-20, i=7, N=7, tmp=-20] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-11, i=6, N=7, tmp=-11] [L49] 1 i++ VAL [A={3:0}, counter=-11, i=7, N=7, tmp=-11] [L62] COND FALSE 2 !(i