/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-15 23:32:09,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 23:32:09,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 23:32:09,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 23:32:09,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 23:32:09,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 23:32:09,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 23:32:09,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 23:32:09,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 23:32:09,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 23:32:09,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 23:32:09,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 23:32:09,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 23:32:09,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 23:32:09,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 23:32:09,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 23:32:09,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 23:32:09,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 23:32:09,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 23:32:09,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 23:32:09,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 23:32:09,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 23:32:09,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 23:32:09,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 23:32:09,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 23:32:09,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 23:32:09,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 23:32:09,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 23:32:09,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 23:32:09,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 23:32:09,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 23:32:09,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 23:32:09,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 23:32:09,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 23:32:09,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 23:32:09,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 23:32:09,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 23:32:09,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 23:32:09,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 23:32:09,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 23:32:09,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 23:32:09,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-15 23:32:09,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 23:32:09,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 23:32:09,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 23:32:09,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 23:32:09,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 23:32:09,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 23:32:09,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 23:32:09,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 23:32:09,463 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 23:32:09,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 23:32:09,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 23:32:09,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 23:32:09,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 23:32:09,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 23:32:09,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 23:32:09,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 23:32:09,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 23:32:09,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:32:09,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 23:32:09,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 23:32:09,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 23:32:09,468 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 23:32:09,468 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 [2022-11-15 23:32:09,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 23:32:09,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 23:32:09,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 23:32:09,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 23:32:09,714 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 23:32:09,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-15 23:32:09,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb4b9cd2/6b694e1c2d324371a162a5ed23073184/FLAGbba1c0b8e [2022-11-15 23:32:10,152 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 23:32:10,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-15 23:32:10,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb4b9cd2/6b694e1c2d324371a162a5ed23073184/FLAGbba1c0b8e [2022-11-15 23:32:10,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb4b9cd2/6b694e1c2d324371a162a5ed23073184 [2022-11-15 23:32:10,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 23:32:10,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 23:32:10,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 23:32:10,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 23:32:10,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 23:32:10,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f32b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10, skipping insertion in model container [2022-11-15 23:32:10,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 23:32:10,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 23:32:10,747 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-15 23:32:10,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:32:10,760 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 23:32:10,779 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-15 23:32:10,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:32:10,792 INFO L208 MainTranslator]: Completed translation [2022-11-15 23:32:10,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10 WrapperNode [2022-11-15 23:32:10,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 23:32:10,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 23:32:10,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 23:32:10,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 23:32:10,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,832 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-15 23:32:10,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 23:32:10,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 23:32:10,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 23:32:10,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 23:32:10,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 23:32:10,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 23:32:10,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 23:32:10,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 23:32:10,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (1/1) ... [2022-11-15 23:32:10,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:32:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:10,893 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) [2022-11-15 23:32:10,899 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 [2022-11-15 23:32:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 23:32:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-15 23:32:10,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-15 23:32:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-15 23:32:10,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-15 23:32:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-15 23:32:10,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-15 23:32:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 23:32:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 23:32:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 23:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 23:32:10,929 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 23:32:11,014 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 23:32:11,016 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 23:32:11,268 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 23:32:11,366 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 23:32:11,367 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-15 23:32:11,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:11 BoogieIcfgContainer [2022-11-15 23:32:11,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 23:32:11,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 23:32:11,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 23:32:11,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 23:32:11,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:32:10" (1/3) ... [2022-11-15 23:32:11,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b45742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:11, skipping insertion in model container [2022-11-15 23:32:11,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:10" (2/3) ... [2022-11-15 23:32:11,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b45742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:11, skipping insertion in model container [2022-11-15 23:32:11,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:11" (3/3) ... [2022-11-15 23:32:11,387 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-15 23:32:11,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 23:32:11,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 23:32:11,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-15 23:32:11,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 23:32:11,493 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-15 23:32:11,532 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:32:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 23:32:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:11,539 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) [2022-11-15 23:32:11,550 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 [2022-11-15 23:32:11,586 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 23:32:11,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-15 23:32:11,603 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;@ff8a188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:32:11,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-15 23:32:11,879 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)] === [2022-11-15 23:32:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash 900810574, now seen corresponding path program 1 times [2022-11-15 23:32:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211956650] [2022-11-15 23:32:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211956650] [2022-11-15 23:32:12,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211956650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:32:12,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:32:12,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 23:32:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002543651] [2022-11-15 23:32:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:32:12,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 23:32:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 23:32:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 23:32:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:12,201 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:12,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 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) [2022-11-15 23:32:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:12,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 23:32:12,253 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)] === [2022-11-15 23:32:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash 5295436, now seen corresponding path program 1 times [2022-11-15 23:32:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:12,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421940570] [2022-11-15 23:32:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:12,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421940570] [2022-11-15 23:32:12,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421940570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:32:12,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:32:12,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-15 23:32:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184119398] [2022-11-15 23:32:12,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:32:12,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-15 23:32:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-15 23:32:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-15 23:32:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:12,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:12,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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) [2022-11-15 23:32:12,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:12,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 23:32:13,004 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)] === [2022-11-15 23:32:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1627563919, now seen corresponding path program 1 times [2022-11-15 23:32:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97570556] [2022-11-15 23:32:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:13,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97570556] [2022-11-15 23:32:13,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97570556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:13,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435289171] [2022-11-15 23:32:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:13,255 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) [2022-11-15 23:32:13,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-15 23:32:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:13,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-15 23:32:13,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:13,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435289171] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:32:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-15 23:32:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860704549] [2022-11-15 23:32:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:32:13,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-15 23:32:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-15 23:32:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-15 23:32:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:13,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:32:13,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:13,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:13,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-15 23:32:14,093 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 [2022-11-15 23:32:14,094 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)] === [2022-11-15 23:32:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1742110344, now seen corresponding path program 1 times [2022-11-15 23:32:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894046036] [2022-11-15 23:32:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894046036] [2022-11-15 23:32:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894046036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800515126] [2022-11-15 23:32:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:14,304 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) [2022-11-15 23:32:14,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-15 23:32:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:14,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-15 23:32:14,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:14,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:14,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800515126] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:14,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:32:14,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-15 23:32:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65474451] [2022-11-15 23:32:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:32:14,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-15 23:32:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-15 23:32:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-15 23:32:14,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:14,733 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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) [2022-11-15 23:32:14,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:14,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:14,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:14,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:32:14,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:15,074 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 [2022-11-15 23:32:15,074 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)] === [2022-11-15 23:32:15,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash 998227617, now seen corresponding path program 1 times [2022-11-15 23:32:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:15,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286716341] [2022-11-15 23:32:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286716341] [2022-11-15 23:32:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286716341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538825643] [2022-11-15 23:32:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:16,581 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) [2022-11-15 23:32:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-15 23:32:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:16,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-15 23:32:16,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:17,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:32:17,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 42 [2022-11-15 23:32:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:18,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:19,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:32:19,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 164 [2022-11-15 23:32:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:23,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538825643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:32:23,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:32:23,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 21] total 52 [2022-11-15 23:32:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450610535] [2022-11-15 23:32:23,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:32:23,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-15 23:32:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-15 23:32:23,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=2169, Unknown=0, NotChecked=0, Total=2652 [2022-11-15 23:32:23,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:23,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:23,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.788461538461538) internal successors, (249), 52 states have internal predecessors, (249), 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) [2022-11-15 23:32:23,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:23,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:23,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:23,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:32:23,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:32:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-15 23:32:25,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:25,588 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 [2022-11-15 23:32:25,588 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)] === [2022-11-15 23:32:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1438144984, now seen corresponding path program 2 times [2022-11-15 23:32:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:25,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369488835] [2022-11-15 23:32:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:26,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369488835] [2022-11-15 23:32:26,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369488835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:26,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246121740] [2022-11-15 23:32:26,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 23:32:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:26,037 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) [2022-11-15 23:32:26,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-15 23:32:26,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:32:26,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:32:26,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-15 23:32:26,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:26,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246121740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:32:26,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:32:26,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-11-15 23:32:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710056708] [2022-11-15 23:32:26,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:32:26,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-15 23:32:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-15 23:32:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2022-11-15 23:32:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:26,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:26,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:32:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:26,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:32:26,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-15 23:32:26,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:32:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:32:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:28,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:28,193 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 [2022-11-15 23:32:28,193 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)] === [2022-11-15 23:32:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1153615117, now seen corresponding path program 1 times [2022-11-15 23:32:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:28,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047109659] [2022-11-15 23:32:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:28,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047109659] [2022-11-15 23:32:28,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047109659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:28,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224138908] [2022-11-15 23:32:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:28,555 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) [2022-11-15 23:32:28,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-15 23:32:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:28,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-15 23:32:28,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:28,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:29,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224138908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:32:29,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:32:29,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-11-15 23:32:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477341989] [2022-11-15 23:32:29,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:32:29,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-15 23:32:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-15 23:32:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-11-15 23:32:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:29,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:29,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.419354838709678) internal successors, (261), 31 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:29,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:32:30,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:30,399 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 [2022-11-15 23:32:30,400 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)] === [2022-11-15 23:32:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -601000968, now seen corresponding path program 3 times [2022-11-15 23:32:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:30,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677031877] [2022-11-15 23:32:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677031877] [2022-11-15 23:32:30,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677031877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264459626] [2022-11-15 23:32:30,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-15 23:32:30,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:30,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:30,600 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) [2022-11-15 23:32:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-15 23:32:30,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-15 23:32:30,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:32:30,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:32:30,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:30,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:32:31,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264459626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:32:31,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:32:31,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-15 23:32:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644061378] [2022-11-15 23:32:31,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:32:31,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-15 23:32:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-15 23:32:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-15 23:32:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:31,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:31,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.24) internal successors, (231), 25 states have internal predecessors, (231), 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) [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-15 23:32:31,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:31,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:32:31,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:32:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:32:32,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:32,525 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 [2022-11-15 23:32:32,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-15 23:32:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1200311733, now seen corresponding path program 4 times [2022-11-15 23:32:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:32,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586038614] [2022-11-15 23:32:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586038614] [2022-11-15 23:32:34,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586038614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685807311] [2022-11-15 23:32:34,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-15 23:32:34,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:34,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:34,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 23:32:34,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-15 23:32:34,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-15 23:32:34,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:32:34,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-15 23:32:34,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:35,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:32:35,332 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-15 23:32:35,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:32:35,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-15 23:32:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:36,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:37,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse2 c_~max2~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-15 23:32:37,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:32:37,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 276 [2022-11-15 23:32:37,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 169 [2022-11-15 23:32:37,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 163 [2022-11-15 23:32:37,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 145 [2022-11-15 23:32:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:42,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685807311] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:32:42,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:32:42,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 74 [2022-11-15 23:32:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349193674] [2022-11-15 23:32:42,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:32:42,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-15 23:32:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:32:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-15 23:32:42,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=4573, Unknown=1, NotChecked=142, Total=5402 [2022-11-15 23:32:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:42,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:32:42,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.45945945945946) internal successors, (330), 74 states have internal predecessors, (330), 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) [2022-11-15 23:32:42,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:42,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:42,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:42,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:32:42,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:32:42,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:42,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:32:42,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:32:42,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-15 23:32:46,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-15 23:32:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-15 23:32:46,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-15 23:32:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:32:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 231166643, now seen corresponding path program 5 times [2022-11-15 23:32:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:32:46,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526318308] [2022-11-15 23:32:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:32:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:32:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:32:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:32:48,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526318308] [2022-11-15 23:32:48,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526318308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:32:48,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599512780] [2022-11-15 23:32:48,328 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-15 23:32:48,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:32:48,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:32:48,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 23:32:48,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-15 23:32:48,440 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:32:48,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:32:48,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-15 23:32:48,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:32:48,499 INFO L350 Elim1Store]: Elim1 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 [2022-11-15 23:32:48,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-15 23:32:48,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-15 23:32:48,931 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 23:32:48,932 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-15 23:32:49,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-15 23:32:49,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-15 23:32:49,864 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-15 23:32:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:32:50,023 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-15 23:32:50,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:32:50,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 42 [2022-11-15 23:32:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:32:50,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:32:52,333 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))) (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse2) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse2)) (<= .cse2 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-15 23:32:54,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse1 c_~max2~0) (not (< c_~max3~0 .cse1)) (not (< ~M~0 c_~N~0)) (= .cse1 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse2) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-11-15 23:33:11,361 WARN L233 SmtUtils]: Spent 13.66s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:33:23,597 WARN L233 SmtUtils]: Spent 11.99s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:33:37,358 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:33:38,138 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse0 (<= c_~max3~0 c_~max2~0)) (.cse4 (= c_~max1~0 c_~max2~0)) (.cse5 (< c_~max2~0 c_~max3~0))) (and (or .cse0 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse1)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse1 c_~max3~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse4 .cse5) (or (= c_~max1~0 c_~max3~0) .cse0))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse7)) (< c_~max2~0 .cse7) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse9)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse10)) (= .cse10 .cse9) (not (< ~M~0 c_~N~0)) (<= .cse10 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse12)) (< c_~max2~0 .cse12) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse4) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse14)) (= c_~max1~0 .cse14) (not (< ~M~0 c_~N~0)) (<= .cse14 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse15 c_~A~0.base) c_~A~0.offset))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse16)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse16 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse5)))) is different from false [2022-11-15 23:33:39,736 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse5 (<= c_~max3~0 c_~max2~0)) (.cse4 (< c_~max2~0 c_~max3~0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse0 .cse1) (not (< c_~max3~0 .cse1)) (not (< ~M~0 c_~N~0)) (<= .cse1 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse0)))))) (or (and (or .cse3 .cse4) (or (= c_~max1~0 c_~max3~0) .cse5)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (= .cse8 c_~max3~0) (not (< c_~max1~0 .cse8)) (< (+ ~M~0 1) c_~N~0))))) .cse5) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max3~0 .cse10)) (not (< ~M~0 c_~N~0)) (<= .cse10 c_~max2~0) (= c_~max1~0 .cse10) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))) (= .cse13 c_~max2~0) (not (< c_~max1~0 .cse13)))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (= .cse15 c_~max2~0) (not (< c_~max1~0 .cse15)) (< (+ ~M~0 1) c_~N~0))))) .cse4) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse17 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max1~0 (select (select .cse16 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (not (< c_~max3~0 .cse17)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse17) (< (+ ~M~0 1) c_~N~0))))) .cse3)))) is different from false [2022-11-15 23:33:40,615 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse7 (= c_~max1~0 c_~max2~0)) (.cse2 (< c_~max2~0 c_~max3~0)) (.cse14 (<= c_~max3~0 c_~max2~0))) (and (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse1) (not (< c_~max1~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) .cse2) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (= .cse3 c_~max1~0) (<= .cse3 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max3~0 .cse6)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse6) (< (+ ~M~0 1) c_~N~0))))) .cse7) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse8)) (not (< ~M~0 c_~N~0)) (<= .cse8 c_~max2~0) (= .cse8 .cse9) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse9)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse13) (not (< c_~max1~0 .cse13)))))) (or (and (or .cse7 .cse2) (or (= c_~max1~0 c_~max3~0) .cse14)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (or .cse14 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (= c_~max3~0 .cse16) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse16)) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-15 23:33:42,977 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse7 (= c_~max1~0 c_~max2~0)) (.cse2 (< c_~max2~0 c_~max3~0)) (.cse14 (<= c_~max3~0 c_~max2~0))) (and (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse1) (not (< c_~max1~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) .cse2) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (= .cse3 c_~max1~0) (<= .cse3 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max3~0 .cse6)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse6) (< (+ ~M~0 1) c_~N~0))))) .cse7) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse8)) (not (< ~M~0 c_~N~0)) (<= .cse8 c_~max2~0) (= .cse8 .cse9) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse9)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse13) (not (< c_~max1~0 .cse13)))))) (or (and (or .cse7 .cse2) (or (= c_~max1~0 c_~max3~0) .cse14)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (or .cse14 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (= c_~max3~0 .cse16) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse16)) (< (+ ~M~0 1) c_~N~0)))))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-15 23:33:43,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-15 23:33:43,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 183 [2022-11-15 23:33:43,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-11-15 23:33:43,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-11-15 23:33:43,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,261 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 82 [2022-11-15 23:33:43,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 75 [2022-11-15 23:33:43,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 657 treesize of output 627 [2022-11-15 23:33:43,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 580 treesize of output 484 [2022-11-15 23:33:43,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 484 treesize of output 436 [2022-11-15 23:33:43,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:43,627 INFO L350 Elim1Store]: Elim1 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 366 treesize of output 348 [2022-11-15 23:33:44,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-15 23:33:44,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2022-11-15 23:33:44,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 234 [2022-11-15 23:33:44,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,394 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 123 [2022-11-15 23:33:44,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 198 [2022-11-15 23:33:44,596 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:33:44,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-15 23:33:44,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-15 23:33:44,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1870 treesize of output 1780 [2022-11-15 23:33:44,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1753 treesize of output 1465 [2022-11-15 23:33:44,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1465 treesize of output 1321 [2022-11-15 23:33:44,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:33:44,691 INFO L350 Elim1Store]: Elim1 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 1330 treesize of output 1266 [2022-11-15 23:33:52,824 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:33:52,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-15 23:33:52,842 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:33:52,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-15 23:33:54,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:33:54,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:33:54,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-15 23:33:54,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:33:54,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-15 23:33:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:33:56,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599512780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:33:56,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:33:56,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 82 [2022-11-15 23:33:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320464858] [2022-11-15 23:33:56,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:33:56,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-15 23:33:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:33:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-15 23:33:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=4916, Unknown=31, NotChecked=918, Total=6642 [2022-11-15 23:33:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:33:56,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:33:56,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.792682926829268) internal successors, (311), 82 states have internal predecessors, (311), 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) [2022-11-15 23:33:56,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:33:56,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:33:56,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:33:56,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-15 23:33:56,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:34:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:34:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-15 23:34:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-15 23:34:04,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-15 23:34:05,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-15 23:34:05,154 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-15 23:34:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:34:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1733629837, now seen corresponding path program 6 times [2022-11-15 23:34:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:34:05,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16431834] [2022-11-15 23:34:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:34:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:34:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:34:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:34:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:34:05,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16431834] [2022-11-15 23:34:05,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16431834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:34:05,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306137420] [2022-11-15 23:34:05,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-15 23:34:05,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:34:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:34:05,396 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 23:34:05,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-15 23:34:05,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-15 23:34:05,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:34:05,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:34:05,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:34:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:34:05,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:34:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:34:05,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306137420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:34:05,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:34:05,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-15 23:34:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078143628] [2022-11-15 23:34:05,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:34:05,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-15 23:34:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:34:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-15 23:34:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-15 23:34:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:05,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:34:05,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.458333333333333) internal successors, (179), 24 states have internal predecessors, (179), 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) [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-15 23:34:05,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-15 23:34:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-15 23:34:06,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-15 23:34:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-15 23:34:06,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-15 23:34:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:34:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1033677588, now seen corresponding path program 7 times [2022-11-15 23:34:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:34:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115848830] [2022-11-15 23:34:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:34:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:34:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:34:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:34:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:34:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115848830] [2022-11-15 23:34:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115848830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:34:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351920355] [2022-11-15 23:34:11,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-15 23:34:11,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:34:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:34:11,295 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 23:34:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-15 23:34:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:34:11,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-15 23:34:11,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:34:13,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:34:13,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:34:13,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-11-15 23:34:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:34:14,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:34:37,045 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:35:08,677 WARN L233 SmtUtils]: Spent 26.66s on a formula simplification that was a NOOP. DAG size: 1652 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-15 23:35:08,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:35:08,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 935 treesize of output 5823 Received shutdown request... [2022-11-15 23:46:05,472 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 [2022-11-15 23:46:05,472 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 [2022-11-15 23:46:05,472 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 23:46:05,515 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-15 23:46:05,518 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-15 23:46:05,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-15 23:46:05,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-15 23:46:05,728 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 32ms.. [2022-11-15 23:46:05,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-15 23:46:05,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-15 23:46:05,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-15 23:46:05,733 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-15 23:46:05,735 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 23:46:05,735 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 23:46:05,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:46:05 BasicIcfg [2022-11-15 23:46:05,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 23:46:05,737 INFO L158 Benchmark]: Toolchain (without parser) took 835165.14ms. Allocated memory was 185.6MB in the beginning and 974.1MB in the end (delta: 788.5MB). Free memory was 157.7MB in the beginning and 634.4MB in the end (delta: -476.7MB). Peak memory consumption was 639.2MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,738 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 23:46:05,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.81ms. Allocated memory was 185.6MB in the beginning and 270.5MB in the end (delta: 84.9MB). Free memory was 157.7MB in the beginning and 239.4MB in the end (delta: -81.7MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.23ms. Allocated memory is still 270.5MB. Free memory was 239.4MB in the beginning and 237.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,738 INFO L158 Benchmark]: Boogie Preprocessor took 27.64ms. Allocated memory is still 270.5MB. Free memory was 237.9MB in the beginning and 236.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,738 INFO L158 Benchmark]: RCFGBuilder took 507.29ms. Allocated memory is still 270.5MB. Free memory was 235.8MB in the beginning and 214.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,739 INFO L158 Benchmark]: TraceAbstraction took 834366.22ms. Allocated memory was 270.5MB in the beginning and 974.1MB in the end (delta: 703.6MB). Free memory was 213.7MB in the beginning and 634.4MB in the end (delta: -420.6MB). Peak memory consumption was 611.7MB. Max. memory is 8.0GB. [2022-11-15 23:46:05,740 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.13ms. Allocated memory is still 185.6MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.81ms. Allocated memory was 185.6MB in the beginning and 270.5MB in the end (delta: 84.9MB). Free memory was 157.7MB in the beginning and 239.4MB in the end (delta: -81.7MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.23ms. Allocated memory is still 270.5MB. Free memory was 239.4MB in the beginning and 237.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.64ms. Allocated memory is still 270.5MB. Free memory was 237.9MB in the beginning and 236.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 507.29ms. Allocated memory is still 270.5MB. Free memory was 235.8MB in the beginning and 214.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 834366.22ms. Allocated memory was 270.5MB in the beginning and 974.1MB in the end (delta: 703.6MB). Free memory was 213.7MB in the beginning and 634.4MB in the end (delta: -420.6MB). Peak memory consumption was 611.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45115, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 5605, dependent conditional: 5587, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 17, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 62, independent conditional: 12, independent unconditional: 51, dependent: 119, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39552, independent: 37550, independent conditional: 2, independent unconditional: 37548, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5585 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1756, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2231, independent: 2213, independent conditional: 0, independent unconditional: 2213, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45115, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 5605, dependent conditional: 5587, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 17, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 62, independent conditional: 12, independent unconditional: 51, dependent: 119, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39552, independent: 37550, independent conditional: 2, independent unconditional: 37548, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5585 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 32ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 32ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 32ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 32ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 834.2s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 19.3s, 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: 320, 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.8s SatisfiabilityAnalysisTime, 92.6s InterpolantComputationTime, 2444 NumberOfCodeBlocks, 2444 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3529 ConstructedInterpolants, 119 QuantifiedInterpolants, 52710 SizeOfPredicates, 154 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 77/150 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