/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -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 18:06:38,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 18:06:38,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 18:06:38,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 18:06:38,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 18:06:38,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 18:06:38,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 18:06:38,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 18:06:38,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 18:06:38,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 18:06:38,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 18:06:38,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 18:06:38,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 18:06:38,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 18:06:38,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 18:06:38,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 18:06:38,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 18:06:38,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 18:06:38,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 18:06:38,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 18:06:38,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 18:06:38,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 18:06:38,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 18:06:38,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 18:06:38,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 18:06:38,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 18:06:38,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 18:06:38,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 18:06:38,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 18:06:38,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 18:06:38,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 18:06:38,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 18:06:38,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 18:06:38,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 18:06:38,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 18:06:38,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 18:06:38,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 18:06:38,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 18:06:38,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 18:06:38,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 18:06:38,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 18:06:38,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 18:06:38,724 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 18:06:38,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 18:06:38,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 18:06:38,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 18:06:38,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 18:06:38,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 18:06:38,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 18:06:38,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 18:06:38,727 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 18:06:38,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 18:06:38,728 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 18:06:38,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 18:06:38,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 18:06:38,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 18:06:38,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 18:06:38,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 18:06:38,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 18:06:38,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 18:06:38,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 18:06:38,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 18:06:38,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 18:06:38,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 18:06:38,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 18:06:38,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 18:06:38,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 18:06:38,732 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 18:06:38,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-04 18:06:39,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 18:06:39,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 18:06:39,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 18:06:39,045 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 18:06:39,045 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 18:06:39,047 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 18:06:39,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837a37e99/306f967465e140abb3c1dccffc8fd0c7/FLAGf726e28dc [2023-05-04 18:06:39,516 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 18:06:39,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-04 18:06:39,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837a37e99/306f967465e140abb3c1dccffc8fd0c7/FLAGf726e28dc [2023-05-04 18:06:39,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837a37e99/306f967465e140abb3c1dccffc8fd0c7 [2023-05-04 18:06:39,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 18:06:39,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 18:06:39,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 18:06:39,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 18:06:39,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 18:06:39,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:06:39" (1/1) ... [2023-05-04 18:06:39,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370888e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:39, skipping insertion in model container [2023-05-04 18:06:39,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:06:39" (1/1) ... [2023-05-04 18:06:39,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 18:06:39,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 18:06:40,182 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 18:06:40,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 18:06:40,216 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 18:06:40,254 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 18:06:40,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 18:06:40,282 INFO L208 MainTranslator]: Completed translation [2023-05-04 18:06:40,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40 WrapperNode [2023-05-04 18:06:40,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 18:06:40,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 18:06:40,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 18:06:40,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 18:06:40,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,339 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-05-04 18:06:40,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 18:06:40,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 18:06:40,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 18:06:40,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 18:06:40,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 18:06:40,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 18:06:40,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 18:06:40,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 18:06:40,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (1/1) ... [2023-05-04 18:06:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 18:06:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:40,426 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 18:06:40,452 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 18:06:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 18:06:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 18:06:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 18:06:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 18:06:40,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 18:06:40,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 18:06:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 18:06:40,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 18:06:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 18:06:40,472 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 18:06:40,580 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 18:06:40,582 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 18:06:40,873 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 18:06:41,006 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 18:06:41,006 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 18:06:41,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:06:41 BoogieIcfgContainer [2023-05-04 18:06:41,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 18:06:41,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 18:06:41,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 18:06:41,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 18:06:41,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 06:06:39" (1/3) ... [2023-05-04 18:06:41,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3386a970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:06:41, skipping insertion in model container [2023-05-04 18:06:41,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:06:40" (2/3) ... [2023-05-04 18:06:41,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3386a970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:06:41, skipping insertion in model container [2023-05-04 18:06:41,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:06:41" (3/3) ... [2023-05-04 18:06:41,025 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-05-04 18:06:41,033 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 18:06:41,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 18:06:41,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 18:06:41,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 18:06:41,099 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 18:06:41,140 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 18:06:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 18:06:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:41,144 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 18:06:41,146 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 18:06:41,179 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 18:06:41,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 18:06:41,200 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;@22cb0b88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 18:06:41,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 18:06:41,415 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 18:06:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2110689057, now seen corresponding path program 1 times [2023-05-04 18:06:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:41,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444983385] [2023-05-04 18:06:41,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 18:06:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444983385] [2023-05-04 18:06:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444983385] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 18:06:41,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 18:06:41,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 18:06:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697454346] [2023-05-04 18:06:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 18:06:41,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 18:06:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 18:06:41,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 18:06:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:41,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:41,738 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 18:06:41,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:41,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 18:06:41,810 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 18:06:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 594352772, now seen corresponding path program 1 times [2023-05-04 18:06:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:41,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095120385] [2023-05-04 18:06:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:42,280 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 18:06:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:42,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095120385] [2023-05-04 18:06:42,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095120385] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 18:06:42,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 18:06:42,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 18:06:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032712020] [2023-05-04 18:06:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 18:06:42,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 18:06:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 18:06:42,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 18:06:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:42,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:42,289 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 18:06:42,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:42,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:42,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 18:06:42,431 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 18:06:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -495533994, now seen corresponding path program 1 times [2023-05-04 18:06:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272861789] [2023-05-04 18:06:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 18:06:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:42,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272861789] [2023-05-04 18:06:42,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272861789] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:42,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544543744] [2023-05-04 18:06:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:42,695 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 18:06:42,697 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 18:06:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:42,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 18:06:42,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 18:06:42,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 18:06:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544543744] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 18:06:43,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 18:06:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92756567] [2023-05-04 18:06:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 18:06:43,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 18:06:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 18:06:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 18:06:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:43,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:43,192 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 18:06:43,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:43,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:43,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:43,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 18:06:43,569 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 18:06:43,569 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 18:06:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 169951444, now seen corresponding path program 1 times [2023-05-04 18:06:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:43,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559091574] [2023-05-04 18:06:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:43,710 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 18:06:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:43,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559091574] [2023-05-04 18:06:43,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559091574] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:43,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143898174] [2023-05-04 18:06:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:43,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:43,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:43,713 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 18:06:43,716 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 18:06:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:43,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 18:06:43,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:43,878 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 18:06:43,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:44,016 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 18:06:44,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143898174] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:44,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 18:06:44,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 18:06:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913007409] [2023-05-04 18:06:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 18:06:44,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 18:06:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 18:06:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 18:06:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:44,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:44,020 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 18:06:44,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:44,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:44,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:44,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:44,171 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 18:06:44,367 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 18:06:44,368 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 18:06:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1830805798, now seen corresponding path program 1 times [2023-05-04 18:06:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127480165] [2023-05-04 18:06:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:44,607 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 18:06:44,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127480165] [2023-05-04 18:06:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127480165] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513395550] [2023-05-04 18:06:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:44,610 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 18:06:44,635 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 18:06:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:44,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 18:06:44,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:44,934 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 18:06:44,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:45,130 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 18:06:45,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513395550] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:45,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:45,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 18:06:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946434712] [2023-05-04 18:06:45,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:45,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 18:06:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 18:06:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-04 18:06:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:45,134 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:45,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.5) internal successors, (180), 24 states have internal predecessors, (180), 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 18:06:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:45,384 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 18:06:45,580 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 18:06:45,581 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 18:06:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 694416916, now seen corresponding path program 2 times [2023-05-04 18:06:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:45,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454904145] [2023-05-04 18:06:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454904145] [2023-05-04 18:06:45,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454904145] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:45,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046675176] [2023-05-04 18:06:45,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 18:06:45,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:45,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:45,826 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 18:06:45,847 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 18:06:45,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 18:06:45,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:06:45,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 18:06:45,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 18:06:46,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 18:06:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046675176] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:46,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:46,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-05-04 18:06:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376500295] [2023-05-04 18:06:46,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:46,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 18:06:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 18:06:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-05-04 18:06:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:46,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 23 states have internal predecessors, (190), 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 18:06:46,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:46,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:46,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:46,948 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 18:06:47,142 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 18:06:47,143 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 18:06:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1672253452, now seen corresponding path program 3 times [2023-05-04 18:06:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970630153] [2023-05-04 18:06:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 42 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 18:06:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970630153] [2023-05-04 18:06:47,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970630153] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751792590] [2023-05-04 18:06:47,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 18:06:47,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:47,540 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 18:06:47,556 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 18:06:47,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-04 18:06:47,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:06:47,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 18:06:47,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:48,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:48,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751792590] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:48,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:48,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 39 [2023-05-04 18:06:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541794422] [2023-05-04 18:06:48,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:48,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-05-04 18:06:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-05-04 18:06:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2023-05-04 18:06:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:48,435 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:48,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.6923076923076925) internal successors, (261), 39 states have internal predecessors, (261), 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 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:48,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:48,877 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 18:06:49,064 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 18:06:49,064 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 18:06:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 350433204, now seen corresponding path program 4 times [2023-05-04 18:06:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517223476] [2023-05-04 18:06:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 29 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517223476] [2023-05-04 18:06:49,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517223476] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498069897] [2023-05-04 18:06:49,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 18:06:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:49,561 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 18:06:49,582 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 18:06:49,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 18:06:49,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:06:49,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-04 18:06:49,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 46 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:50,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 62 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498069897] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:50,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2023-05-04 18:06:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041416928] [2023-05-04 18:06:50,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:50,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-05-04 18:06:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-05-04 18:06:50,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-05-04 18:06:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:50,631 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:50,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.159090909090909) internal successors, (271), 44 states have internal predecessors, (271), 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 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:50,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:06:51,480 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 18:06:51,663 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 18:06:51,664 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 18:06:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash 176844964, now seen corresponding path program 5 times [2023-05-04 18:06:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:51,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468038748] [2023-05-04 18:06:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 83 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:06:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:52,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468038748] [2023-05-04 18:06:52,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468038748] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:52,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189496226] [2023-05-04 18:06:52,259 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 18:06:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:52,261 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 18:06:52,280 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 18:06:52,400 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-05-04 18:06:52,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:06:52,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-04 18:06:52,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 28 proven. 77 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-05-04 18:06:52,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-05-04 18:06:53,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189496226] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:53,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:53,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 10] total 49 [2023-05-04 18:06:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33134772] [2023-05-04 18:06:53,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:53,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-04 18:06:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-04 18:06:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2023-05-04 18:06:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:53,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.795918367346939) internal successors, (284), 49 states have internal predecessors, (284), 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 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:53,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:53,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:53,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:06:53,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:06:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-05-04 18:06:55,549 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 18:06:55,731 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 18:06:55,732 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 18:06:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash 814533138, now seen corresponding path program 6 times [2023-05-04 18:06:55,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:55,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809803105] [2023-05-04 18:06:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:06:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 215 proven. 104 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-05-04 18:06:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:06:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809803105] [2023-05-04 18:06:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809803105] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:06:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403096755] [2023-05-04 18:06:56,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-04 18:06:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:06:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:06:56,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 18:06:56,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 18:06:56,844 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-05-04 18:06:56,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:06:56,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 28 conjunts are in the unsatisfiable core [2023-05-04 18:06:56,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:06:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 261 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 18:06:57,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:06:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 261 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 18:06:58,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403096755] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:06:58,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:06:58,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 29] total 69 [2023-05-04 18:06:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980360215] [2023-05-04 18:06:58,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:06:58,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-05-04 18:06:58,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:06:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-05-04 18:06:58,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=3929, Unknown=0, NotChecked=0, Total=4692 [2023-05-04 18:06:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:58,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:06:58,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 5.739130434782608) internal successors, (396), 69 states have internal predecessors, (396), 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 18:06:58,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:58,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2023-05-04 18:06:58,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:06:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-05-04 18:06:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:06:59,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 18:06:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 18:06:59,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 18:06:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:06:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash 214176338, now seen corresponding path program 7 times [2023-05-04 18:06:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:06:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331089030] [2023-05-04 18:06:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:06:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:06:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:07:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 88 proven. 332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:07:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:07:11,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331089030] [2023-05-04 18:07:11,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331089030] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:07:11,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18523177] [2023-05-04 18:07:11,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-05-04 18:07:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:07:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:07:11,687 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 18:07:11,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 18:07:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:07:11,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 287 conjunts are in the unsatisfiable core [2023-05-04 18:07:11,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:07:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 18:07:17,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:07:25,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 18:07:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 120 treesize of output 551 [2023-05-04 18:07:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-05-04 18:07:29,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18523177] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:07:29,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:07:29,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 70, 58] total 203 [2023-05-04 18:07:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692459549] [2023-05-04 18:07:29,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:07:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2023-05-04 18:07:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:07:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2023-05-04 18:07:29,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=39894, Unknown=0, NotChecked=0, Total=41006 [2023-05-04 18:07:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:07:29,255 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:07:29,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.3004926108374386) internal successors, (467), 203 states have internal predecessors, (467), 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 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:07:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:08:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:08:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:08:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 18:08:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:08:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2023-05-04 18:08:12,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-05-04 18:08:12,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-04 18:08:12,213 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 18:08:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:08:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -735337178, now seen corresponding path program 8 times [2023-05-04 18:08:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:08:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924447072] [2023-05-04 18:08:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:08:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:08:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:08:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 953 proven. 254 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-05-04 18:08:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:08:13,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924447072] [2023-05-04 18:08:13,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924447072] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:08:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149037900] [2023-05-04 18:08:13,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 18:08:13,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:08:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:08:13,873 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 18:08:13,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 18:08:14,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 18:08:14,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:08:14,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-04 18:08:14,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:08:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 1003 proven. 204 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-05-04 18:08:15,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:08:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 1003 proven. 204 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-05-04 18:08:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149037900] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:08:16,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:08:16,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 94 [2023-05-04 18:08:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403297218] [2023-05-04 18:08:16,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:08:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-04 18:08:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:08:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-04 18:08:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1287, Invalid=7455, Unknown=0, NotChecked=0, Total=8742 [2023-05-04 18:08:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:16,282 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:08:16,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 5.297872340425532) internal successors, (498), 94 states have internal predecessors, (498), 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 18:08:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 249 states. [2023-05-04 18:08:16,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:08:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:08:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 18:08:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:08:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2023-05-04 18:08:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 18:08:17,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 18:08:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-04 18:08:17,475 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 18:08:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:08:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 81374584, now seen corresponding path program 9 times [2023-05-04 18:08:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:08:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653400993] [2023-05-04 18:08:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:08:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:08:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 18:08:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 1023 proven. 318 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-05-04 18:08:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 18:08:19,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653400993] [2023-05-04 18:08:19,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653400993] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 18:08:19,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810585377] [2023-05-04 18:08:19,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 18:08:19,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 18:08:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 18:08:19,205 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 18:08:19,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 18:08:19,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-05-04 18:08:19,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 18:08:19,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 52 conjunts are in the unsatisfiable core [2023-05-04 18:08:19,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 18:08:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 1290 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:08:21,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 18:08:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 1263 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 18:08:23,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810585377] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 18:08:23,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 18:08:23,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 53, 53] total 142 [2023-05-04 18:08:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933139829] [2023-05-04 18:08:23,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 18:08:23,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-05-04 18:08:23,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 18:08:23,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-05-04 18:08:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2567, Invalid=17455, Unknown=0, NotChecked=0, Total=20022 [2023-05-04 18:08:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:23,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 18:08:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 5.492957746478873) internal successors, (780), 142 states have internal predecessors, (780), 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 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 249 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-04 18:08:23,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 18:08:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-04 18:08:26,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-05-04 18:08:26,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 18:08:26,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 18:08:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 18:08:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash 521115192, now seen corresponding path program 10 times [2023-05-04 18:08:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 18:08:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550556963] [2023-05-04 18:08:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 18:08:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 18:08:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 18:08:26,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 18:08:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 18:08:27,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 18:08:27,213 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 18:08:27,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 18:08:27,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 18:08:27,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 18:08:27,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 18:08:27,223 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1] [2023-05-04 18:08:27,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 18:08:27,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 18:08:27,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 06:08:27 BasicIcfg [2023-05-04 18:08:27,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 18:08:27,476 INFO L158 Benchmark]: Toolchain (without parser) took 107576.61ms. Allocated memory was 180.4MB in the beginning and 812.6MB in the end (delta: 632.3MB). Free memory was 157.3MB in the beginning and 275.7MB in the end (delta: -118.4MB). Peak memory consumption was 513.8MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,478 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 18:08:27,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.10ms. Allocated memory was 180.4MB in the beginning and 222.3MB in the end (delta: 41.9MB). Free memory was 157.3MB in the beginning and 195.7MB in the end (delta: -38.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 222.3MB. Free memory was 195.7MB in the beginning and 193.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,478 INFO L158 Benchmark]: Boogie Preprocessor took 47.83ms. Allocated memory is still 222.3MB. Free memory was 193.7MB in the beginning and 192.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,479 INFO L158 Benchmark]: RCFGBuilder took 619.25ms. Allocated memory is still 222.3MB. Free memory was 192.1MB in the beginning and 165.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,479 INFO L158 Benchmark]: TraceAbstraction took 106464.58ms. Allocated memory was 222.3MB in the beginning and 812.6MB in the end (delta: 590.3MB). Free memory was 164.8MB in the beginning and 275.7MB in the end (delta: -110.9MB). Peak memory consumption was 480.5MB. Max. memory is 8.0GB. [2023-05-04 18:08:27,480 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.14ms. Allocated memory is still 180.4MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.10ms. Allocated memory was 180.4MB in the beginning and 222.3MB in the end (delta: 41.9MB). Free memory was 157.3MB in the beginning and 195.7MB in the end (delta: -38.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 222.3MB. Free memory was 195.7MB in the beginning and 193.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.83ms. Allocated memory is still 222.3MB. Free memory was 193.7MB in the beginning and 192.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 619.25ms. Allocated memory is still 222.3MB. Free memory was 192.1MB in the beginning and 165.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 106464.58ms. Allocated memory was 222.3MB in the beginning and 812.6MB in the end (delta: 590.3MB). Free memory was 164.8MB in the beginning and 275.7MB in the end (delta: -110.9MB). Peak memory consumption was 480.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3774, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 1603, dependent conditional: 1589, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2366, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 195, dependent conditional: 181, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2366, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 195, dependent conditional: 181, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 1634, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 592, dependent unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 592, dependent unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 779, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 779, independent: 705, independent conditional: 0, independent unconditional: 705, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 396, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 337, dependent conditional: 249, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4000, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 1756, dependent conditional: 533, dependent unconditional: 1223, unknown: 779, unknown conditional: 59, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 706, Positive conditional cache size: 0, Positive unconditional cache size: 706, Negative cache size: 73, Negative conditional cache size: 59, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1042, Maximal queried relation: 12, Independence queries for same thread: 1408 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 164, Number of trivial persistent sets: 138, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 839, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3774, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 1603, dependent conditional: 1589, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2366, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 195, dependent conditional: 181, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2366, independent: 2171, independent conditional: 1346, independent unconditional: 825, dependent: 195, dependent conditional: 181, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 1634, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 592, dependent unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4000, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 1829, dependent conditional: 592, dependent unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 779, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 779, independent: 705, independent conditional: 0, independent unconditional: 705, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 73, dependent conditional: 59, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 396, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 337, dependent conditional: 249, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4000, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 1756, dependent conditional: 533, dependent unconditional: 1223, unknown: 779, unknown conditional: 59, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 706, Positive conditional cache size: 0, Positive unconditional cache size: 706, Negative cache size: 73, Negative conditional cache size: 59, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1042, Maximal queried relation: 12, Independence queries for same thread: 1408 - 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()=15, A={0:0}, counter=0, N=15, 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=15] [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=15] [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)=15, A={0:0}, arr={3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={3:0}, N=15, size=15] [L97] 0 int i = 0; VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=0, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=0, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-14, A={0:0}, arr={3:0}, counter=0, i=0, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=1, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=1, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=7, A={0:0}, arr={3:0}, counter=0, i=1, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=2, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=2, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=9, A={0:0}, arr={3:0}, counter=0, i=2, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=3, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=3, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=53, A={0:0}, arr={3:0}, counter=0, i=3, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=4, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=4, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-16, A={0:0}, arr={3:0}, counter=0, i=4, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=5, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=5, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=10, A={0:0}, arr={3:0}, counter=0, i=5, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=6, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=6, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-1, A={0:0}, arr={3:0}, counter=0, i=6, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=7, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=7, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=0, A={0:0}, arr={3:0}, counter=0, i=7, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=8, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=8, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=11, A={0:0}, arr={3:0}, counter=0, i=8, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=9, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=9, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=2147483644, A={0:0}, arr={3:0}, counter=0, i=9, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=10, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=10, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-18, A={0:0}, arr={3:0}, counter=0, i=10, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=11, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=11, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-3, A={0:0}, arr={3:0}, counter=0, i=11, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=12, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=12, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-21, A={0:0}, arr={3:0}, counter=0, i=12, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=13, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=13, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=26, A={0:0}, arr={3:0}, counter=0, i=13, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=14, N=15, size=15] [L97] COND TRUE 0 i < size VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=14, N=15, size=15] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=15, __VERIFIER_nondet_int()=-22, A={0:0}, arr={3:0}, counter=0, i=14, N=15, size=15] [L97] 0 i++ VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=15, N=15, size=15] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=15, A={0:0}, arr={3:0}, counter=0, i=15, N=15, size=15] [L100] 0 return arr; VAL [\old(size)=15, \result={3:0}, A={0:0}, arr={3:0}, counter=0, i=15, N=15, size=15] [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=15, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, counter=0, N=15, pthread_create(&t1, 0, thread1, 0)=2147483646, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, counter=0, i=0, N=15] [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]); [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, counter=0, N=15, pthread_create(&t2, 0, thread2, 0)=2147483647, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, counter=0, i=0, N=15] [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] 1 i++ VAL [A={3:0}, counter=-14, i=1, N=15, tmp=-14] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=1, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=7, i=2, N=15, tmp=7] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=2, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=9, i=3, N=15, tmp=9] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=3, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=53, i=4, N=15, tmp=53] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=4, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=-16, i=5, N=15, tmp=-16] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=5, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=10, i=6, N=15, tmp=10] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=6, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=-1, i=7, N=15, tmp=-1] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=7, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=0, i=8, N=15, 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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=8, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=11, i=9, N=15, tmp=11] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=9, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=2147483644, i=10, N=15, tmp=2147483644] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=10, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=-18, i=11, N=15, tmp=-18] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=11, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=-3, i=12, N=15, tmp=-3] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=12, N=15, 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]); [L49] 1 i++ VAL [A={3:0}, counter=-21, i=13, N=15, tmp=-21] [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]); [L62] 2 i++ VAL [A={3:0}, counter=0, i=13, N=15, 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=26, i=13, N=15, tmp=26] [L67] 2 counter = tmp VAL [A={3:0}, counter=-26, i=13, N=15, tmp=-26] [L49] 1 i++ VAL [A={3:0}, counter=-26, i=14, N=15, tmp=26] [L49] COND TRUE 1 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=-4, i=14, N=15, tmp=-4] [L51] EXPR 1 A[i] [L51] CALL, EXPR 1 plus(counter, A[i]) [L110] CALL 1 assume_abort_if_not(b >= 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]); [L62] 2 i++ VAL [A={3:0}, counter=-4, i=15, N=15, tmp=-4] [L62] COND FALSE 2 !(i