/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/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-99e0210 [2023-03-23 17:30:40,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-23 17:30:40,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-23 17:30:40,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-23 17:30:40,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-23 17:30:40,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-23 17:30:40,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-23 17:30:40,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-23 17:30:40,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-23 17:30:40,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-23 17:30:40,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-23 17:30:40,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-23 17:30:40,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-23 17:30:40,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-23 17:30:40,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-23 17:30:40,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-23 17:30:40,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-23 17:30:40,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-23 17:30:40,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-23 17:30:40,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-23 17:30:40,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-23 17:30:40,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-23 17:30:40,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-23 17:30:40,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-23 17:30:40,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-23 17:30:40,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-23 17:30:40,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-23 17:30:40,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-23 17:30:40,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-23 17:30:40,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-23 17:30:40,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-23 17:30:40,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-23 17:30:40,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-23 17:30:40,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-23 17:30:40,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-23 17:30:40,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-23 17:30:40,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-23 17:30:40,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-23 17:30:40,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-23 17:30:40,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-23 17:30:40,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-23 17:30:40,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-03-23 17:30:40,915 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-23 17:30:40,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-23 17:30:40,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-23 17:30:40,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-23 17:30:40,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-23 17:30:40,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-23 17:30:40,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-23 17:30:40,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-23 17:30:40,918 INFO L138 SettingsManager]: * Use SBE=true [2023-03-23 17:30:40,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-23 17:30:40,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-23 17:30:40,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-23 17:30:40,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-23 17:30:40,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-03-23 17:30:40,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-23 17:30:40,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 17:30:40,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-23 17:30:40,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-23 17:30:40,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-23 17:30:40,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-23 17:30:40,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-23 17:30:40,922 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-03-23 17:30:40,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-03-23 17:30:40,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-23 17:30:40,923 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-03-23 17:30:40,923 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 [2023-03-23 17:30:41,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-23 17:30:41,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-23 17:30:41,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-23 17:30:41,170 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-23 17:30:41,170 INFO L275 PluginConnector]: CDTParser initialized [2023-03-23 17:30:41,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-03-23 17:30:42,248 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-23 17:30:42,521 INFO L351 CDTParser]: Found 1 translation units. [2023-03-23 17:30:42,521 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-03-23 17:30:42,537 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da92fbf3d/4a4d0d35646b4d968fb89e77e30d9074/FLAGf4b1c4b88 [2023-03-23 17:30:42,549 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da92fbf3d/4a4d0d35646b4d968fb89e77e30d9074 [2023-03-23 17:30:42,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-23 17:30:42,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-03-23 17:30:42,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-23 17:30:42,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-23 17:30:42,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-23 17:30:42,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 05:30:42" (1/1) ... [2023-03-23 17:30:42,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416619f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:42, skipping insertion in model container [2023-03-23 17:30:42,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 05:30:42" (1/1) ... [2023-03-23 17:30:42,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-23 17:30:42,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-23 17:30:43,046 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-03-23 17:30:43,055 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-03-23 17:30:43,061 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-03-23 17:30:43,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 17:30:43,076 INFO L203 MainTranslator]: Completed pre-run [2023-03-23 17:30:43,129 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-03-23 17:30:43,130 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-03-23 17:30:43,133 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-03-23 17:30:43,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 17:30:43,182 INFO L208 MainTranslator]: Completed translation [2023-03-23 17:30:43,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43 WrapperNode [2023-03-23 17:30:43,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-23 17:30:43,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-03-23 17:30:43,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-03-23 17:30:43,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-03-23 17:30:43,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,232 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-03-23 17:30:43,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-03-23 17:30:43,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-23 17:30:43,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-23 17:30:43,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-23 17:30:43,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-23 17:30:43,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-23 17:30:43,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-23 17:30:43,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-23 17:30:43,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (1/1) ... [2023-03-23 17:30:43,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 17:30:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:43,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-23 17:30:43,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-23 17:30:43,362 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-03-23 17:30:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-03-23 17:30:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-03-23 17:30:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-23 17:30:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-23 17:30:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-23 17:30:43,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-23 17:30:43,366 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-03-23 17:30:43,552 INFO L236 CfgBuilder]: Building ICFG [2023-03-23 17:30:43,554 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-23 17:30:43,987 INFO L277 CfgBuilder]: Performing block encoding [2023-03-23 17:30:43,999 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-23 17:30:43,999 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-23 17:30:44,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 05:30:44 BoogieIcfgContainer [2023-03-23 17:30:44,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-23 17:30:44,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-23 17:30:44,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-23 17:30:44,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-23 17:30:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 05:30:42" (1/3) ... [2023-03-23 17:30:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f493184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 05:30:44, skipping insertion in model container [2023-03-23 17:30:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 05:30:43" (2/3) ... [2023-03-23 17:30:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f493184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 05:30:44, skipping insertion in model container [2023-03-23 17:30:44,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 05:30:44" (3/3) ... [2023-03-23 17:30:44,008 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-03-23 17:30:44,014 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-03-23 17:30:44,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-23 17:30:44,022 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-03-23 17:30:44,023 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-03-23 17:30:44,134 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-03-23 17:30:44,178 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 17:30:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 17:30:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:30:44,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-03-23 17:30:44,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-03-23 17:30:44,221 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 17:30:44,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-23 17:30:44,234 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;@54f4e91c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 17:30:44,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-03-23 17:30:44,262 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 4 more)] === [2023-03-23 17:30:44,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-03-23 17:30:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223566931] [2023-03-23 17:30:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223566931] [2023-03-23 17:30:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223566931] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:44,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 17:30:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721804288] [2023-03-23 17:30:44,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 17:30:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 17:30:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 17:30:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,612 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:44,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-23 17:30:44,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:44,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-03-23 17:30:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:44,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701762789] [2023-03-23 17:30:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701762789] [2023-03-23 17:30:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701762789] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:44,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-23 17:30:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779891707] [2023-03-23 17:30:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:44,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 17:30:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 17:30:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-23 17:30:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,931 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:44,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:44,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:44,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-23 17:30:44,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:44,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-03-23 17:30:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:44,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164109457] [2023-03-23 17:30:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:44,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164109457] [2023-03-23 17:30:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164109457] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-23 17:30:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018045860] [2023-03-23 17:30:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:47,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-23 17:30:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-23 17:30:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-03-23 17:30:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:47,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:47,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:47,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:47,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:47,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:48,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-23 17:30:48,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:48,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-03-23 17:30:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:48,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66474330] [2023-03-23 17:30:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66474330] [2023-03-23 17:30:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66474330] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:51,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-03-23 17:30:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822174519] [2023-03-23 17:30:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:51,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-03-23 17:30:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-03-23 17:30:51,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-03-23 17:30:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:51,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:51,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:51,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:51,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:51,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-03-23 17:30:54,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-23 17:30:54,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:54,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-03-23 17:30:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653731931] [2023-03-23 17:30:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:30:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653731931] [2023-03-23 17:30:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653731931] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-23 17:30:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092283489] [2023-03-23 17:30:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:54,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 17:30:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 17:30:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-23 17:30:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,509 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:54,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:54,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:54,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-03-23 17:30:54,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:30:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:54,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-23 17:30:54,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:54,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1493771274, now seen corresponding path program 1 times [2023-03-23 17:30:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078565370] [2023-03-23 17:30:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:30:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-03-23 17:30:55,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:30:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078565370] [2023-03-23 17:30:55,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078565370] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:30:55,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:30:55,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 17:30:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119882007] [2023-03-23 17:30:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:30:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 17:30:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:30:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 17:30:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 17:30:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:55,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:30:55,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:55,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:30:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:30:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:30:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:30:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:30:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-23 17:30:55,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:30:55,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:30:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 494892714, now seen corresponding path program 2 times [2023-03-23 17:30:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:30:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560448859] [2023-03-23 17:30:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:30:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:30:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560448859] [2023-03-23 17:31:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560448859] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171752748] [2023-03-23 17:31:00,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 17:31:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:00,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 17:31:00,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-23 17:31:01,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-23 17:31:01,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 17:31:01,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-03-23 17:31:01,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:01,325 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-23 17:31:01,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-03-23 17:31:01,398 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-23 17:31:01,399 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 11 treesize of output 11 [2023-03-23 17:31:01,656 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 11 treesize of output 7 [2023-03-23 17:31:01,747 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 19 treesize of output 18 [2023-03-23 17:31:02,418 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 21 treesize of output 21 [2023-03-23 17:31:02,562 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 21 treesize of output 21 [2023-03-23 17:31:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:03,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:03,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-03-23 17:31:03,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-03-23 17:31:03,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-03-23 17:31:03,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:03,585 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 21 treesize of output 21 [2023-03-23 17:31:04,190 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-03-23 17:31:04,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-03-23 17:31:04,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-03-23 17:31:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:04,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 17:31:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171752748] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:31:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 17:31:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [44] total 70 [2023-03-23 17:31:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812854493] [2023-03-23 17:31:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:31:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-03-23 17:31:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-03-23 17:31:04,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4422, Unknown=0, NotChecked=0, Total=4830 [2023-03-23 17:31:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:04,397 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.413793103448276) internal successors, (186), 29 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:04,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:31:06,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-23 17:31:06,203 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,SelfDestructingSolverStorable6 [2023-03-23 17:31:06,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:31:06,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:31:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1882119695, now seen corresponding path program 1 times [2023-03-23 17:31:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:31:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217336441] [2023-03-23 17:31:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:31:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:31:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217336441] [2023-03-23 17:31:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217336441] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:31:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742003822] [2023-03-23 17:31:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:31:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:31:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:31:10,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 17:31:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-23 17:31:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:31:10,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 123 conjunts are in the unsatisfiable core [2023-03-23 17:31:10,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:31:11,072 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-23 17:31:11,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-03-23 17:31:11,130 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-23 17:31:11,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-03-23 17:31:11,377 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 11 treesize of output 7 [2023-03-23 17:31:11,449 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 19 treesize of output 18 [2023-03-23 17:31:12,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-03-23 17:31:12,304 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 21 treesize of output 21 [2023-03-23 17:31:12,763 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-03-23 17:31:12,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2023-03-23 17:31:13,062 INFO L321 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2023-03-23 17:31:13,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2023-03-23 17:31:13,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-03-23 17:31:13,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:13,537 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 27 treesize of output 22 [2023-03-23 17:31:14,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:14,213 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-03-23 17:31:14,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 49 [2023-03-23 17:31:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:14,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-03-23 17:31:14,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:14,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-03-23 17:31:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:14,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-03-23 17:31:15,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:15,375 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-03-23 17:31:15,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2023-03-23 17:31:15,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:31:15,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-03-23 17:31:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:15,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:31:21,890 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= (select .cse1 .cse2) 800)))))) is different from false [2023-03-23 17:31:22,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse2))) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse2)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0)))))) is different from false [2023-03-23 17:31:23,837 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse1 .cse2) 800)))))) is different from false [2023-03-23 17:31:23,901 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_421) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= (select .cse1 .cse2) 800)))))) is different from false [2023-03-23 17:31:24,118 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse1 v_ArrVal_423)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse2 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= (select .cse0 .cse1) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))))) is different from false [2023-03-23 17:31:25,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse1 v_ArrVal_423))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_427)))) (let ((.cse2 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= 800 (select .cse0 .cse1)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0))))))) is different from false [2023-03-23 17:31:25,471 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse2 v_ArrVal_423))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse1 .cse2)))))))) is different from false [2023-03-23 17:31:28,728 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_415 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_415)))) (let ((.cse7 (let ((.cse10 (let ((.cse11 (store (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_421) .cse1 v_ArrVal_423))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_427)))) (let ((.cse4 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434)))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse4 |c_~#queue~0.base|) .cse2))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse5 .cse1)))))))) is different from false [2023-03-23 17:31:29,229 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-03-23 17:31:29,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2932 treesize of output 2080 [2023-03-23 17:31:30,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:30,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193577 treesize of output 191159 [2023-03-23 17:31:30,829 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 44154 treesize of output 43482 [2023-03-23 17:31:32,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 17:31:32,299 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 11083 treesize of output 11003 [2023-03-23 17:31:32,985 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 522 treesize of output 490 [2023-03-23 17:31:35,378 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 8 treesize of output 4 [2023-03-23 17:31:35,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 17:31:35,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 17:31:35,517 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 17:31:35,521 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 59 treesize of output 55 [2023-03-23 17:31:35,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:35,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3596 treesize of output 3550 [2023-03-23 17:31:38,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:31:38,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 119 [2023-03-23 17:31:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:31:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742003822] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 17:31:38,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 17:31:38,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 45, 47] total 123 [2023-03-23 17:31:38,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835486256] [2023-03-23 17:31:38,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 17:31:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2023-03-23 17:31:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:31:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2023-03-23 17:31:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=12073, Unknown=83, NotChecked=1864, Total=15006 [2023-03-23 17:31:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:38,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:31:38,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 4.357723577235772) internal successors, (536), 123 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:31:38,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:31:50,223 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 139 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-23 17:31:56,514 WARN L222 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 131 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:32:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-03-23 17:32:12,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-03-23 17:32:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:32:12,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:32:12,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:32:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1703422451, now seen corresponding path program 1 times [2023-03-23 17:32:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:32:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379139999] [2023-03-23 17:32:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:32:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:32:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:32:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 17:32:12,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:32:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379139999] [2023-03-23 17:32:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379139999] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 17:32:12,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 17:32:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 17:32:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256224305] [2023-03-23 17:32:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 17:32:12,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 17:32:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 17:32:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 17:32:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 17:32:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:32:12,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 17:32:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-03-23 17:32:12,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-03-23 17:32:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 17:32:16,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-23 17:32:16,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-03-23 17:32:16,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 17:32:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1705847134, now seen corresponding path program 1 times [2023-03-23 17:32:16,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 17:32:16,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277925261] [2023-03-23 17:32:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:32:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 17:32:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:32:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-03-23 17:32:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 17:32:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277925261] [2023-03-23 17:32:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277925261] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 17:32:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178261394] [2023-03-23 17:32:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 17:32:22,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:32:22,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 17:32:22,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 17:32:22,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-23 17:32:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 17:32:22,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 132 conjunts are in the unsatisfiable core [2023-03-23 17:32:22,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 17:32:23,097 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-23 17:32:23,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-03-23 17:32:23,173 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-23 17:32:23,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-03-23 17:32:23,453 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 11 treesize of output 7 [2023-03-23 17:32:23,536 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 19 treesize of output 18 [2023-03-23 17:32:24,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-03-23 17:32:24,343 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 21 treesize of output 21 [2023-03-23 17:32:24,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-03-23 17:32:25,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-03-23 17:32:25,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-03-23 17:32:25,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:25,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-03-23 17:32:26,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:26,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-03-23 17:32:26,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:26,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-03-23 17:32:26,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:26,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2023-03-23 17:32:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:26,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-03-23 17:32:27,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:27,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-03-23 17:32:27,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-03-23 17:32:27,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 17:32:27,900 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 14 treesize of output 16 [2023-03-23 17:32:28,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-03-23 17:32:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-23 17:32:28,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 17:33:39,078 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ (select .cse10 .cse12) 1))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|))) 0))))))) is different from false [2023-03-23 17:34:36,359 WARN L222 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-23 17:35:08,757 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse10 .cse8 v_ArrVal_619) .cse7 (+ (select .cse10 .cse7) 1)))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse19 .cse8 v_ArrVal_619) .cse7 (+ (select .cse19 .cse7) 1)))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (= (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (select .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)))) 0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))))) is different from false [2023-03-23 17:35:09,832 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) 0)))))) is different from false [2023-03-23 17:35:10,445 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* 4 (select .cse14 .cse2)) |c_~#queue~0.offset|))) 0))))))) is different from false [2023-03-23 17:35:47,994 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-03-23 17:35:47,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 6678 treesize of output 3966 [2023-03-23 17:35:48,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:35:48,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44961 treesize of output 43581 [2023-03-23 17:35:50,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 17:35:50,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 53853827478 treesize of output 43956167455 Received shutdown request... [2023-03-23 17:39:41,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 17:39:41,191 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 17:39:41,191 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 17:39:41,222 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-03-23 17:39:41,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-03-23 17:39:41,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-03-23 17:39:41,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 17:39:41,433 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. [2023-03-23 17:39:41,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-03-23 17:39:41,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-03-23 17:39:41,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-03-23 17:39:41,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-03-23 17:39:41,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-03-23 17:39:41,436 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-03-23 17:39:41,438 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-23 17:39:41,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-03-23 17:39:41,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-23 17:39:41,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 05:39:41 BasicIcfg [2023-03-23 17:39:41,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-23 17:39:41,444 INFO L158 Benchmark]: Toolchain (without parser) took 538892.11ms. Allocated memory was 237.0MB in the beginning and 1.1GB in the end (delta: 830.5MB). Free memory was 200.3MB in the beginning and 837.2MB in the end (delta: -636.9MB). Peak memory consumption was 687.7MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,444 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 197.1MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-23 17:39:41,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.79ms. Allocated memory is still 237.0MB. Free memory was 200.3MB in the beginning and 170.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 237.0MB. Free memory was 169.9MB in the beginning and 167.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,451 INFO L158 Benchmark]: Boogie Preprocessor took 53.31ms. Allocated memory is still 237.0MB. Free memory was 167.2MB in the beginning and 164.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,451 INFO L158 Benchmark]: RCFGBuilder took 714.33ms. Allocated memory is still 237.0MB. Free memory was 164.6MB in the beginning and 141.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,452 INFO L158 Benchmark]: TraceAbstraction took 537440.55ms. Allocated memory was 237.0MB in the beginning and 1.1GB in the end (delta: 830.5MB). Free memory was 141.1MB in the beginning and 837.2MB in the end (delta: -696.1MB). Peak memory consumption was 629.0MB. Max. memory is 8.0GB. [2023-03-23 17:39:41,455 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 197.1MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 629.79ms. Allocated memory is still 237.0MB. Free memory was 200.3MB in the beginning and 170.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 237.0MB. Free memory was 169.9MB in the beginning and 167.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.31ms. Allocated memory is still 237.0MB. Free memory was 167.2MB in the beginning and 164.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.33ms. Allocated memory is still 237.0MB. Free memory was 164.6MB in the beginning and 141.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 537440.55ms. Allocated memory was 237.0MB in the beginning and 1.1GB in the end (delta: 830.5MB). Free memory was 141.1MB in the beginning and 837.2MB in the end (delta: -696.1MB). Peak memory consumption was 629.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1550, independent conditional: 1550, independent unconditional: 0, dependent: 151, dependent conditional: 151, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1550, independent conditional: 1550, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1550, independent conditional: 1550, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1575, independent: 1550, independent conditional: 0, independent unconditional: 1550, dependent: 25, dependent conditional: 19, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1575, independent: 1550, independent conditional: 0, independent unconditional: 1550, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1575, independent: 1550, independent conditional: 0, independent unconditional: 1550, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 434, independent: 427, independent conditional: 0, independent unconditional: 427, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 434, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1575, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 434, unknown conditional: 1, unknown unconditional: 433] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 427, Positive conditional cache size: 0, Positive unconditional cache size: 427, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 4, Independence queries for same thread: 145 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: 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 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: 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 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-65-4-5-5-5-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 537.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 43.2s, 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: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1910 ConstructedInterpolants, 158 QuantifiedInterpolants, 96026 SizeOfPredicates, 73 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 181/185 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