/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 LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 12:18:38,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 12:18:38,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 12:18:38,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 12:18:38,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 12:18:38,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 12:18:38,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 12:18:38,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 12:18:38,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 12:18:38,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 12:18:38,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 12:18:38,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 12:18:38,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 12:18:38,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 12:18:38,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 12:18:38,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 12:18:38,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 12:18:38,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 12:18:38,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 12:18:38,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 12:18:38,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 12:18:38,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 12:18:38,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 12:18:38,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 12:18:39,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 12:18:39,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 12:18:39,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 12:18:39,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 12:18:39,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 12:18:39,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 12:18:39,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 12:18:39,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 12:18:39,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 12:18:39,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 12:18:39,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 12:18:39,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 12:18:39,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 12:18:39,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 12:18:39,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 12:18:39,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 12:18:39,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 12:18:39,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 12:18:39,033 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 12:18:39,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 12:18:39,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 12:18:39,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 12:18:39,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 12:18:39,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 12:18:39,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 12:18:39,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 12:18:39,034 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 12:18:39,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 12:18:39,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 12:18:39,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 12:18:39,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 12:18:39,036 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 12:18:39,037 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 12:18:39,037 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 -> LOOP [2023-05-04 12:18:39,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 12:18:39,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 12:18:39,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 12:18:39,233 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 12:18:39,234 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 12:18:39,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 12:18:39,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4ee59da/d35f78f39a9e478fb0ed09274f48f9c3/FLAGa69d31b02 [2023-05-04 12:18:39,603 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 12:18:39,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 12:18:39,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4ee59da/d35f78f39a9e478fb0ed09274f48f9c3/FLAGa69d31b02 [2023-05-04 12:18:40,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4ee59da/d35f78f39a9e478fb0ed09274f48f9c3 [2023-05-04 12:18:40,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 12:18:40,015 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 12:18:40,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 12:18:40,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 12:18:40,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 12:18:40,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6438ba20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40, skipping insertion in model container [2023-05-04 12:18:40,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 12:18:40,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 12:18:40,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-04 12:18:40,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 12:18:40,218 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 12:18:40,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-04 12:18:40,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 12:18:40,257 INFO L208 MainTranslator]: Completed translation [2023-05-04 12:18:40,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40 WrapperNode [2023-05-04 12:18:40,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 12:18:40,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 12:18:40,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 12:18:40,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 12:18:40,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,313 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2023-05-04 12:18:40,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 12:18:40,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 12:18:40,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 12:18:40,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 12:18:40,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 12:18:40,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 12:18:40,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 12:18:40,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 12:18:40,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (1/1) ... [2023-05-04 12:18:40,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 12:18:40,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:40,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 12:18:40,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 12:18:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 12:18:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 12:18:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 12:18:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 12:18:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 12:18:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 12:18:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 12:18:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 12:18:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 12:18:40,421 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 12:18:40,556 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 12:18:40,557 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 12:18:40,872 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 12:18:40,881 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 12:18:40,881 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 12:18:40,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 12:18:40 BoogieIcfgContainer [2023-05-04 12:18:40,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 12:18:40,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 12:18:40,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 12:18:40,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 12:18:40,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 12:18:40" (1/3) ... [2023-05-04 12:18:40,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71717d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 12:18:40, skipping insertion in model container [2023-05-04 12:18:40,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 12:18:40" (2/3) ... [2023-05-04 12:18:40,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71717d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 12:18:40, skipping insertion in model container [2023-05-04 12:18:40,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 12:18:40" (3/3) ... [2023-05-04 12:18:40,889 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 12:18:40,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 12:18:40,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 12:18:40,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 12:18:40,901 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 12:18:41,011 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 12:18:41,054 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 12:18:41,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 12:18:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:41,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 12:18:41,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 12:18:41,089 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 12:18:41,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 12:18:41,108 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;@713d9817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 12:18:41,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 12:18:41,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 902999447, now seen corresponding path program 1 times [2023-05-04 12:18:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:41,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424256468] [2023-05-04 12:18:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 12:18:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424256468] [2023-05-04 12:18:41,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424256468] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 12:18:41,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 12:18:41,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 12:18:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038800597] [2023-05-04 12:18:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 12:18:41,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 12:18:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 12:18:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 12:18:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:41,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:41,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:41,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 12:18:41,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1529966586, now seen corresponding path program 1 times [2023-05-04 12:18:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:41,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095596222] [2023-05-04 12:18:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 12:18:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:42,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095596222] [2023-05-04 12:18:42,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095596222] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 12:18:42,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 12:18:42,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 12:18:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517901303] [2023-05-04 12:18:42,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 12:18:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 12:18:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 12:18:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 12:18:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:42,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:42,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:42,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:42,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:42,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 12:18:42,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -950453085, now seen corresponding path program 1 times [2023-05-04 12:18:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:42,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417289406] [2023-05-04 12:18:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:42,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417289406] [2023-05-04 12:18:42,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417289406] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:42,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153648637] [2023-05-04 12:18:42,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:42,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:42,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:18:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 12:18:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:42,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 12:18:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:18:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:42,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:18:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:43,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153648637] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:43,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 12:18:43,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 12:18:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73460489] [2023-05-04 12:18:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 12:18:43,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 12:18:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 12:18:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 12:18:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:43,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:43,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:43,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:43,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:43,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:43,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 12:18:43,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 12:18:43,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -478342421, now seen corresponding path program 1 times [2023-05-04 12:18:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339594705] [2023-05-04 12:18:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339594705] [2023-05-04 12:18:43,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339594705] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68315209] [2023-05-04 12:18:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:43,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:18:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 12:18:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:43,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 12:18:43,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:18:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:44,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:18:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:44,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68315209] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:44,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 12:18:44,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 12:18:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919253621] [2023-05-04 12:18:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 12:18:44,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 12:18:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 12:18:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 12:18:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:44,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:44,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:44,581 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-04 12:18:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:44,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1174217631, now seen corresponding path program 1 times [2023-05-04 12:18:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:44,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052411792] [2023-05-04 12:18:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 12:18:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052411792] [2023-05-04 12:18:45,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052411792] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730827329] [2023-05-04 12:18:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:45,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:45,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:18:45,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 12:18:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:45,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 12:18:45,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:18:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 12:18:45,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:18:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 12:18:45,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730827329] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:45,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 12:18:45,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 12:18:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239231022] [2023-05-04 12:18:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 12:18:45,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 12:18:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 12:18:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 12:18:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:45,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:45,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:45,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:45,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:45,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 12:18:46,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:46,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1584432793, now seen corresponding path program 1 times [2023-05-04 12:18:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726685570] [2023-05-04 12:18:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726685570] [2023-05-04 12:18:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726685570] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636179783] [2023-05-04 12:18:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:46,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:18:46,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 12:18:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:46,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 12:18:46,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:18:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:47,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:18:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 12:18:47,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636179783] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 12:18:47,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 12:18:47,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 12:18:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660544600] [2023-05-04 12:18:47,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 12:18:47,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 12:18:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 12:18:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-04 12:18:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:47,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:47,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 24.583333333333332) internal successors, (590), 24 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 12:18:47,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 12:18:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:48,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1710536810, now seen corresponding path program 2 times [2023-05-04 12:18:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:48,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431206125] [2023-05-04 12:18:48,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:18:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 12:18:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:18:48,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431206125] [2023-05-04 12:18:48,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431206125] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:18:48,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144937125] [2023-05-04 12:18:48,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 12:18:48,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:48,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:18:48,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:18:48,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 12:18:48,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 12:18:48,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 12:18:48,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 12:18:48,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:18:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 12:18:49,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:18:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 12:18:49,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144937125] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 12:18:49,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 12:18:49,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 12:18:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319748663] [2023-05-04 12:18:49,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 12:18:49,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 12:18:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 12:18:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 12:18:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-04 12:18:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:49,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 12:18:49,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 25.25) internal successors, (606), 24 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 12:18:49,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 12:18:49,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 12:18:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 12:18:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 12:18:50,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 12:18:50,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:18:50,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 12:18:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 12:18:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash -277484008, now seen corresponding path program 3 times [2023-05-04 12:18:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 12:18:50,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428204575] [2023-05-04 12:18:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 12:18:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 12:18:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 12:19:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 12:19:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 12:19:03,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428204575] [2023-05-04 12:19:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428204575] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 12:19:03,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707551951] [2023-05-04 12:19:03,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 12:19:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:19:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 12:19:03,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 12:19:03,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 12:19:03,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 12:19:03,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 12:19:03,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 266 conjunts are in the unsatisfiable core [2023-05-04 12:19:03,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 12:19:03,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 12:19:05,258 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 12:19:05,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 12:19:07,188 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 12:19:07,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 12:19:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 12:19:11,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 12:19:12,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:12,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:12,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:12,801 INFO L356 Elim1Store]: treesize reduction 63, result has 19.2 percent of original size [2023-05-04 12:19:12,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 42 [2023-05-04 12:19:23,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 12:19:23,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 12:19:23,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:23,157 INFO L356 Elim1Store]: treesize reduction 206, result has 31.8 percent of original size [2023-05-04 12:19:23,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 142 treesize of output 189 [2023-05-04 12:19:26,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 12:19:26,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-05-04 12:19:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 12:19:27,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 12:20:51,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 c_~bsum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse0 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1))))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 c_~bsum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse13 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-04 12:20:52,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_#t~ret6#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (<= (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4) .cse0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_#t~ret6#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse13 (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17 1)))))))))))))) is different from false [2023-05-04 12:20:52,713 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (not (<= .cse0 2147483647)) (<= (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4) .cse0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< .cse13 (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17 1)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (not (<= .cse13 2147483647)))))))))))))) is different from false [2023-05-04 12:20:52,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_~b#1|))) (or (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1)) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse0 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_~b#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse13 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-04 12:21:04,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_#in~a#1|))) (or (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1)) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_#in~a#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-04 12:21:04,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_#t~mem5#1| c_~asum~0 c_~bsum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1))))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_#t~mem5#1| c_~asum~0 c_~bsum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-04 12:21:06,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 12:21:06,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 545100 treesize of output 476332 [2023-05-04 12:21:10,593 INFO L356 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2023-05-04 12:21:10,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2992652 treesize of output 2351787 [2023-05-04 12:21:31,762 WARN L233 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 7997 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:23:15,330 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 7993 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:23:31,848 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 7989 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:25:26,198 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7985 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:25:42,152 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 7981 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:03,397 WARN L233 SmtUtils]: Spent 13.64s on a formula simplification. DAG size of input: 7975 DAG size of output: 7971 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:15,586 WARN L233 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 4197 DAG size of output: 4193 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:25,457 WARN L233 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 2269 DAG size of output: 2269 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:38,470 WARN L233 SmtUtils]: Spent 11.52s on a formula simplification. DAG size of input: 2267 DAG size of output: 2267 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:47,133 WARN L233 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 2265 DAG size of output: 2265 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:26:56,337 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 2265 DAG size of output: 2265 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:27:11,038 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 2263 DAG size of output: 2263 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:27:19,421 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 2261 DAG size of output: 2261 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:27:29,640 WARN L233 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 2254 DAG size of output: 2254 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:27:51,377 WARN L233 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 1964 DAG size of output: 1964 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:28:10,107 WARN L233 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 1911 DAG size of output: 1911 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:28:25,029 WARN L233 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:28:38,562 WARN L233 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:28:46,750 WARN L233 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:28:55,251 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:29:15,797 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:29:55,829 WARN L233 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 1520 DAG size of output: 1520 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:30:31,774 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 1522 DAG size of output: 1522 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:30:42,858 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 1520 DAG size of output: 1520 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 12:31:10,568 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 1393 DAG size of output: 1393 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-04 12:33:03,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 12:33:03,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 12:33:03,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 12:33:03,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 12:33:03,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 12:33:04,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 12:33:04,185 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-04 12:33:04,187 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 12:33:04,187 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 12:33:04,187 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 12:33:04,191 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-05-04 12:33:04,193 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 12:33:04,193 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 12:33:04,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 12:33:04 BasicIcfg [2023-05-04 12:33:04,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 12:33:04,195 INFO L158 Benchmark]: Toolchain (without parser) took 864180.79ms. Allocated memory was 205.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 151.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 12:33:04,196 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 12:33:04,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.16ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 180.8MB in the end (delta: -29.1MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2023-05-04 12:33:04,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.27ms. Allocated memory is still 205.5MB. Free memory was 180.8MB in the beginning and 178.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 12:33:04,215 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 176.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 12:33:04,216 INFO L158 Benchmark]: RCFGBuilder took 526.95ms. Allocated memory is still 205.5MB. Free memory was 175.9MB in the beginning and 150.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-05-04 12:33:04,216 INFO L158 Benchmark]: TraceAbstraction took 863310.39ms. Allocated memory was 205.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 149.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 12:33:04,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.16ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 180.8MB in the end (delta: -29.1MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.27ms. Allocated memory is still 205.5MB. Free memory was 180.8MB in the beginning and 178.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 176.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 526.95ms. Allocated memory is still 205.5MB. Free memory was 175.9MB in the beginning and 150.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 863310.39ms. Allocated memory was 205.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 149.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43566, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 1034, dependent conditional: 1009, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 80, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19149, independent: 19123, independent conditional: 0, independent unconditional: 19123, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19149, independent: 19121, independent conditional: 0, independent unconditional: 19121, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 76, dependent conditional: 3, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42657, independent: 23409, independent conditional: 0, independent unconditional: 23409, dependent: 99, dependent conditional: 11, dependent unconditional: 88, unknown: 19149, unknown conditional: 1, unknown unconditional: 19148] , Statistics on independence cache: Total cache size (in pairs): 19149, Positive cache size: 19123, Positive conditional cache size: 0, Positive unconditional cache size: 19123, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 989 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1081, Number of trivial persistent sets: 818, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23624, independent: 23599, independent conditional: 0, independent unconditional: 23599, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43566, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 1034, dependent conditional: 1009, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 80, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19149, independent: 19123, independent conditional: 0, independent unconditional: 19123, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19149, independent: 19121, independent conditional: 0, independent unconditional: 19121, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 76, dependent conditional: 3, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42657, independent: 23409, independent conditional: 0, independent unconditional: 23409, dependent: 99, dependent conditional: 11, dependent unconditional: 88, unknown: 19149, unknown conditional: 1, unknown unconditional: 19148] , Statistics on independence cache: Total cache size (in pairs): 19149, Positive cache size: 19123, Positive conditional cache size: 0, Positive unconditional cache size: 19123, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 989 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 84]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 85]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 83]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 481 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 863.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.0s, 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: 65, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3738 NumberOfCodeBlocks, 3738 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 5400 ConstructedInterpolants, 0 QuantifiedInterpolants, 14987 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3291 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 929/961 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