/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 LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 20:58:32,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 20:58:32,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 20:58:32,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 20:58:32,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 20:58:32,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 20:58:32,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 20:58:32,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 20:58:32,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 20:58:32,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 20:58:32,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 20:58:32,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 20:58:32,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 20:58:32,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 20:58:32,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 20:58:32,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 20:58:32,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 20:58:32,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 20:58:32,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 20:58:32,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 20:58:32,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 20:58:32,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 20:58:32,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 20:58:32,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 20:58:32,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 20:58:32,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 20:58:32,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 20:58:32,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 20:58:32,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 20:58:32,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 20:58:32,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 20:58:32,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 20:58:32,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 20:58:32,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 20:58:32,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 20:58:32,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 20:58:32,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 20:58:32,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 20:58:32,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 20:58:32,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 20:58:32,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 20:58:32,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 20:58:32,744 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 20:58:32,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 20:58:32,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 20:58:32,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 20:58:32,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 20:58:32,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 20:58:32,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 20:58:32,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 20:58:32,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 20:58:32,746 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 20:58:32,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 20:58:32,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:58:32,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 20:58:32,748 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 20:58:32,748 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 -> LOOP [2023-05-04 20:58:32,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 20:58:32,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 20:58:32,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 20:58:32,940 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 20:58:32,947 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 20:58:32,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-05-04 20:58:32,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5572499/e9286ecf47b84003a97e3ad93f33a2c6/FLAG1668ec1bc [2023-05-04 20:58:33,333 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 20:58:33,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-05-04 20:58:33,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5572499/e9286ecf47b84003a97e3ad93f33a2c6/FLAG1668ec1bc [2023-05-04 20:58:33,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5572499/e9286ecf47b84003a97e3ad93f33a2c6 [2023-05-04 20:58:33,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 20:58:33,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 20:58:33,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 20:58:33,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 20:58:33,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 20:58:33,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdda51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33, skipping insertion in model container [2023-05-04 20:58:33,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 20:58:33,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 20:58:33,576 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-dot-product-alt.wvr.c[3182,3195] [2023-05-04 20:58:33,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:58:33,587 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 20:58:33,610 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-dot-product-alt.wvr.c[3182,3195] [2023-05-04 20:58:33,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:58:33,625 INFO L208 MainTranslator]: Completed translation [2023-05-04 20:58:33,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33 WrapperNode [2023-05-04 20:58:33,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 20:58:33,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 20:58:33,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 20:58:33,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 20:58:33,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,666 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 362 [2023-05-04 20:58:33,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 20:58:33,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 20:58:33,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 20:58:33,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 20:58:33,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,701 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 20:58:33,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 20:58:33,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 20:58:33,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 20:58:33,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (1/1) ... [2023-05-04 20:58:33,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:58:33,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:33,752 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 20:58:33,753 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 20:58:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 20:58:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-04 20:58:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 20:58:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 20:58:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 20:58:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-05-04 20:58:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 20:58:33,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 20:58:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 20:58:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 20:58:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 20:58:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 20:58:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 20:58:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 20:58:33,786 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 20:58:33,863 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 20:58:33,864 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 20:58:34,270 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 20:58:34,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 20:58:34,364 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-05-04 20:58:34,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:58:34 BoogieIcfgContainer [2023-05-04 20:58:34,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 20:58:34,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 20:58:34,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 20:58:34,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 20:58:34,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:58:33" (1/3) ... [2023-05-04 20:58:34,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5dbf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:58:34, skipping insertion in model container [2023-05-04 20:58:34,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:33" (2/3) ... [2023-05-04 20:58:34,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5dbf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:58:34, skipping insertion in model container [2023-05-04 20:58:34,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:58:34" (3/3) ... [2023-05-04 20:58:34,373 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-05-04 20:58:34,378 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 20:58:34,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 20:58:34,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 20:58:34,385 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 20:58:34,478 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 20:58:34,520 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:58:34,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 20:58:34,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:34,521 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 20:58:34,522 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 20:58:34,545 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 20:58:34,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 20:58:34,561 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;@5d18ad08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:58:34,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 20:58:34,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 357298438, now seen corresponding path program 1 times [2023-05-04 20:58:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:34,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072051572] [2023-05-04 20:58:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 20:58:35,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:35,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072051572] [2023-05-04 20:58:35,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072051572] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:35,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:35,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 20:58:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703996511] [2023-05-04 20:58:35,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 20:58:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:35,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 20:58:35,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 20:58:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,130 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:35,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 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 20:58:35,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 20:58:35,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1548581375, now seen corresponding path program 1 times [2023-05-04 20:58:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:35,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157261616] [2023-05-04 20:58:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:35,591 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 20:58:35,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157261616] [2023-05-04 20:58:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157261616] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:35,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:35,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 20:58:35,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273945005] [2023-05-04 20:58:35,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:35,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 20:58:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:35,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 20:58:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 20:58:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:35,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 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 20:58:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:35,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 20:58:35,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1816497905, now seen corresponding path program 1 times [2023-05-04 20:58:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300436621] [2023-05-04 20:58:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 20:58:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:36,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300436621] [2023-05-04 20:58:36,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300436621] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:36,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:36,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 20:58:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468037442] [2023-05-04 20:58:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:36,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 20:58:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:36,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 20:58:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-04 20:58:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:36,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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 20:58:36,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 20:58:36,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash -184606544, now seen corresponding path program 1 times [2023-05-04 20:58:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:36,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355953199] [2023-05-04 20:58:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 20:58:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355953199] [2023-05-04 20:58:36,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355953199] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:36,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:36,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 20:58:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033830525] [2023-05-04 20:58:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:36,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 20:58:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 20:58:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 20:58:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:36,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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 20:58:36,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 20:58:36,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 870181873, now seen corresponding path program 1 times [2023-05-04 20:58:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466929663] [2023-05-04 20:58:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 20:58:36,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:36,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466929663] [2023-05-04 20:58:36,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466929663] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:36,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:36,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 20:58:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003945010] [2023-05-04 20:58:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:36,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 20:58:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 20:58:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 20:58:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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 20:58:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 20:58:36,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 12286674, now seen corresponding path program 1 times [2023-05-04 20:58:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:36,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84809078] [2023-05-04 20:58:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:58:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84809078] [2023-05-04 20:58:36,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84809078] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:36,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:36,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 20:58:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164773733] [2023-05-04 20:58:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:36,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 20:58:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 20:58:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-04 20:58:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:36,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 20:58:36,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2095765197, now seen corresponding path program 1 times [2023-05-04 20:58:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657590441] [2023-05-04 20:58:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:58:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:36,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657590441] [2023-05-04 20:58:36,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657590441] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:36,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 20:58:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440799923] [2023-05-04 20:58:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:36,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 20:58:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:36,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 20:58:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 20:58:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,838 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:36,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 20:58:36,886 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -814165196, now seen corresponding path program 1 times [2023-05-04 20:58:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:36,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102390136] [2023-05-04 20:58:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:58:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:37,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102390136] [2023-05-04 20:58:37,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102390136] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:37,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:37,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 20:58:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868111728] [2023-05-04 20:58:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:37,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 20:58:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 20:58:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 20:58:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:37,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 20:58:37,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 755704021, now seen corresponding path program 1 times [2023-05-04 20:58:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441986007] [2023-05-04 20:58:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:58:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441986007] [2023-05-04 20:58:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441986007] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-05-04 20:58:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782824257] [2023-05-04 20:58:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:37,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-04 20:58:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-04 20:58:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-05-04 20:58:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:37,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 14 states have internal predecessors, (260), 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 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 20:58:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:58:37,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 20:58:37,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 20:58:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2024229608, now seen corresponding path program 1 times [2023-05-04 20:58:37,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:37,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821029226] [2023-05-04 20:58:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 20:58:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821029226] [2023-05-04 20:58:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821029226] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596829818] [2023-05-04 20:58:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:47,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:47,787 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 20:58:47,790 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 20:58:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:47,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 126 conjunts are in the unsatisfiable core [2023-05-04 20:58:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:48,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:49,366 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:58:49,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 20:58:49,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 20:58:50,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 20:58:50,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 20:58:50,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 20:58:51,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-05-04 20:58:51,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 20:58:51,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-05-04 20:58:51,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:51,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 20:58:51,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-05-04 20:58:51,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 20:58:57,520 INFO L356 Elim1Store]: treesize reduction 161, result has 29.7 percent of original size [2023-05-04 20:58:57,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 183 treesize of output 142 [2023-05-04 20:58:57,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:58:57,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2023-05-04 20:58:57,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:58:57,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:58:57,548 INFO L356 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2023-05-04 20:58:57,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 91 [2023-05-04 20:58:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 20:58:57,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:59:18,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|thread1Thread1of1ForFork1_~i~0#1| Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537))) (let ((.cse11 (select .cse4 ~A~0.base)) (.cse10 (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (.cse9 (select .cse4 ~B~0.base)) (.cse12 (* |thread3Thread1of1ForFork0_~i~2#1| 4))) (let ((.cse2 (select .cse9 (+ .cse12 ~B~0.offset))) (.cse0 (select .cse11 (+ .cse10 ~A~0.offset))) (.cse3 (select .cse11 (+ .cse12 ~A~0.offset))) (.cse1 (select .cse9 (+ .cse10 ~B~0.offset)))) (or (< c_~maxA~0 (+ .cse0 1)) (< c_~maxB~0 (+ .cse1 1)) (< c_~maxB~0 (+ .cse2 1)) (< .cse3 0) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~mult~0.base)) (.cse7 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_539) c_~mult~0.base))) (= (+ c_~res1~0 (let ((.cse6 (+ c_~mult~0.offset (* .cse0 4)))) (select (select .cse4 (select .cse5 .cse6)) (+ (select .cse7 .cse6) (* .cse1 4))))) (+ c_~res2~0 (let ((.cse8 (+ (* .cse3 4) c_~mult~0.offset))) (select (select .cse4 (select .cse5 .cse8)) (+ (* 4 .cse2) (select .cse7 .cse8))))))) (< .cse2 0) (< .cse0 0) (< c_~maxA~0 (+ .cse3 1)) (< .cse1 0)))))) is different from false [2023-05-04 20:59:18,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork1_~i~0#1| Int) (~B~0.base Int) (~A~0.base Int) (~A~0.offset Int) (v_ArrVal_535 (Array Int Int)) (|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (~B~0.offset Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537))) (let ((.cse10 (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (.cse11 (select .cse0 ~A~0.base)) (.cse9 (select .cse0 ~B~0.base)) (.cse12 (* |thread3Thread1of1ForFork0_~i~2#1| 4))) (let ((.cse7 (select .cse9 (+ .cse12 ~B~0.offset))) (.cse8 (select .cse11 (+ .cse12 ~A~0.offset))) (.cse5 (select .cse11 (+ .cse10 ~A~0.offset))) (.cse3 (select .cse9 (+ .cse10 ~B~0.offset)))) (or (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~mult~0.base)) (.cse4 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_539) c_~mult~0.base))) (= (+ (let ((.cse2 (+ (* .cse5 4) c_~mult~0.offset))) (select (select .cse0 (select .cse1 .cse2)) (+ (* 4 .cse3) (select .cse4 .cse2)))) c_~res1~0) (+ c_~res2~0 (let ((.cse6 (+ (* .cse8 4) c_~mult~0.offset))) (select (select .cse0 (select .cse1 .cse6)) (+ (* .cse7 4) (select .cse4 .cse6))))))) (< c_~maxB~0 (+ .cse7 1)) (< c_~maxA~0 (+ .cse5 1)) (< .cse7 0) (< c_~maxA~0 (+ .cse8 1)) (< .cse8 0) (< c_~maxB~0 (+ .cse3 1)) (< .cse5 0) (< .cse3 0)))))) is different from false [2023-05-04 20:59:18,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork1_~i~0#1| Int) (~B~0.base Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (~A~0.base Int) (v_ArrVal_532 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_535 (Array Int Int)) (|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (~B~0.offset Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537))) (let ((.cse10 (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (.cse9 (select .cse4 ~A~0.base)) (.cse11 (select .cse4 ~B~0.base)) (.cse12 (* |thread3Thread1of1ForFork0_~i~2#1| 4))) (let ((.cse0 (select .cse11 (+ .cse12 ~B~0.offset))) (.cse1 (select .cse9 (+ .cse12 ~A~0.offset))) (.cse3 (select .cse11 (+ .cse10 ~B~0.offset))) (.cse2 (select .cse9 (+ .cse10 ~A~0.offset)))) (or (< c_~maxB~0 (+ .cse0 1)) (< c_~maxA~0 (+ .cse1 1)) (< .cse0 0) (< c_~maxA~0 (+ .cse2 1)) (< c_~maxB~0 (+ .cse3 1)) (< .cse1 0) (let ((.cse5 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~mult~0.base)) (.cse7 (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_539) c_~mult~0.base))) (= (+ c_~res1~0 (let ((.cse6 (+ c_~mult~0.offset (* .cse2 4)))) (select (select .cse4 (select .cse5 .cse6)) (+ (select .cse7 .cse6) (* .cse3 4))))) (+ (let ((.cse8 (+ c_~mult~0.offset (* .cse1 4)))) (select (select .cse4 (select .cse5 .cse8)) (+ (* .cse0 4) (select .cse7 .cse8)))) c_~res2~0))) (< .cse3 0) (< .cse2 0)))))) is different from false [2023-05-04 20:59:19,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork1_~i~0#1| Int) (~B~0.base Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (~A~0.base Int) (v_ArrVal_532 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_535 (Array Int Int)) (|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (~B~0.offset Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537))) (let ((.cse10 (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (.cse9 (select .cse3 ~A~0.base)) (.cse11 (select .cse3 ~B~0.base)) (.cse12 (* |thread3Thread1of1ForFork0_~i~2#1| 4))) (let ((.cse0 (select .cse11 (+ .cse12 ~B~0.offset))) (.cse1 (select .cse9 (+ .cse12 ~A~0.offset))) (.cse2 (select .cse11 (+ .cse10 ~B~0.offset))) (.cse7 (select .cse9 (+ .cse10 ~A~0.offset)))) (or (< c_~maxB~0 (+ .cse0 1)) (< .cse0 0) (< |c_ULTIMATE.start_main_~i~3#1| (+ .cse1 1)) (< c_~maxB~0 (+ .cse2 1)) (< .cse1 0) (let ((.cse4 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~mult~0.base)) (.cse6 (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_539) c_~mult~0.base))) (= (+ c_~res1~0 (let ((.cse5 (+ c_~mult~0.offset (* .cse7 4)))) (select (select .cse3 (select .cse4 .cse5)) (+ (select .cse6 .cse5) (* .cse2 4))))) (+ (let ((.cse8 (+ c_~mult~0.offset (* .cse1 4)))) (select (select .cse3 (select .cse4 .cse8)) (+ (* .cse0 4) (select .cse6 .cse8)))) c_~res2~0))) (< .cse2 0) (< .cse7 0) (< |c_ULTIMATE.start_main_~i~3#1| (+ .cse7 1))))))) is different from false [2023-05-04 20:59:20,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork1_~i~0#1| Int) (~B~0.base Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (~A~0.base Int) (v_ArrVal_532 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_535 (Array Int Int)) (|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (~B~0.offset Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537))) (let ((.cse10 (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (.cse9 (select .cse4 ~A~0.base)) (.cse11 (select .cse4 ~B~0.base)) (.cse12 (* |thread3Thread1of1ForFork0_~i~2#1| 4))) (let ((.cse1 (select .cse11 (+ .cse12 ~B~0.offset))) (.cse3 (select .cse9 (+ .cse12 ~A~0.offset))) (.cse2 (select .cse11 (+ .cse10 ~B~0.offset))) (.cse0 (select .cse9 (+ .cse10 ~A~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse0) (< c_~maxB~0 (+ .cse1 1)) (< .cse1 0) (< c_~maxB~0 (+ .cse2 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse3) (< .cse3 0) (let ((.cse5 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~mult~0.base)) (.cse7 (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_539) c_~mult~0.base))) (= (+ c_~res1~0 (let ((.cse6 (+ c_~mult~0.offset (* .cse0 4)))) (select (select .cse4 (select .cse5 .cse6)) (+ (select .cse7 .cse6) (* .cse2 4))))) (+ (let ((.cse8 (+ c_~mult~0.offset (* .cse3 4)))) (select (select .cse4 (select .cse5 .cse8)) (+ (* .cse1 4) (select .cse7 .cse8)))) c_~res2~0))) (< .cse2 0) (< .cse0 0)))))) is different from false [2023-05-04 20:59:20,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 272 [2023-05-04 20:59:20,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 248 [2023-05-04 20:59:20,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14306 treesize of output 13966 [2023-05-04 20:59:20,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99842 treesize of output 96366 [2023-05-04 20:59:20,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96246 treesize of output 82986 [2023-05-04 20:59:20,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82934 treesize of output 76330 [2023-05-04 20:59:20,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76278 treesize of output 73002 [2023-05-04 20:59:20,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36475 treesize of output 33200 [2023-05-04 20:59:20,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69622 treesize of output 63018 [2023-05-04 20:59:20,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 20:59:20,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62966 treesize of output 49706 Received shutdown request... [2023-05-04 21:12:10,191 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 21:12:10,195 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 21:12:10,199 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 21:12:10,208 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 21:12:10,216 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 21:12:10,416 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,SelfDestructingSolverStorable9 [2023-05-04 21:12:10,416 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 268 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-13-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2023-05-04 21:12:10,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 21:12:10,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 21:12:10,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 21:12:10,421 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 21:12:10,423 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 21:12:10,423 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 21:12:10,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 09:12:10 BasicIcfg [2023-05-04 21:12:10,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 21:12:10,425 INFO L158 Benchmark]: Toolchain (without parser) took 817076.86ms. Allocated memory was 188.7MB in the beginning and 824.2MB in the end (delta: 635.4MB). Free memory was 131.8MB in the beginning and 565.6MB in the end (delta: -433.8MB). Peak memory consumption was 492.1MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,426 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 148.3MB in the beginning and 148.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 21:12:10,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.87ms. Allocated memory was 188.7MB in the beginning and 231.7MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 203.5MB in the end (delta: -72.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.46ms. Allocated memory is still 231.7MB. Free memory was 203.5MB in the beginning and 200.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,426 INFO L158 Benchmark]: Boogie Preprocessor took 37.69ms. Allocated memory is still 231.7MB. Free memory was 200.5MB in the beginning and 198.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,427 INFO L158 Benchmark]: RCFGBuilder took 656.32ms. Allocated memory is still 231.7MB. Free memory was 197.8MB in the beginning and 145.3MB in the end (delta: 52.5MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,428 INFO L158 Benchmark]: TraceAbstraction took 816057.12ms. Allocated memory was 231.7MB in the beginning and 824.2MB in the end (delta: 592.4MB). Free memory was 144.3MB in the beginning and 565.6MB in the end (delta: -421.3MB). Peak memory consumption was 462.9MB. Max. memory is 8.0GB. [2023-05-04 21:12:10,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 148.3MB in the beginning and 148.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.87ms. Allocated memory was 188.7MB in the beginning and 231.7MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 203.5MB in the end (delta: -72.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.46ms. Allocated memory is still 231.7MB. Free memory was 203.5MB in the beginning and 200.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.69ms. Allocated memory is still 231.7MB. Free memory was 200.5MB in the beginning and 198.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 656.32ms. Allocated memory is still 231.7MB. Free memory was 197.8MB in the beginning and 145.3MB in the end (delta: 52.5MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * TraceAbstraction took 816057.12ms. Allocated memory was 231.7MB in the beginning and 824.2MB in the end (delta: 592.4MB). Free memory was 144.3MB in the beginning and 565.6MB in the end (delta: -421.3MB). Peak memory consumption was 462.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23287, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 935, dependent conditional: 921, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8789, independent: 8775, independent conditional: 0, independent unconditional: 8775, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8789, independent: 8773, independent conditional: 0, independent unconditional: 8773, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22366, independent: 13577, independent conditional: 0, independent unconditional: 13577, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8789, unknown conditional: 0, unknown unconditional: 8789] , Statistics on independence cache: Total cache size (in pairs): 8789, Positive cache size: 8775, Positive conditional cache size: 0, Positive unconditional cache size: 8775, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 921 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 332, Number of trivial persistent sets: 228, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9244, independent: 9230, independent conditional: 0, independent unconditional: 9230, 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: 23287, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 935, dependent conditional: 921, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 13122, independent unconditional: 9230, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22366, independent: 22352, independent conditional: 0, independent unconditional: 22352, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8789, independent: 8775, independent conditional: 0, independent unconditional: 8775, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8789, independent: 8773, independent conditional: 0, independent unconditional: 8773, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22366, independent: 13577, independent conditional: 0, independent unconditional: 13577, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8789, unknown conditional: 0, unknown unconditional: 8789] , Statistics on independence cache: Total cache size (in pairs): 8789, Positive cache size: 8775, Positive conditional cache size: 0, Positive unconditional cache size: 8775, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 921 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 268 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-13-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 268 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-13-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 268 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-13-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 268 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-13-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 429 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 815.9s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2187 NumberOfCodeBlocks, 2187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2178 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 39/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown