/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-99e0210 [2023-03-23 19:13:56,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-23 19:13:56,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-23 19:13:56,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-23 19:13:56,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-23 19:13:56,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-23 19:13:56,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-23 19:13:56,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-23 19:13:56,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-23 19:13:56,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-23 19:13:56,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-23 19:13:56,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-23 19:13:56,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-23 19:13:56,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-23 19:13:56,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-23 19:13:56,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-23 19:13:56,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-23 19:13:56,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-23 19:13:56,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-23 19:13:56,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-23 19:13:56,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-23 19:13:56,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-23 19:13:56,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-23 19:13:56,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-23 19:13:56,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-23 19:13:56,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-23 19:13:56,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-23 19:13:56,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-23 19:13:56,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-23 19:13:56,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-23 19:13:56,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-23 19:13:56,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-23 19:13:56,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-23 19:13:56,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-23 19:13:56,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-23 19:13:56,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-23 19:13:56,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-23 19:13:56,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-23 19:13:56,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-23 19:13:56,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-23 19:13:56,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-23 19:13:56,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-03-23 19:13:56,505 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-23 19:13:56,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-23 19:13:56,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-23 19:13:56,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-23 19:13:56,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-23 19:13:56,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-23 19:13:56,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-23 19:13:56,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-23 19:13:56,508 INFO L138 SettingsManager]: * Use SBE=true [2023-03-23 19:13:56,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-23 19:13:56,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-23 19:13:56,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-23 19:13:56,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 19:13:56,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-23 19:13:56,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-23 19:13:56,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-23 19:13:56,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-23 19:13:56,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-23 19:13:56,511 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-03-23 19:13:56,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-03-23 19:13:56,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-23 19:13:56,512 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-03-23 19:13:56,512 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-03-23 19:13:56,512 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 19:13:56,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-23 19:13:56,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-23 19:13:56,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-23 19:13:56,777 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-23 19:13:56,777 INFO L275 PluginConnector]: CDTParser initialized [2023-03-23 19:13:56,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-03-23 19:13:57,979 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-23 19:13:58,239 INFO L351 CDTParser]: Found 1 translation units. [2023-03-23 19:13:58,240 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-03-23 19:13:58,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9cdd8f1/0824a2be6fbf4264a41ff7a3ac16fb20/FLAG900f368fe [2023-03-23 19:13:58,279 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9cdd8f1/0824a2be6fbf4264a41ff7a3ac16fb20 [2023-03-23 19:13:58,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-23 19:13:58,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-03-23 19:13:58,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-23 19:13:58,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-23 19:13:58,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-23 19:13:58,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70aa36b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58, skipping insertion in model container [2023-03-23 19:13:58,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-23 19:13:58,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-23 19:13:58,722 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_ok.i[43266,43279] [2023-03-23 19:13:58,727 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_ok.i[43543,43556] [2023-03-23 19:13:58,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 19:13:58,746 INFO L203 MainTranslator]: Completed pre-run [2023-03-23 19:13:58,786 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_ok.i[43266,43279] [2023-03-23 19:13:58,789 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_ok.i[43543,43556] [2023-03-23 19:13:58,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 19:13:58,839 INFO L208 MainTranslator]: Completed translation [2023-03-23 19:13:58,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58 WrapperNode [2023-03-23 19:13:58,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-23 19:13:58,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-03-23 19:13:58,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-03-23 19:13:58,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-03-23 19:13:58,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,892 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-03-23 19:13:58,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-03-23 19:13:58,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-23 19:13:58,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-23 19:13:58,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-23 19:13:58,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-23 19:13:58,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-23 19:13:58,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-23 19:13:58,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-23 19:13:58,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (1/1) ... [2023-03-23 19:13:58,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 19:13:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:13:58,966 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 19:13:58,982 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 19:13:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-03-23 19:13:59,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-03-23 19:13:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-03-23 19:13:59,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-03-23 19:13:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-23 19:13:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-23 19:13:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-23 19:13:59,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-23 19:13:59,012 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 19:13:59,253 INFO L236 CfgBuilder]: Building ICFG [2023-03-23 19:13:59,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-23 19:13:59,617 INFO L277 CfgBuilder]: Performing block encoding [2023-03-23 19:13:59,627 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-23 19:13:59,627 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-23 19:13:59,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 07:13:59 BoogieIcfgContainer [2023-03-23 19:13:59,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-23 19:13:59,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-23 19:13:59,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-23 19:13:59,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-23 19:13:59,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 07:13:58" (1/3) ... [2023-03-23 19:13:59,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f40d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 07:13:59, skipping insertion in model container [2023-03-23 19:13:59,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:13:58" (2/3) ... [2023-03-23 19:13:59,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f40d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 07:13:59, skipping insertion in model container [2023-03-23 19:13:59,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 07:13:59" (3/3) ... [2023-03-23 19:13:59,637 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-03-23 19:13:59,644 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-03-23 19:13:59,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-23 19:13:59,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-03-23 19:13:59,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-03-23 19:13:59,762 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-03-23 19:13:59,804 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:13:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 19:13:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:13:59,806 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 19:13:59,808 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 19:13:59,843 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 19:13:59,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-03-23 19:13:59,858 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;@3647bd68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:13:59,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-03-23 19:13:59,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-03-23 19:13:59,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-03-23 19:13:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973160596] [2023-03-23 19:13:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:00,143 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 19:14:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973160596] [2023-03-23 19:14:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973160596] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:14:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 19:14:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825379] [2023-03-23 19:14:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:00,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 19:14:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:00,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 19:14:00,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 19:14:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:00,173 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 19:14:00,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-03-23 19:14:00,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-03-23 19:14:00,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-03-23 19:14:00,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-23 19:14:00,493 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-03-23 19:14:00,494 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2023-03-23 19:14:00,500 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:14:00,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 19:14:00,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:00,506 INFO L229 MonitoredProcess]: Starting monitored process 3 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 19:14:00,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-03-23 19:14:00,509 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 19:14:00,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-03-23 19:14:00,514 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;@3647bd68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:14:00,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-23 19:14:00,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:00,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 377823052, now seen corresponding path program 1 times [2023-03-23 19:14:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:00,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614206992] [2023-03-23 19:14:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:00,781 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 19:14:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:00,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614206992] [2023-03-23 19:14:00,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614206992] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:00,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:14:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 19:14:00,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346766420] [2023-03-23 19:14:00,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:00,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 19:14:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 19:14:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 19:14:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:00,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 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 19:14:00,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:00,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-23 19:14:00,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:00,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1980787883, now seen corresponding path program 1 times [2023-03-23 19:14:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194803260] [2023-03-23 19:14:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:01,189 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 19:14:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194803260] [2023-03-23 19:14:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194803260] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:14:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:14:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833891695] [2023-03-23 19:14:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:14:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:14:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:14:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 19:14:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-23 19:14:01,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:01,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1105576446, now seen corresponding path program 1 times [2023-03-23 19:14:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101611626] [2023-03-23 19:14:01,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:01,476 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 19:14:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101611626] [2023-03-23 19:14:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101611626] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:01,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:14:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:14:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077375194] [2023-03-23 19:14:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:01,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:14:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:01,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:14:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:14:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:01,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 19:14:01,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-23 19:14:01,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:01,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -409483404, now seen corresponding path program 1 times [2023-03-23 19:14:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153132966] [2023-03-23 19:14:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:01,706 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 19:14:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153132966] [2023-03-23 19:14:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153132966] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173758927] [2023-03-23 19:14:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:01,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:01,717 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 19:14:01,736 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 19:14:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:01,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-03-23 19:14:01,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:01,982 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 19:14:01,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:02,066 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 19:14:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173758927] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:14:02,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:14:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-03-23 19:14:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918087341] [2023-03-23 19:14:02,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:14:02,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-23 19:14:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-23 19:14:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-03-23 19:14:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:02,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 19:14:02,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:02,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:02,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:02,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:02,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 906746592, now seen corresponding path program 2 times [2023-03-23 19:14:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835506712] [2023-03-23 19:14:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-03-23 19:14:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835506712] [2023-03-23 19:14:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835506712] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:02,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:14:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:14:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244128362] [2023-03-23 19:14:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:14:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:14:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:14:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:02,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 19:14:02,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:02,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:02,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-23 19:14:02,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:02,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1248774004, now seen corresponding path program 1 times [2023-03-23 19:14:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358189228] [2023-03-23 19:14:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358189228] [2023-03-23 19:14:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358189228] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595452173] [2023-03-23 19:14:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:03,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:03,004 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 19:14:03,006 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 19:14:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:03,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-23 19:14:03,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:03,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595452173] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:14:03,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:14:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-03-23 19:14:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837406726] [2023-03-23 19:14:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:14:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-23 19:14:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-23 19:14:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-03-23 19:14:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:03,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:03,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.61111111111111) internal successors, (335), 18 states have internal predecessors, (335), 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 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:03,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:03,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:03,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1297608548, now seen corresponding path program 2 times [2023-03-23 19:14:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375862448] [2023-03-23 19:14:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:04,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375862448] [2023-03-23 19:14:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375862448] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513385243] [2023-03-23 19:14:04,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 19:14:04,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:04,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:04,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:04,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-23 19:14:04,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-03-23 19:14:04,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:14:04,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-23 19:14:04,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2023-03-23 19:14:04,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 19:14:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513385243] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:04,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 19:14:04,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2023-03-23 19:14:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600146640] [2023-03-23 19:14:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 19:14:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 19:14:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-03-23 19:14:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:04,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:04,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:04,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:05,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:05,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:05,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1553903413, now seen corresponding path program 1 times [2023-03-23 19:14:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540388607] [2023-03-23 19:14:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540388607] [2023-03-23 19:14:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540388607] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601055477] [2023-03-23 19:14:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:05,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:05,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:05,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-23 19:14:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:05,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 16 conjunts are in the unsatisfiable core [2023-03-23 19:14:06,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:06,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601055477] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:14:06,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:14:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-03-23 19:14:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761384087] [2023-03-23 19:14:06,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:14:06,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-03-23 19:14:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:06,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-03-23 19:14:06,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-03-23 19:14:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:06,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:06,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.88235294117647) internal successors, (574), 34 states have internal predecessors, (574), 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 19:14:06,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:06,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:06,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:06,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:06,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:06,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:06,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:06,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:07,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:07,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:07,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:07,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1081392251, now seen corresponding path program 2 times [2023-03-23 19:14:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555475198] [2023-03-23 19:14:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555475198] [2023-03-23 19:14:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555475198] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460779847] [2023-03-23 19:14:09,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 19:14:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:09,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:09,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-23 19:14:09,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-23 19:14:09,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:14:09,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 32 conjunts are in the unsatisfiable core [2023-03-23 19:14:09,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:10,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460779847] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:14:11,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:14:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-03-23 19:14:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063528274] [2023-03-23 19:14:11,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:14:11,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-03-23 19:14:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-03-23 19:14:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-03-23 19:14:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:11,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:11,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 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 19:14:11,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:11,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:11,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:11,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:11,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:11,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:11,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:11,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:11,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:12,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:12,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:12,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:12,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash -134443383, now seen corresponding path program 3 times [2023-03-23 19:14:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929453089] [2023-03-23 19:14:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1409 proven. 28 refuted. 0 times theorem prover too weak. 4283 trivial. 0 not checked. [2023-03-23 19:14:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929453089] [2023-03-23 19:14:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929453089] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701807239] [2023-03-23 19:14:20,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-23 19:14:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:20,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:20,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-23 19:14:20,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-23 19:14:20,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:14:20,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 44 conjunts are in the unsatisfiable core [2023-03-23 19:14:20,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:23,683 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 19:14:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:14:23,757 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 19:14:23,925 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 19:14:23,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 19:14:23,961 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 19:14:23,987 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 19:14:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-03-23 19:14:24,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:24,248 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1319) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-03-23 19:14:24,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:14:24,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-03-23 19:14:24,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:14:24,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-03-23 19:14:24,335 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 7 treesize of output 3 [2023-03-23 19:14:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 498 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 90 not checked. [2023-03-23 19:14:25,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701807239] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:14:25,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:14:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 39 [2023-03-23 19:14:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753684680] [2023-03-23 19:14:25,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:14:25,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-03-23 19:14:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-03-23 19:14:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1228, Unknown=1, NotChecked=72, Total=1482 [2023-03-23 19:14:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:25,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:25,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 12.256410256410257) internal successors, (478), 39 states have internal predecessors, (478), 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 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:26,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:26,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-03-23 19:14:26,357 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:26,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2058172751, now seen corresponding path program 1 times [2023-03-23 19:14:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421832044] [2023-03-23 19:14:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 5749 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421832044] [2023-03-23 19:14:29,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421832044] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915827177] [2023-03-23 19:14:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:29,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:29,098 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:29,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-23 19:14:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:29,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 42 conjunts are in the unsatisfiable core [2023-03-23 19:14:29,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 6281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:14:30,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 19:14:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915827177] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 19:14:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-03-23 19:14:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39839248] [2023-03-23 19:14:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:30,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-03-23 19:14:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-03-23 19:14:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-03-23 19:14:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:30,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:30,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 18.41860465116279) internal successors, (792), 43 states have internal predecessors, (792), 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 19:14:30,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:30,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:14:31,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:31,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:31,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:31,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -453073797, now seen corresponding path program 2 times [2023-03-23 19:14:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360316112] [2023-03-23 19:14:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1409 proven. 42 refuted. 0 times theorem prover too weak. 4249 trivial. 0 not checked. [2023-03-23 19:14:36,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360316112] [2023-03-23 19:14:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360316112] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791595702] [2023-03-23 19:14:36,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-23 19:14:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:36,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-23 19:14:36,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-23 19:14:36,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:14:36,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 78 conjunts are in the unsatisfiable core [2023-03-23 19:14:36,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:36,957 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-23 19:14:36,957 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 19:14:36,996 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-23 19:14:36,996 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 19:14:37,130 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 19:14:37,181 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 19:14:37,426 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 14 treesize of output 16 [2023-03-23 19:14:37,490 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 19:14:37,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:14:37,686 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 20 [2023-03-23 19:14:37,714 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 19:14:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2023-03-23 19:14:37,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-23 19:14:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791595702] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:14:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-23 19:14:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 35 [2023-03-23 19:14:37,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449520647] [2023-03-23 19:14:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:14:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-23 19:14:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:14:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-23 19:14:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-03-23 19:14:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:37,773 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:14:37,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.529411764705882) internal successors, (179), 17 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:14:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:14:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:38,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-03-23 19:14:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-03-23 19:14:38,573 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:38,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1813225211, now seen corresponding path program 3 times [2023-03-23 19:14:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635233574] [2023-03-23 19:14:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:14:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3240 proven. 42 refuted. 0 times theorem prover too weak. 2418 trivial. 0 not checked. [2023-03-23 19:14:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:14:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635233574] [2023-03-23 19:14:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635233574] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:14:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990975917] [2023-03-23 19:14:44,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-23 19:14:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:14:44,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:14:44,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-23 19:14:44,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-03-23 19:14:44,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:14:44,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 64 conjunts are in the unsatisfiable core [2023-03-23 19:14:44,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:14:47,487 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 19:14:47,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:14:47,548 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 19:14:47,761 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 19:14:47,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-03-23 19:14:47,813 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 19:14:47,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-03-23 19:14:48,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:14:48,042 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 19:14:48,226 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-23 19:14:48,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 19:14:48,263 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 19:14:48,307 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 19:14:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1079 proven. 439 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2023-03-23 19:14:48,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:14:48,457 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2490) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-03-23 19:15:17,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:15:17,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 84 [2023-03-23 19:15:17,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:15:17,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 129 [2023-03-23 19:15:17,057 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 40 treesize of output 32 [2023-03-23 19:15:17,072 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 7 treesize of output 3 [2023-03-23 19:15:17,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:15:17,101 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 53 treesize of output 49 [2023-03-23 19:15:17,184 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 7 treesize of output 3 [2023-03-23 19:15:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 529 proven. 448 refuted. 433 times theorem prover too weak. 4182 trivial. 108 not checked. [2023-03-23 19:15:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990975917] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:15:34,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:15:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 53 [2023-03-23 19:15:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974706804] [2023-03-23 19:15:34,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:15:34,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-03-23 19:15:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:15:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-03-23 19:15:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=2221, Unknown=59, NotChecked=100, Total=2756 [2023-03-23 19:15:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:15:34,252 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:15:34,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 11.660377358490566) internal successors, (618), 53 states have internal predecessors, (618), 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 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:15:34,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:15:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:15:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:15:37,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-03-23 19:15:37,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-03-23 19:15:37,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:15:37,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:15:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1323111156, now seen corresponding path program 4 times [2023-03-23 19:15:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:15:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333007954] [2023-03-23 19:15:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:15:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:15:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:15:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3850 proven. 270 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2023-03-23 19:15:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:15:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333007954] [2023-03-23 19:15:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333007954] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:15:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853686454] [2023-03-23 19:15:46,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-23 19:15:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:15:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:15:46,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:15:46,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-03-23 19:15:54,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-23 19:15:54,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:15:54,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 110 conjunts are in the unsatisfiable core [2023-03-23 19:15:54,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:15:56,386 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 19:15:56,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:56,454 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 19:15:56,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:56,679 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 20 [2023-03-23 19:15:56,736 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 19:15:56,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-23 19:15:57,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:57,010 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 19:15:57,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:57,302 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 20 [2023-03-23 19:15:57,358 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 19:15:57,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-23 19:15:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:57,628 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 19:15:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:57,890 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 20 [2023-03-23 19:15:57,953 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 19:15:58,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-23 19:15:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:15:58,257 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 19:15:58,461 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 19:15:58,481 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 19:15:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3857 proven. 449 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2023-03-23 19:15:58,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:15:58,778 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1))))) is different from false [2023-03-23 19:15:58,798 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-03-23 19:15:58,804 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-03-23 19:15:58,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-03-23 19:15:58,842 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-03-23 19:15:58,884 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2889)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1))))) is different from false [2023-03-23 19:15:58,903 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2889))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1)) 20))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))) is different from false [2023-03-23 19:15:58,937 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2889))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))) is different from false [2023-03-23 19:16:00,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)))))) is different from false [2023-03-23 19:16:00,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2881)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ 1 (select .cse3 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))) is different from false [2023-03-23 19:16:00,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2881))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|)))) is different from false [2023-03-23 19:16:00,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2881))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))))) is different from false [2023-03-23 19:16:00,738 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)))))))) is different from false [2023-03-23 19:16:01,199 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))))))))) is different from false [2023-03-23 19:16:01,282 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2874)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)))))))) is different from false [2023-03-23 19:16:01,318 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2874))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse4 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|))))))) (< (select .cse11 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|)))) is different from false [2023-03-23 19:16:01,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2874))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2877) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse10 .cse7 v_ArrVal_2883) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse6 .cse7 v_ArrVal_2891) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))))))) is different from false [2023-03-23 19:16:02,114 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2873))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2874))) (store (store .cse11 .cse5 v_ArrVal_2877) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse9 .cse5 v_ArrVal_2883) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse4 .cse5 v_ArrVal_2891) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|))))))))) is different from false [2023-03-23 19:16:02,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:16:02,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2162 treesize of output 1502 [2023-03-23 19:16:02,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:16:02,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1840 treesize of output 1814 [2023-03-23 19:16:02,267 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 367 treesize of output 355 [2023-03-23 19:16:02,283 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 11 treesize of output 7 [2023-03-23 19:16:02,294 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 11 treesize of output 7 [2023-03-23 19:16:02,305 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 11 treesize of output 7 [2023-03-23 19:16:02,342 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 19:16:02,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:16:02,407 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 418 treesize of output 398 [2023-03-23 19:16:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3364 proven. 310 refuted. 1 times theorem prover too weak. 1726 trivial. 589 not checked. [2023-03-23 19:16:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853686454] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:16:03,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:16:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 40] total 100 [2023-03-23 19:16:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590607720] [2023-03-23 19:16:03,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:16:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-03-23 19:16:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:16:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-03-23 19:16:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1044, Invalid=5601, Unknown=69, NotChecked=3186, Total=9900 [2023-03-23 19:16:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:16:03,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:16:03,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 8.26) internal successors, (826), 100 states have internal predecessors, (826), 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 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:16:03,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:16:03,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:16:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:16:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-03-23 19:16:17,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-03-23 19:16:17,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-03-23 19:16:17,508 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:16:17,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:16:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2059771710, now seen corresponding path program 5 times [2023-03-23 19:16:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:16:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69320996] [2023-03-23 19:16:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:16:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:16:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:16:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3956 proven. 924 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2023-03-23 19:16:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:16:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69320996] [2023-03-23 19:16:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69320996] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:16:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490891701] [2023-03-23 19:16:34,570 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-03-23 19:16:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:16:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:16:34,585 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:16:34,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-03-23 19:19:47,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-03-23 19:19:47,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-23 19:19:48,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 449 conjunts are in the unsatisfiable core [2023-03-23 19:19:48,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:19:48,198 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:48,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-03-23 19:19:48,225 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 13 treesize of output 9 [2023-03-23 19:19:48,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-03-23 19:19:48,357 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:19:48,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-03-23 19:19:48,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:19:48,729 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:48,729 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-03-23 19:19:48,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:19:48,830 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 37 treesize of output 36 [2023-03-23 19:19:49,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2023-03-23 19:19:49,271 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:19:49,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 56 [2023-03-23 19:19:49,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:19:49,881 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:49,881 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-03-23 19:19:50,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:19:50,009 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 62 treesize of output 55 [2023-03-23 19:19:50,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2023-03-23 19:19:50,790 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:19:50,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2023-03-23 19:19:51,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:19:51,937 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:51,937 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 85 [2023-03-23 19:19:52,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:19:52,179 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 87 treesize of output 74 [2023-03-23 19:19:52,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 71 [2023-03-23 19:19:53,267 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:19:53,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 94 [2023-03-23 19:19:54,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:19:54,559 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:54,559 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 104 [2023-03-23 19:19:54,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:19:54,883 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 112 treesize of output 93 [2023-03-23 19:19:55,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 90 [2023-03-23 19:19:56,314 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:19:56,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 113 [2023-03-23 19:19:58,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:19:58,147 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:19:58,147 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 123 [2023-03-23 19:19:58,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:19:58,572 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 137 treesize of output 112 [2023-03-23 19:19:59,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 109 [2023-03-23 19:20:00,448 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:20:00,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 132 [2023-03-23 19:20:02,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:02,697 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:20:02,697 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 142 [2023-03-23 19:20:03,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:03,115 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 162 treesize of output 131 [2023-03-23 19:20:04,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 128 [2023-03-23 19:20:05,419 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:20:05,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 151 [2023-03-23 19:20:08,395 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:08,408 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:20:08,408 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 161 [2023-03-23 19:20:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:08,957 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 187 treesize of output 150 [2023-03-23 19:20:10,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 147 [2023-03-23 19:20:11,880 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-03-23 19:20:11,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 170 [2023-03-23 19:20:12,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:12,978 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-23 19:20:12,979 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2023-03-23 19:20:13,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:13,080 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 48 treesize of output 47 [2023-03-23 19:20:13,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-03-23 19:20:13,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:13,461 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 25 treesize of output 24 [2023-03-23 19:20:13,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:13,890 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:13,890 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:13,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:13,971 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 23 treesize of output 22 [2023-03-23 19:20:14,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-03-23 19:20:14,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:14,502 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 25 treesize of output 24 [2023-03-23 19:20:15,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:15,084 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-03-23 19:20:15,084 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2023-03-23 19:20:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:15,140 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 23 treesize of output 22 [2023-03-23 19:20:15,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:15,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:15,543 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 25 treesize of output 24 [2023-03-23 19:20:16,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:16,104 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:16,104 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:16,178 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 23 treesize of output 22 [2023-03-23 19:20:16,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:16,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:16,657 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 25 treesize of output 24 [2023-03-23 19:20:17,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:17,270 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:17,271 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:17,350 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 23 treesize of output 22 [2023-03-23 19:20:17,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:17,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:17,917 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 25 treesize of output 24 [2023-03-23 19:20:18,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:18,690 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:18,691 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:18,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:18,803 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 23 treesize of output 22 [2023-03-23 19:20:19,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:19,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:19,467 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 25 treesize of output 24 [2023-03-23 19:20:20,207 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:20,217 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:20,217 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:20,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:20,307 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 23 treesize of output 22 [2023-03-23 19:20:20,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:20,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:20,892 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 25 treesize of output 24 [2023-03-23 19:20:21,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-23 19:20:21,690 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-03-23 19:20:21,691 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:21,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:21,748 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 23 treesize of output 22 [2023-03-23 19:20:22,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-03-23 19:20:22,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:20:22,303 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 30 treesize of output 29 [2023-03-23 19:20:22,686 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-03-23 19:20:22,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2023-03-23 19:20:22,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-03-23 19:20:22,703 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 19 treesize of output 7 [2023-03-23 19:20:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3234 proven. 2870 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-03-23 19:20:22,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-03-23 19:22:38,445 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 19:22:38,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 19:22:38,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-03-23 19:22:38,445 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 19:22:39,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-23 19:22:39,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-03-23 19:22:39,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-03-23 19:22:39,220 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 228 known predicates. [2023-03-23 19:22:39,221 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1] [2023-03-23 19:22:39,222 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (2/2) [2023-03-23 19:22:39,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-03-23 19:22:39,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-23 19:22:39,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 07:22:39 BasicIcfg [2023-03-23 19:22:39,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-23 19:22:39,226 INFO L158 Benchmark]: Toolchain (without parser) took 520943.31ms. Allocated memory was 251.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 203.7MB in the beginning and 698.8MB in the end (delta: -495.0MB). Peak memory consumption was 764.3MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,226 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 127.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-03-23 19:22:39,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.42ms. Allocated memory is still 251.7MB. Free memory was 203.2MB in the beginning and 173.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.72ms. Allocated memory is still 251.7MB. Free memory was 173.3MB in the beginning and 170.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,227 INFO L158 Benchmark]: Boogie Preprocessor took 37.99ms. Allocated memory is still 251.7MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,227 INFO L158 Benchmark]: RCFGBuilder took 696.87ms. Allocated memory is still 251.7MB. Free memory was 168.6MB in the beginning and 147.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,227 INFO L158 Benchmark]: TraceAbstraction took 519593.79ms. Allocated memory was 251.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 147.1MB in the beginning and 698.8MB in the end (delta: -551.6MB). Peak memory consumption was 707.7MB. Max. memory is 8.0GB. [2023-03-23 19:22:39,228 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.15ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 127.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 556.42ms. Allocated memory is still 251.7MB. Free memory was 203.2MB in the beginning and 173.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.72ms. Allocated memory is still 251.7MB. Free memory was 173.3MB in the beginning and 170.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.99ms. Allocated memory is still 251.7MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 696.87ms. Allocated memory is still 251.7MB. Free memory was 168.6MB in the beginning and 147.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 519593.79ms. Allocated memory was 251.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 147.1MB in the beginning and 698.8MB in the end (delta: -551.6MB). Peak memory consumption was 707.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4484, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4473, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4473, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4294, independent: 4260, independent conditional: 0, independent unconditional: 4260, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4294, independent: 4258, independent conditional: 0, independent unconditional: 4258, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4482, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4294, unknown conditional: 0, unknown unconditional: 4294] , Statistics on independence cache: Total cache size (in pairs): 4294, Positive cache size: 4260, Positive conditional cache size: 0, Positive unconditional cache size: 4260, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 118, Number of trivial persistent sets: 102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4408, independent: 4374, independent conditional: 0, independent unconditional: 4374, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4484, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4473, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4473, independent: 4430, independent conditional: 56, independent unconditional: 4374, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4482, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4294, independent: 4260, independent conditional: 0, independent unconditional: 4260, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4294, independent: 4258, independent conditional: 0, independent unconditional: 4258, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4482, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4294, unknown conditional: 0, unknown unconditional: 4294] , Statistics on independence cache: Total cache size (in pairs): 4294, Positive cache size: 4260, Positive conditional cache size: 0, Positive unconditional cache size: 4260, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16690, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 845, dependent conditional: 811, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15892, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 47, dependent conditional: 13, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15892, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 47, dependent conditional: 13, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 28, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 13, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 13, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7692, independent: 7656, independent conditional: 0, independent unconditional: 7656, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7692, independent: 7650, independent conditional: 0, independent unconditional: 7650, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 97, dependent conditional: 4, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15920, independent: 8189, independent conditional: 0, independent unconditional: 8189, dependent: 39, dependent conditional: 11, dependent unconditional: 28, unknown: 7692, unknown conditional: 2, unknown unconditional: 7690] , Statistics on independence cache: Total cache size (in pairs): 7692, Positive cache size: 7656, Positive conditional cache size: 0, Positive unconditional cache size: 7656, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 6, Independence queries for same thread: 798 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 315, Number of trivial persistent sets: 173, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8040, independent: 8006, independent conditional: 0, independent unconditional: 8006, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16690, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 845, dependent conditional: 811, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15892, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 47, dependent conditional: 13, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15892, independent: 15845, independent conditional: 7839, independent unconditional: 8006, dependent: 47, dependent conditional: 13, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 28, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 13, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15920, independent: 15845, independent conditional: 0, independent unconditional: 15845, dependent: 75, dependent conditional: 13, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7692, independent: 7656, independent conditional: 0, independent unconditional: 7656, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7692, independent: 7650, independent conditional: 0, independent unconditional: 7650, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 97, dependent conditional: 4, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15920, independent: 8189, independent conditional: 0, independent unconditional: 8189, dependent: 39, dependent conditional: 11, dependent unconditional: 28, unknown: 7692, unknown conditional: 2, unknown unconditional: 7690] , Statistics on independence cache: Total cache size (in pairs): 7692, Positive cache size: 7656, Positive conditional cache size: 0, Positive unconditional cache size: 7656, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 6, Independence queries for same thread: 798 - PositiveResult [Line: 1049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 228 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 518.7s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 22.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 337, 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.7s SsaConstructionTime, 9.8s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 11398 NumberOfCodeBlocks, 10102 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 14902 ConstructedInterpolants, 168 QuantifiedInterpolants, 114005 SizeOfPredicates, 187 NumberOfNonLiveVariables, 9038 ConjunctsInSsa, 403 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 72273/89247 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