/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 05:45:01,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 05:45:01,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 05:45:01,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 05:45:01,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 05:45:01,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 05:45:01,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 05:45:01,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 05:45:01,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 05:45:01,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 05:45:01,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 05:45:01,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 05:45:01,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 05:45:01,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 05:45:01,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 05:45:01,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 05:45:01,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 05:45:01,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 05:45:01,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 05:45:01,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 05:45:01,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 05:45:01,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 05:45:01,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 05:45:01,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 05:45:01,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 05:45:01,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 05:45:01,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 05:45:01,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 05:45:01,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 05:45:01,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 05:45:01,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 05:45:01,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 05:45:01,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 05:45:01,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 05:45:01,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 05:45:01,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 05:45:01,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 05:45:01,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 05:45:01,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 05:45:01,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 05:45:01,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 05:45:01,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 05:45:01,761 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 05:45:01,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 05:45:01,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 05:45:01,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 05:45:01,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 05:45:01,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 05:45:01,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 05:45:01,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 05:45:01,764 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 05:45:01,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 05:45:01,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 05:45:01,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 05:45:01,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 05:45:01,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 05:45:01,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 05:45:01,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 05:45:01,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 05:45:01,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 05:45:01,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 05:45:01,768 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 05:45:01,769 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 05:45:01,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-20 05:45:02,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 05:45:02,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 05:45:02,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 05:45:02,033 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 05:45:02,034 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 05:45:02,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-05-20 05:45:02,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cac5e5d/b28cbd17bf5743adbe3bec496191a976/FLAG8e5087eec [2023-05-20 05:45:02,459 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 05:45:02,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-05-20 05:45:02,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cac5e5d/b28cbd17bf5743adbe3bec496191a976/FLAG8e5087eec [2023-05-20 05:45:02,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cac5e5d/b28cbd17bf5743adbe3bec496191a976 [2023-05-20 05:45:02,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 05:45:02,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 05:45:02,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 05:45:02,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 05:45:02,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 05:45:02,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7d9240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02, skipping insertion in model container [2023-05-20 05:45:02,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 05:45:02,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 05:45:02,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2023-05-20 05:45:02,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 05:45:02,706 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 05:45:02,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2023-05-20 05:45:02,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 05:45:02,742 INFO L208 MainTranslator]: Completed translation [2023-05-20 05:45:02,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02 WrapperNode [2023-05-20 05:45:02,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 05:45:02,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 05:45:02,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 05:45:02,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 05:45:02,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,778 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-05-20 05:45:02,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 05:45:02,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 05:45:02,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 05:45:02,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 05:45:02,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 05:45:02,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 05:45:02,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 05:45:02,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 05:45:02,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (1/1) ... [2023-05-20 05:45:02,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 05:45:02,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:45:02,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 05:45:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 05:45:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 05:45:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 05:45:02,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 05:45:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 05:45:02,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 05:45:02,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 05:45:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 05:45:02,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 05:45:02,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 05:45:02,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 05:45:02,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 05:45:02,886 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 05:45:02,989 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 05:45:02,991 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 05:45:03,270 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 05:45:03,324 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 05:45:03,324 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-20 05:45:03,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 05:45:03 BoogieIcfgContainer [2023-05-20 05:45:03,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 05:45:03,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 05:45:03,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 05:45:03,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 05:45:03,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 05:45:02" (1/3) ... [2023-05-20 05:45:03,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5059870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 05:45:03, skipping insertion in model container [2023-05-20 05:45:03,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:45:02" (2/3) ... [2023-05-20 05:45:03,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5059870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 05:45:03, skipping insertion in model container [2023-05-20 05:45:03,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 05:45:03" (3/3) ... [2023-05-20 05:45:03,343 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-05-20 05:45:03,354 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 05:45:03,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 05:45:03,363 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 05:45:03,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 05:45:03,472 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 05:45:03,517 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 05:45:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 05:45:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:45:03,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-20 05:45:03,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 05:45:03,557 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 05:45:03,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 05:45:03,579 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;@f2d6427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 05:45:03,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-20 05:45:03,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 05:45:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:45:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 597181898, now seen corresponding path program 1 times [2023-05-20 05:45:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:45:03,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154911245] [2023-05-20 05:45:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:45:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 05:45:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:45:04,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154911245] [2023-05-20 05:45:04,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154911245] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:45:04,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:45:04,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 05:45:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087255699] [2023-05-20 05:45:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:45:04,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 05:45:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:45:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 05:45:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 05:45:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:45:04,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:45:04,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 05:45:04,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 05:45:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:45:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1873103334, now seen corresponding path program 1 times [2023-05-20 05:45:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:45:04,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045581805] [2023-05-20 05:45:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:04,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:45:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 05:45:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:45:04,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045581805] [2023-05-20 05:45:04,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045581805] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:45:04,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:45:04,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 05:45:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424877638] [2023-05-20 05:45:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:45:04,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 05:45:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:45:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 05:45:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-20 05:45:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:45:04,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:45:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 05:45:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 05:45:04,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 05:45:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:45:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1500375755, now seen corresponding path program 1 times [2023-05-20 05:45:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:45:04,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209292201] [2023-05-20 05:45:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:45:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:45:05,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209292201] [2023-05-20 05:45:05,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209292201] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:45:05,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490038011] [2023-05-20 05:45:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:45:05,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:45:05,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:45:05,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 05:45:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:05,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 05:45:05,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:45:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:05,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:45:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:05,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490038011] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 05:45:05,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 05:45:05,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2023-05-20 05:45:05,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123579118] [2023-05-20 05:45:05,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 05:45:05,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-20 05:45:05,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:45:05,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-20 05:45:05,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2023-05-20 05:45:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:05,982 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:45:05,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.037037037037036) internal successors, (244), 27 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:45:05,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:05,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 05:45:05,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 05:45:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-20 05:45:06,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 05:45:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 05:45:06,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 05:45:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:45:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1865252453, now seen corresponding path program 1 times [2023-05-20 05:45:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:45:06,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879738523] [2023-05-20 05:45:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:45:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:07,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:45:07,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879738523] [2023-05-20 05:45:07,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879738523] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:45:07,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885251715] [2023-05-20 05:45:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:45:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:45:07,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:45:07,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 05:45:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:07,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2023-05-20 05:45:07,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:45:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:07,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:45:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:07,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885251715] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 05:45:07,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 05:45:07,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2023-05-20 05:45:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059451383] [2023-05-20 05:45:07,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 05:45:07,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-20 05:45:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:45:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-20 05:45:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-05-20 05:45:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:07,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:45:07,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:45:07,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:07,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 05:45:07,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-20 05:45:07,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:45:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 05:45:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-20 05:45:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-20 05:45:08,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 05:45:08,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:45:08,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 05:45:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:45:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 851205376, now seen corresponding path program 2 times [2023-05-20 05:45:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:45:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599676884] [2023-05-20 05:45:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:45:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:45:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:45:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:45:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599676884] [2023-05-20 05:45:13,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599676884] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:45:13,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508204430] [2023-05-20 05:45:13,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 05:45:13,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:45:13,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:45:13,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:45:13,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 05:45:13,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 05:45:13,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 05:45:13,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2023-05-20 05:45:13,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:45:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 05:45:15,176 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 47 treesize of output 45 [2023-05-20 05:45:17,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:45:17,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 190 treesize of output 190 [2023-05-20 05:45:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:45:21,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:45:29,445 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse18 (= c_~max1~0 c_~max2~0)) (.cse4 (< c_~max2~0 c_~max3~0)) (.cse30 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse0 c_~max2~0) (= .cse1 .cse0) (not (< c_~max3~0 .cse0))))) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< c_~max3~0 (select .cse2 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))))) (not (< c_~max1~0 .cse1)))))) (or .cse4 (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse6 (select .cse5 .cse3))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse5 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse5 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= c_~max2~0 .cse6) (not (< c_~max1~0 .cse6))))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (let ((.cse7 (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse8 (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse7 .cse8)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse8 c_~max2~0) (= .cse9 .cse8)))) (not (< c_~max3~0 .cse7))))) (not (< c_~max1~0 .cse9)))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (or (< c_~max1~0 (select .cse11 .cse3)) (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (let ((.cse12 (select .cse11 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< .cse12 (select .cse11 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (= c_~max1~0 .cse12) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse12 c_~max2~0) (not (< c_~max3~0 .cse12)))))))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< .cse13 (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (= .cse15 .cse13) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse13 c_~max2~0) (not (< c_~max3~0 .cse13))))))) (not (< c_~max1~0 .cse15)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse17 (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< c_~max1~0 (select .cse16 .cse3)) (< c_~max2~0 .cse17) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (not (< c_~max3~0 .cse17)))))) .cse18) (or .cse18 (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse20 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse19 .cse3)) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse20 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max2~0 .cse20) (not (< c_~max3~0 .cse20))))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse22 (select .cse21 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse23 (select .cse21 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse21 .cse3)) (< c_~max2~0 .cse22) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse23 .cse22)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (not (< c_~max3~0 .cse23)))))) .cse18) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (or (< c_~max1~0 (select .cse24 .cse3)) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse25 (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse25 c_~max2~0) (= c_~max1~0 .cse25) (not (< c_~max3~0 .cse25)))))))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse26 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse27 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max2~0 .cse26) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse27 .cse26)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (not (< c_~max3~0 .cse27))))) (= c_~max2~0 .cse29) (not (< c_~max1~0 .cse29)))))) (or .cse30 (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse32 (select .cse31 .cse3))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= c_~max3~0 .cse32) (not (< c_~max1~0 .cse32))))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse35 (select .cse34 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse33 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max2~0 .cse33) (not (< c_~max3~0 .cse33))))) (= c_~max2~0 .cse35) (not (< c_~max1~0 .cse35)))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse38 (select .cse37 .cse3))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< c_~max2~0 .cse36) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse37 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (not (< c_~max3~0 .cse36))))) (= c_~max2~0 .cse38) (not (< c_~max1~0 .cse38)))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (or (< c_~max1~0 (select .cse39 .cse3)) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int)) (let ((.cse40 (select .cse39 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (forall ((v_thread3Thread1of1ForFork1_~i~2_23 Int)) (let ((.cse41 (select .cse39 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse40 .cse41)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse41 c_~max2~0) (= c_~max1~0 .cse41)))) (not (< c_~max3~0 .cse40)))))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (or (< c_~max1~0 (select .cse42 .cse3)) (not (<= v_thread3Thread1of1ForFork1_~i~2_24 c_~M~0)) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse42 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse42 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))))) (and (or .cse18 .cse4) (or (= c_~max1~0 c_~max3~0) .cse30))))) is different from false [2023-05-20 05:45:33,852 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (<= c_~max3~0 c_~max2~0)) (.cse18 (= c_~max1~0 c_~max2~0)) (.cse26 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4))) (and (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (.cse2 (select .cse1 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse0 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max2~0 .cse0) (= c_~max2~0 .cse2) (not (< c_~max3~0 .cse0)) (not (< c_~max1~0 .cse2)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse4 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse5 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (.cse6 (select .cse7 .cse3))) (or (< c_~max2~0 .cse4) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse5 .cse4)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (= c_~max2~0 .cse6) (not (< c_~max3~0 .cse5)) (not (< c_~max1~0 .cse6)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse10 (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse9 (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse8 .cse3)) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse9 .cse10)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse10 c_~max2~0) (= c_~max1~0 .cse10) (not (< c_~max3~0 .cse9)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse11 (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (.cse13 (select .cse12 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse11 (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (= .cse13 .cse11) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse11 c_~max2~0) (not (< c_~max3~0 .cse11)) (not (< c_~max1~0 .cse13)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse15 (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse14 .cse3)) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse15 (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (= c_~max1~0 .cse15) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse15 c_~max2~0) (not (< c_~max3~0 .cse15)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse17 (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< c_~max1~0 (select .cse16 .cse3)) (< c_~max2~0 .cse17) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (not (< c_~max3~0 .cse17)))))) .cse18) (or .cse19 (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= c_~max3~0 .cse21) (not (< c_~max1~0 .cse21))))))) (or .cse18 (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse23 (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse24 (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse22 .cse3)) (< c_~max2~0 .cse23) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse24 .cse23)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (not (< c_~max3~0 .cse24))))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (or (< c_~max1~0 (select .cse25 .cse3)) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse25 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse25 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))))) (and (or .cse18 .cse26) (or (= c_~max1~0 c_~max3~0) .cse19))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse27 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse29 (select .cse28 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse27 c_~max2~0) (< c_~max3~0 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= .cse29 .cse27) (not (< c_~max3~0 .cse27)) (not (< c_~max1~0 .cse29)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse31 (select .cse33 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse30 (select .cse33 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (.cse32 (select .cse33 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (not (< .cse30 .cse31)) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse31 c_~max2~0) (= .cse32 .cse31) (not (< c_~max3~0 .cse30)) (not (< c_~max1~0 .cse32)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse35 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4))))) (or (< c_~max1~0 (select .cse34 .cse3)) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< .cse35 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max2~0 .cse35) (not (< c_~max3~0 .cse35)))))) .cse18) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse37 (select .cse36 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4))))) (or (< c_~max1~0 (select .cse36 .cse3)) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (<= .cse37 c_~max2~0) (< c_~max3~0 (select .cse36 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= c_~max1~0 .cse37) (not (< c_~max3~0 .cse37)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse39 (select .cse38 .cse3))) (or (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< c_~max3~0 (select .cse38 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse38 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (= c_~max2~0 .cse39) (not (< c_~max1~0 .cse39)))))) .cse26) (forall ((v_thread3Thread1of1ForFork1_~i~2_24 Int) (v_thread3Thread1of1ForFork1_~i~2_23 Int) (v_ArrVal_133 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse40 (select .cse41 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_23 4)))) (.cse42 (select .cse41 .cse3))) (or (< c_~max2~0 .cse40) (< 0 v_thread3Thread1of1ForFork1_~i~2_24) (< (+ v_thread3Thread1of1ForFork1_~i~2_23 1) c_~N~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_24 1) v_thread3Thread1of1ForFork1_~i~2_23) (< c_~max3~0 (select .cse41 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_24 4)))) (not (< c_~max3~0 .cse40)) (= c_~max2~0 .cse42) (not (< c_~max1~0 .cse42)))))))) is different from false [2023-05-20 05:46:34,956 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 2077 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-05-20 05:46:34,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:34,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 32 select indices, 32 select index equivalence classes, 0 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 496 case distinctions, treesize of input 2532 treesize of output 7853 [2023-05-20 05:46:36,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:36,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1830 treesize of output 1852 [2023-05-20 05:46:38,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:38,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1811 treesize of output 1821 [2023-05-20 05:46:40,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:40,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1780 treesize of output 1790 [2023-05-20 05:46:42,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:42,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1749 treesize of output 1746 [2023-05-20 05:46:43,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:43,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1705 treesize of output 1702 [2023-05-20 05:46:45,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:45,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1661 treesize of output 1676 [2023-05-20 05:46:47,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:47,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1635 treesize of output 1638 [2023-05-20 05:46:49,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:49,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1597 treesize of output 1612 [2023-05-20 05:46:51,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:51,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1571 treesize of output 1575 [2023-05-20 05:46:52,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:52,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1534 treesize of output 1544 [2023-05-20 05:46:54,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:54,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1503 treesize of output 1506 [2023-05-20 05:46:56,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:56,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1465 treesize of output 1474 [2023-05-20 05:46:58,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:46:58,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1433 treesize of output 1436 [2023-05-20 05:47:00,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:47:00,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1395 treesize of output 1411 [2023-05-20 05:47:02,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:47:02,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1370 treesize of output 1374 Received shutdown request... [2023-05-20 05:59:02,693 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 05:59:02,694 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 05:59:02,693 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 05:59:02,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-20 05:59:02,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 05:59:02,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:59:02,978 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-537-7-11-9-2-1 context. [2023-05-20 05:59:02,979 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-20 05:59:02,979 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-20 05:59:02,979 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-20 05:59:02,983 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-05-20 05:59:02,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 05:59:02,986 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 05:59:02,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 05:59:02 BasicIcfg [2023-05-20 05:59:02,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 05:59:02,989 INFO L158 Benchmark]: Toolchain (without parser) took 840509.14ms. Allocated memory was 184.5MB in the beginning and 770.7MB in the end (delta: 586.2MB). Free memory was 151.7MB in the beginning and 284.4MB in the end (delta: -132.7MB). Peak memory consumption was 492.2MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,989 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 05:59:02,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.02ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 151.4MB in the beginning and 219.7MB in the end (delta: -68.3MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.28ms. Allocated memory is still 251.7MB. Free memory was 219.4MB in the beginning and 217.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,989 INFO L158 Benchmark]: Boogie Preprocessor took 44.24ms. Allocated memory is still 251.7MB. Free memory was 217.6MB in the beginning and 216.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,990 INFO L158 Benchmark]: RCFGBuilder took 502.65ms. Allocated memory is still 251.7MB. Free memory was 216.0MB in the beginning and 195.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,990 INFO L158 Benchmark]: TraceAbstraction took 839658.83ms. Allocated memory was 251.7MB in the beginning and 770.7MB in the end (delta: 519.0MB). Free memory was 194.6MB in the beginning and 284.4MB in the end (delta: -89.8MB). Peak memory consumption was 468.3MB. Max. memory is 8.0GB. [2023-05-20 05:59:02,992 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.11ms. Allocated memory is still 184.5MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.02ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 151.4MB in the beginning and 219.7MB in the end (delta: -68.3MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.28ms. Allocated memory is still 251.7MB. Free memory was 219.4MB in the beginning and 217.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.24ms. Allocated memory is still 251.7MB. Free memory was 217.6MB in the beginning and 216.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 502.65ms. Allocated memory is still 251.7MB. Free memory was 216.0MB in the beginning and 195.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 839658.83ms. Allocated memory was 251.7MB in the beginning and 770.7MB in the end (delta: 519.0MB). Free memory was 194.6MB in the beginning and 284.4MB in the end (delta: -89.8MB). Peak memory consumption was 468.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1930, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 204, dependent conditional: 191, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1744, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1744, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 7, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1294, independent: 1281, independent conditional: 0, independent unconditional: 1281, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1294, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1751, independent: 445, independent conditional: 0, independent unconditional: 445, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1294, unknown conditional: 0, unknown unconditional: 1294] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1281, Positive conditional cache size: 0, Positive unconditional cache size: 1281, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 3, Independence queries for same thread: 186 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 154, Number of trivial persistent sets: 121, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1432, independent: 1419, independent conditional: 0, independent unconditional: 1419, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1930, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 204, dependent conditional: 191, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1744, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1744, independent: 1726, independent conditional: 307, independent unconditional: 1419, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 7, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1751, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1294, independent: 1281, independent conditional: 0, independent unconditional: 1281, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1294, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1751, independent: 445, independent conditional: 0, independent unconditional: 445, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1294, unknown conditional: 0, unknown unconditional: 1294] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1281, Positive conditional cache size: 0, Positive unconditional cache size: 1281, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 3, Independence queries for same thread: 186 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-537-7-11-9-2-1 context. - TimeoutResultAtElement [Line: 93]: 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-537-7-11-9-2-1 context. - TimeoutResultAtElement [Line: 92]: 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-537-7-11-9-2-1 context. - TimeoutResultAtElement [Line: 94]: 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-537-7-11-9-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 839.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.6s, 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: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 2696 SizeOfPredicates, 21 NumberOfNonLiveVariables, 592 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 61/89 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