/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:16:21,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:16:21,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:16:21,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:16:21,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:16:21,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:16:21,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:16:21,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:16:21,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:16:21,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:16:21,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:16:21,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:16:21,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:16:21,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:16:21,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:16:21,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:16:21,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:16:21,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:16:21,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:16:21,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:16:21,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:16:21,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:16:21,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:16:21,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:16:21,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:16:21,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:16:21,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:16:21,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:16:21,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:16:21,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:16:21,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:16:21,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:16:21,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:16:21,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:16:21,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:16:21,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:16:21,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:16:21,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:16:21,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:16:21,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:16:21,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:16:21,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-09-16 10:16:21,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:16:21,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:16:21,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:16:21,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:16:21,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:16:21,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:16:21,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:16:21,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:16:21,725 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:16:21,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:16:21,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:16:21,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:16:21,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:16:21,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:16:21,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:16:21,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:16:21,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:21,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:16:21,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:16:21,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:16:21,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:16:21,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:16:21,728 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:16:21,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:16:21,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 10:16:21,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:16:21,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:16:21,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:16:21,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:16:21,947 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:16:21,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-09-16 10:16:22,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5917de/728a86f6411649269a907e5388c39c48/FLAG972c57647 [2022-09-16 10:16:22,453 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:16:22,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-09-16 10:16:22,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5917de/728a86f6411649269a907e5388c39c48/FLAG972c57647 [2022-09-16 10:16:22,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5917de/728a86f6411649269a907e5388c39c48 [2022-09-16 10:16:22,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:16:22,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:16:22,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:22,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:16:22,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:16:22,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:22" (1/1) ... [2022-09-16 10:16:22,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8a9960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:22, skipping insertion in model container [2022-09-16 10:16:22,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:22" (1/1) ... [2022-09-16 10:16:22,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:16:23,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:16:23,382 WARN L230 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] [2022-09-16 10:16:23,385 WARN L230 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] [2022-09-16 10:16:23,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:23,399 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:16:23,427 WARN L230 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] [2022-09-16 10:16:23,429 WARN L230 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] [2022-09-16 10:16:23,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:23,484 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:16:23,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23 WrapperNode [2022-09-16 10:16:23,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:23,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:23,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:16:23,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:16:23,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,556 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-09-16 10:16:23,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:23,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:16:23,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:16:23,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:16:23,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:16:23,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:16:23,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:16:23,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:16:23,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (1/1) ... [2022-09-16 10:16:23,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:23,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-16 10:16:23,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-16 10:16:23,687 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 10:16:23,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 10:16:23,687 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 10:16:23,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 10:16:23,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:16:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:16:23,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:16:23,689 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 10:16:23,861 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:16:23,862 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:16:24,138 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:16:24,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:16:24,146 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 10:16:24,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:24 BoogieIcfgContainer [2022-09-16 10:16:24,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:16:24,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:16:24,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:16:24,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:16:24,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:16:22" (1/3) ... [2022-09-16 10:16:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c01547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:24, skipping insertion in model container [2022-09-16 10:16:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:23" (2/3) ... [2022-09-16 10:16:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c01547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:24, skipping insertion in model container [2022-09-16 10:16:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:24" (3/3) ... [2022-09-16 10:16:24,155 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-09-16 10:16:24,161 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:16:24,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:16:24,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-09-16 10:16:24,167 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:16:24,241 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 10:16:24,262 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 10:16:24,748 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22116 states, 22068 states have (on average 2.8414446257023744) internal successors, (62705), 22115 states have internal predecessors, (62705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:24,816 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:16:24,821 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=FINITE_AUTOMATA, 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;@20b63f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:16:24,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-09-16 10:16:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 22116 states, 22068 states have (on average 2.8414446257023744) internal successors, (62705), 22115 states have internal predecessors, (62705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-09-16 10:16:24,888 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:24,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:24,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -731197578, now seen corresponding path program 1 times [2022-09-16 10:16:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:24,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025940979] [2022-09-16 10:16:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:24,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:25,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025940979] [2022-09-16 10:16:25,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025940979] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:25,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:25,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 10:16:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739916135] [2022-09-16 10:16:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:25,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:16:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:25,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:16:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:16:25,481 INFO L87 Difference]: Start difference. First operand has 22116 states, 22068 states have (on average 2.8414446257023744) internal successors, (62705), 22115 states have internal predecessors, (62705), 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) Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:26,118 INFO L93 Difference]: Finished difference Result 21859 states and 61196 transitions. [2022-09-16 10:16:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:16:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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) Word has length 85 [2022-09-16 10:16:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:26,339 INFO L225 Difference]: With dead ends: 21859 [2022-09-16 10:16:26,339 INFO L226 Difference]: Without dead ends: 21778 [2022-09-16 10:16:26,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:16:26,345 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 443 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:26,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1449 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:16:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21778 states. [2022-09-16 10:16:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21778 to 21778. [2022-09-16 10:16:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21778 states, 21724 states have (on average 2.8064813109924507) internal successors, (60968), 21777 states have internal predecessors, (60968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21778 states to 21778 states and 60968 transitions. [2022-09-16 10:16:27,145 INFO L78 Accepts]: Start accepts. Automaton has 21778 states and 60968 transitions. Word has length 85 [2022-09-16 10:16:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:27,146 INFO L495 AbstractCegarLoop]: Abstraction has 21778 states and 60968 transitions. [2022-09-16 10:16:27,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21778 states and 60968 transitions. [2022-09-16 10:16:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 10:16:27,155 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:27,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:27,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:16:27,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 992572438, now seen corresponding path program 1 times [2022-09-16 10:16:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:27,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180511209] [2022-09-16 10:16:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180511209] [2022-09-16 10:16:35,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180511209] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:35,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:35,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169101550] [2022-09-16 10:16:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:35,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:35,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:35,710 INFO L87 Difference]: Start difference. First operand 21778 states and 60968 transitions. Second operand has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:42,063 INFO L93 Difference]: Finished difference Result 23978 states and 67012 transitions. [2022-09-16 10:16:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 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) Word has length 86 [2022-09-16 10:16:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:42,121 INFO L225 Difference]: With dead ends: 23978 [2022-09-16 10:16:42,121 INFO L226 Difference]: Without dead ends: 23978 [2022-09-16 10:16:42,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:16:42,122 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 746 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:42,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3788 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-09-16 10:16:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23978 states. [2022-09-16 10:16:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23978 to 22898. [2022-09-16 10:16:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22898 states, 22844 states have (on average 2.8031430572579232) internal successors, (64035), 22897 states have internal predecessors, (64035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22898 states to 22898 states and 64035 transitions. [2022-09-16 10:16:42,623 INFO L78 Accepts]: Start accepts. Automaton has 22898 states and 64035 transitions. Word has length 86 [2022-09-16 10:16:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:42,624 INFO L495 AbstractCegarLoop]: Abstraction has 22898 states and 64035 transitions. [2022-09-16 10:16:42,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22898 states and 64035 transitions. [2022-09-16 10:16:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 10:16:42,630 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:42,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:42,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 10:16:42,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1810513622, now seen corresponding path program 1 times [2022-09-16 10:16:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:42,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846358011] [2022-09-16 10:16:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:43,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846358011] [2022-09-16 10:16:43,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846358011] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:43,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:43,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:16:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036403833] [2022-09-16 10:16:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:16:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:16:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:16:43,149 INFO L87 Difference]: Start difference. First operand 22898 states and 64035 transitions. Second operand has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:44,913 INFO L93 Difference]: Finished difference Result 36064 states and 101030 transitions. [2022-09-16 10:16:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:16:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 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) Word has length 91 [2022-09-16 10:16:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:45,014 INFO L225 Difference]: With dead ends: 36064 [2022-09-16 10:16:45,014 INFO L226 Difference]: Without dead ends: 36064 [2022-09-16 10:16:45,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 10:16:45,018 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 3482 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:45,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 4641 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:16:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36064 states. [2022-09-16 10:16:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36064 to 27700. [2022-09-16 10:16:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27700 states, 27646 states have (on average 2.8161397670549086) internal successors, (77855), 27699 states have internal predecessors, (77855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27700 states to 27700 states and 77855 transitions. [2022-09-16 10:16:45,754 INFO L78 Accepts]: Start accepts. Automaton has 27700 states and 77855 transitions. Word has length 91 [2022-09-16 10:16:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:45,754 INFO L495 AbstractCegarLoop]: Abstraction has 27700 states and 77855 transitions. [2022-09-16 10:16:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27700 states and 77855 transitions. [2022-09-16 10:16:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-09-16 10:16:45,761 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:45,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 10:16:45,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:45,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1381084976, now seen corresponding path program 1 times [2022-09-16 10:16:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:45,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343404495] [2022-09-16 10:16:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343404495] [2022-09-16 10:16:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343404495] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:45,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:45,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 10:16:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122232653] [2022-09-16 10:16:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:45,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:45,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:45,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:45,799 INFO L87 Difference]: Start difference. First operand 27700 states and 77855 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:45,988 INFO L93 Difference]: Finished difference Result 47010 states and 131774 transitions. [2022-09-16 10:16:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:16:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) Word has length 94 [2022-09-16 10:16:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:46,110 INFO L225 Difference]: With dead ends: 47010 [2022-09-16 10:16:46,110 INFO L226 Difference]: Without dead ends: 47010 [2022-09-16 10:16:46,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:46,117 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 208 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:46,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 906 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47010 states. [2022-09-16 10:16:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47010 to 29088. [2022-09-16 10:16:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29088 states, 29034 states have (on average 2.8148722187779844) internal successors, (81727), 29087 states have internal predecessors, (81727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 81727 transitions. [2022-09-16 10:16:47,178 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 81727 transitions. Word has length 94 [2022-09-16 10:16:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:47,179 INFO L495 AbstractCegarLoop]: Abstraction has 29088 states and 81727 transitions. [2022-09-16 10:16:47,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 81727 transitions. [2022-09-16 10:16:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 10:16:47,185 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:47,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 10:16:47,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1147024205, now seen corresponding path program 1 times [2022-09-16 10:16:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528566943] [2022-09-16 10:16:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:47,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528566943] [2022-09-16 10:16:47,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528566943] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:47,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712742954] [2022-09-16 10:16:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:47,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:47,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:47,238 INFO L87 Difference]: Start difference. First operand 29088 states and 81727 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:47,611 INFO L93 Difference]: Finished difference Result 51879 states and 145951 transitions. [2022-09-16 10:16:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-09-16 10:16:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:47,760 INFO L225 Difference]: With dead ends: 51879 [2022-09-16 10:16:47,760 INFO L226 Difference]: Without dead ends: 51879 [2022-09-16 10:16:47,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:47,761 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 267 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:47,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 932 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51879 states. [2022-09-16 10:16:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51879 to 49313. [2022-09-16 10:16:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49313 states, 49259 states have (on average 2.846667614040074) internal successors, (140224), 49312 states have internal predecessors, (140224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49313 states to 49313 states and 140224 transitions. [2022-09-16 10:16:48,823 INFO L78 Accepts]: Start accepts. Automaton has 49313 states and 140224 transitions. Word has length 95 [2022-09-16 10:16:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:48,823 INFO L495 AbstractCegarLoop]: Abstraction has 49313 states and 140224 transitions. [2022-09-16 10:16:48,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 49313 states and 140224 transitions. [2022-09-16 10:16:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:16:48,830 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:48,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:48,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 10:16:48,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash 96222015, now seen corresponding path program 1 times [2022-09-16 10:16:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:48,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590400064] [2022-09-16 10:16:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:50,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590400064] [2022-09-16 10:16:50,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590400064] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:50,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:50,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746790654] [2022-09-16 10:16:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:50,387 INFO L87 Difference]: Start difference. First operand 49313 states and 140224 transitions. Second operand has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:52,135 INFO L93 Difference]: Finished difference Result 53192 states and 151096 transitions. [2022-09-16 10:16:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:52,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 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) Word has length 96 [2022-09-16 10:16:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:52,274 INFO L225 Difference]: With dead ends: 53192 [2022-09-16 10:16:52,275 INFO L226 Difference]: Without dead ends: 53192 [2022-09-16 10:16:52,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2022-09-16 10:16:52,276 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 772 mSDsluCounter, 3320 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:52,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 3712 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:16:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53192 states. [2022-09-16 10:16:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53192 to 51250. [2022-09-16 10:16:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51250 states, 51196 states have (on average 2.845144151886866) internal successors, (145660), 51249 states have internal predecessors, (145660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51250 states to 51250 states and 145660 transitions. [2022-09-16 10:16:53,479 INFO L78 Accepts]: Start accepts. Automaton has 51250 states and 145660 transitions. Word has length 96 [2022-09-16 10:16:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:53,479 INFO L495 AbstractCegarLoop]: Abstraction has 51250 states and 145660 transitions. [2022-09-16 10:16:53,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51250 states and 145660 transitions. [2022-09-16 10:16:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-09-16 10:16:53,487 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:53,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:53,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 10:16:53,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1823850669, now seen corresponding path program 1 times [2022-09-16 10:16:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:53,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137613057] [2022-09-16 10:16:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:54,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137613057] [2022-09-16 10:16:54,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137613057] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:54,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:54,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:16:54,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410445044] [2022-09-16 10:16:54,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:54,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:16:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:54,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:16:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:16:54,087 INFO L87 Difference]: Start difference. First operand 51250 states and 145660 transitions. Second operand has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:55,562 INFO L93 Difference]: Finished difference Result 64136 states and 181611 transitions. [2022-09-16 10:16:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:16:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 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) Word has length 101 [2022-09-16 10:16:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:55,717 INFO L225 Difference]: With dead ends: 64136 [2022-09-16 10:16:55,717 INFO L226 Difference]: Without dead ends: 64136 [2022-09-16 10:16:55,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 10:16:55,718 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 2077 mSDsluCounter, 3250 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2077 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:55,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2077 Valid, 3788 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:16:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64136 states. [2022-09-16 10:16:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64136 to 55001. [2022-09-16 10:16:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55001 states, 54947 states have (on average 2.8504376945056147) internal successors, (156623), 55000 states have internal predecessors, (156623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55001 states to 55001 states and 156623 transitions. [2022-09-16 10:16:57,039 INFO L78 Accepts]: Start accepts. Automaton has 55001 states and 156623 transitions. Word has length 101 [2022-09-16 10:16:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:57,039 INFO L495 AbstractCegarLoop]: Abstraction has 55001 states and 156623 transitions. [2022-09-16 10:16:57,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 55001 states and 156623 transitions. [2022-09-16 10:16:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-09-16 10:16:57,047 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:57,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:57,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 10:16:57,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1482775012, now seen corresponding path program 1 times [2022-09-16 10:16:57,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:57,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278632286] [2022-09-16 10:16:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:57,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278632286] [2022-09-16 10:16:57,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278632286] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574871236] [2022-09-16 10:16:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:57,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:57,123 INFO L87 Difference]: Start difference. First operand 55001 states and 156623 transitions. Second operand has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:57,614 INFO L93 Difference]: Finished difference Result 78661 states and 223274 transitions. [2022-09-16 10:16:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 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) Word has length 102 [2022-09-16 10:16:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:57,830 INFO L225 Difference]: With dead ends: 78661 [2022-09-16 10:16:57,830 INFO L226 Difference]: Without dead ends: 78661 [2022-09-16 10:16:57,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:57,831 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 315 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:57,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1056 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78661 states. [2022-09-16 10:16:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78661 to 75649. [2022-09-16 10:16:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75649 states, 75595 states have (on average 2.8644222501488192) internal successors, (216536), 75648 states have internal predecessors, (216536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75649 states to 75649 states and 216536 transitions. [2022-09-16 10:16:59,531 INFO L78 Accepts]: Start accepts. Automaton has 75649 states and 216536 transitions. Word has length 102 [2022-09-16 10:16:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:59,531 INFO L495 AbstractCegarLoop]: Abstraction has 75649 states and 216536 transitions. [2022-09-16 10:16:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 75649 states and 216536 transitions. [2022-09-16 10:16:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-09-16 10:16:59,542 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:59,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:59,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 10:16:59,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 742742521, now seen corresponding path program 1 times [2022-09-16 10:16:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:59,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088321799] [2022-09-16 10:16:59,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:59,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088321799] [2022-09-16 10:16:59,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088321799] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:59,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213789110] [2022-09-16 10:16:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:16:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:16:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:16:59,585 INFO L87 Difference]: Start difference. First operand 75649 states and 216536 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:59,839 INFO L93 Difference]: Finished difference Result 7144 states and 17997 transitions. [2022-09-16 10:16:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:16:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-09-16 10:16:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:59,854 INFO L225 Difference]: With dead ends: 7144 [2022-09-16 10:16:59,854 INFO L226 Difference]: Without dead ends: 7025 [2022-09-16 10:16:59,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:16:59,859 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 83 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:59,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 332 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2022-09-16 10:16:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2022-09-16 10:16:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 7013 states have (on average 2.5264508769428207) internal successors, (17718), 7024 states have internal predecessors, (17718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 17718 transitions. [2022-09-16 10:16:59,969 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 17718 transitions. Word has length 106 [2022-09-16 10:16:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:59,969 INFO L495 AbstractCegarLoop]: Abstraction has 7025 states and 17718 transitions. [2022-09-16 10:16:59,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:16:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 17718 transitions. [2022-09-16 10:16:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-09-16 10:16:59,974 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:59,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:59,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:16:59,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:16:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash 603226518, now seen corresponding path program 1 times [2022-09-16 10:16:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:59,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128920506] [2022-09-16 10:16:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:00,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128920506] [2022-09-16 10:17:00,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128920506] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:00,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:17:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683988952] [2022-09-16 10:17:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 10:17:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 10:17:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-09-16 10:17:00,255 INFO L87 Difference]: Start difference. First operand 7025 states and 17718 transitions. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:00,818 INFO L93 Difference]: Finished difference Result 7089 states and 17887 transitions. [2022-09-16 10:17:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 10:17:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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) Word has length 121 [2022-09-16 10:17:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:00,828 INFO L225 Difference]: With dead ends: 7089 [2022-09-16 10:17:00,829 INFO L226 Difference]: Without dead ends: 7089 [2022-09-16 10:17:00,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:17:00,830 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 631 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:00,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1839 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:17:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-09-16 10:17:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 7052. [2022-09-16 10:17:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7052 states, 7040 states have (on average 2.5269886363636362) internal successors, (17790), 7051 states have internal predecessors, (17790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7052 states to 7052 states and 17790 transitions. [2022-09-16 10:17:00,992 INFO L78 Accepts]: Start accepts. Automaton has 7052 states and 17790 transitions. Word has length 121 [2022-09-16 10:17:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:00,992 INFO L495 AbstractCegarLoop]: Abstraction has 7052 states and 17790 transitions. [2022-09-16 10:17:00,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7052 states and 17790 transitions. [2022-09-16 10:17:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-09-16 10:17:00,996 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:00,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:00,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 10:17:00,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash -596804606, now seen corresponding path program 1 times [2022-09-16 10:17:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:00,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217636907] [2022-09-16 10:17:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:00,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:10,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:10,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217636907] [2022-09-16 10:17:10,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217636907] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:10,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:10,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:17:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594543843] [2022-09-16 10:17:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:10,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:17:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:17:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:17:10,796 INFO L87 Difference]: Start difference. First operand 7052 states and 17790 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:15,279 INFO L93 Difference]: Finished difference Result 7755 states and 19633 transitions. [2022-09-16 10:17:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 10:17:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 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) Word has length 126 [2022-09-16 10:17:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:15,291 INFO L225 Difference]: With dead ends: 7755 [2022-09-16 10:17:15,291 INFO L226 Difference]: Without dead ends: 7755 [2022-09-16 10:17:15,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:15,292 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 480 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:15,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2149 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-09-16 10:17:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2022-09-16 10:17:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7496. [2022-09-16 10:17:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7496 states, 7484 states have (on average 2.532602886157135) internal successors, (18954), 7495 states have internal predecessors, (18954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 18954 transitions. [2022-09-16 10:17:15,414 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 18954 transitions. Word has length 126 [2022-09-16 10:17:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:15,415 INFO L495 AbstractCegarLoop]: Abstraction has 7496 states and 18954 transitions. [2022-09-16 10:17:15,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 18954 transitions. [2022-09-16 10:17:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-09-16 10:17:15,420 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:15,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:15,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 10:17:15,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2106228004, now seen corresponding path program 2 times [2022-09-16 10:17:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:15,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122527406] [2022-09-16 10:17:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122527406] [2022-09-16 10:17:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122527406] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:15,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:15,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:17:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653525620] [2022-09-16 10:17:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:15,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:17:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:17:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:17:15,896 INFO L87 Difference]: Start difference. First operand 7496 states and 18954 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:16,687 INFO L93 Difference]: Finished difference Result 7422 states and 18723 transitions. [2022-09-16 10:17:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:17:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 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) Word has length 126 [2022-09-16 10:17:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:16,698 INFO L225 Difference]: With dead ends: 7422 [2022-09-16 10:17:16,698 INFO L226 Difference]: Without dead ends: 7422 [2022-09-16 10:17:16,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:16,699 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1099 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:16,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1555 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:17:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2022-09-16 10:17:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 6941. [2022-09-16 10:17:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 6929 states have (on average 2.5201327752922498) internal successors, (17462), 6940 states have internal predecessors, (17462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 17462 transitions. [2022-09-16 10:17:16,787 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 17462 transitions. Word has length 126 [2022-09-16 10:17:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:16,788 INFO L495 AbstractCegarLoop]: Abstraction has 6941 states and 17462 transitions. [2022-09-16 10:17:16,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 17462 transitions. [2022-09-16 10:17:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-09-16 10:17:16,791 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:16,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:16,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-16 10:17:16,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1414442702, now seen corresponding path program 1 times [2022-09-16 10:17:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420023080] [2022-09-16 10:17:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420023080] [2022-09-16 10:17:17,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420023080] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:17,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519742041] [2022-09-16 10:17:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:17,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:17:17,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 10:17:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:17,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:17:17,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:17,770 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:17:17,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:17:17,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:17,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:18,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:18,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:18,480 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:17:18,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:17:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:18,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:18,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:17:18,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:18,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-16 10:17:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:18,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:19,172 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:17:19,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 42 [2022-09-16 10:17:19,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:19,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:17:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:19,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:17:19,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:19,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (< (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_350) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:19,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (< (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_350) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:19,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:19,517 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:17:19,620 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_346 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (or (not (<= v_ArrVal_346 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_346) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:17:19,662 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_346 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_346) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_346))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:17:19,674 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_346 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_346) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_346) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:17:19,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (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_344)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_346) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_346))))) is different from false [2022-09-16 10:17:19,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (or (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_346) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse4) (< (+ (select .cse1 .cse2) 1) v_ArrVal_346))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:17:19,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_344)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_346) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= .cse5 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_346)))))) is different from false [2022-09-16 10:17:19,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_346) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_352)) .cse1) 2147483647) (= .cse5 20)))))) is different from false [2022-09-16 10:17:19,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_346) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse6 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_346) (= .cse5 20))))))) is different from false [2022-09-16 10:17:20,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_341 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_341)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_341 0)) (= 20 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_346) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_352)) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse6 .cse2))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_346))))))) is different from false [2022-09-16 10:17:20,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:20,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 309 treesize of output 194 [2022-09-16 10:17:20,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:20,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 306 [2022-09-16 10:17:20,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2022-09-16 10:17:20,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 163 [2022-09-16 10:17:20,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:20,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:17:20,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:20,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 720 treesize of output 652 [2022-09-16 10:17:22,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:22,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-09-16 10:17:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:17:22,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519742041] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:17:22,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:17:22,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:17:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824417143] [2022-09-16 10:17:22,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:17:22,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:17:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:22,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:17:22,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=3855, Unknown=17, NotChecked=1974, Total=6320 [2022-09-16 10:17:22,718 INFO L87 Difference]: Start difference. First operand 6941 states and 17462 transitions. Second operand has 80 states, 79 states have (on average 4.30379746835443) internal successors, (340), 80 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:23,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 84))) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (<= .cse1 0) (= 0 .cse1) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse5 .cse3))) (or (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse8 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346) (= .cse7 20))))))) (= 7 |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select .cse0 88) 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 10:17:24,084 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_346) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse7 .cse2))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_346) (= .cse6 20))))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 88) 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:24,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse1 84) 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse1 88) 0) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse5 .cse3))) (or (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse8 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346) (= .cse7 20))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:24,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88))) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse5 .cse3))) (or (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse8 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346) (= .cse7 20))))))) (= (select .cse9 88) 0) (= 7 |c_~#queue~0.base|) (= (select .cse9 .cse1) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:25,461 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (= (select .cse0 84) 0) (not .cse1) (= (select .cse0 88) 0)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse1 (= (select .cse2 84) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select .cse2 88) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 84)))))) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse4))) (or (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_346) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_352)) .cse7) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse9 .cse4))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_346) (= .cse8 20))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:26,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse1 .cse4))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_346) .cse4 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_352)) .cse2) 2147483647) (= .cse6 20)))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 88) 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:26,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= (select .cse1 88) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse1 84) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_344)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (select .cse5 .cse3)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= .cse7 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346)))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:28,609 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= (select .cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (or (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_344)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse3 .cse5)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_346) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_352)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse6) (< (+ (select .cse3 .cse4) 1) v_ArrVal_346))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= (select .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:30,954 INFO L93 Difference]: Finished difference Result 16936 states and 42764 transitions. [2022-09-16 10:17:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-09-16 10:17:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 4.30379746835443) internal successors, (340), 80 states have internal predecessors, (340), 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) Word has length 127 [2022-09-16 10:17:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:30,975 INFO L225 Difference]: With dead ends: 16936 [2022-09-16 10:17:30,975 INFO L226 Difference]: Without dead ends: 16936 [2022-09-16 10:17:30,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 207 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 4091 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1239, Invalid=9330, Unknown=25, NotChecked=4906, Total=15500 [2022-09-16 10:17:30,978 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1458 mSDsluCounter, 10885 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 11147 SdHoareTripleChecker+Invalid, 7635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5581 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:30,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 11147 Invalid, 7635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1925 Invalid, 0 Unknown, 5581 Unchecked, 0.9s Time] [2022-09-16 10:17:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16936 states. [2022-09-16 10:17:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16936 to 7217. [2022-09-16 10:17:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7217 states, 7205 states have (on average 2.5072866065232478) internal successors, (18065), 7216 states have internal predecessors, (18065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 18065 transitions. [2022-09-16 10:17:31,092 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 18065 transitions. Word has length 127 [2022-09-16 10:17:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:31,092 INFO L495 AbstractCegarLoop]: Abstraction has 7217 states and 18065 transitions. [2022-09-16 10:17:31,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 4.30379746835443) internal successors, (340), 80 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 18065 transitions. [2022-09-16 10:17:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:17:31,096 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:31,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:31,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-16 10:17:31,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-09-16 10:17:31,299 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 751752859, now seen corresponding path program 1 times [2022-09-16 10:17:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899699576] [2022-09-16 10:17:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:32,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899699576] [2022-09-16 10:17:32,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899699576] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113815160] [2022-09-16 10:17:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:32,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:32,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:17:32,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 10:17:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:32,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:17:32,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:32,201 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:17:32,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:17:32,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:32,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:32,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:32,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:32,835 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:17:32,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:17:32,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:32,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:32,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:17:33,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-16 10:17:33,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:33,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:33,487 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:17:33,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 42 [2022-09-16 10:17:33,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:17:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:33,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:17:33,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:33,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (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_420) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:33,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (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_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:33,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:33,813 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 10:17:33,821 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_422 Int) (v_ArrVal_420 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 10:17:33,842 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_416) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_416 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2022-09-16 10:17:33,876 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_416) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_416)))) is different from false [2022-09-16 10:17:33,890 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 .cse2 v_ArrVal_416) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_416))))) is different from false [2022-09-16 10:17:33,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (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_414)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_416) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416))))) is different from false [2022-09-16 10:17:33,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_414)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_416) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_416) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse4))))))) is different from false [2022-09-16 10:17:33,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_414)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_416) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_416) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse4)))))))) is different from false [2022-09-16 10:17:34,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_416) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse1))) (= .cse4 20)))))) is different from false [2022-09-16 10:17:34,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_416) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse6 .cse2))))))))) is different from false [2022-09-16 10:17:34,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 Int) (v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_412)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_416) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse4) 2147483647) (= 20 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse6 .cse1))) (not (<= v_ArrVal_412 0)) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_416))))))) is different from false [2022-09-16 10:17:34,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:34,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 309 treesize of output 194 [2022-09-16 10:17:34,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:34,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 306 [2022-09-16 10:17:34,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2022-09-16 10:17:34,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 167 [2022-09-16 10:17:34,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:17:34,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:34,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 207 treesize of output 215 [2022-09-16 10:17:35,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:35,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-09-16 10:17:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:17:35,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113815160] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:17:35,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:17:35,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:17:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933159983] [2022-09-16 10:17:35,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:17:35,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:17:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:17:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3758, Unknown=15, NotChecked=2100, Total=6320 [2022-09-16 10:17:35,733 INFO L87 Difference]: Start difference. First operand 7217 states and 18065 transitions. Second operand has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:38,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse2 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse1 (= (select .cse0 84) 0))) (or (and .cse1 (not .cse2) (= (select .cse0 88) 0)) (and .cse2 .cse1 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse7 .cse5)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse3) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_416) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse8) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse9 .cse5))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:38,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select .cse5 .cse3)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_416) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse6) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse7 .cse3))))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (= (select .cse10 84) 0))) (or (and .cse8 .cse9 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)) (and (not .cse8) .cse9 (= .cse0 .cse10) (= (select .cse0 88) 0))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:39,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse4 (+ |c_ULTIMATE.start_empty_~q#1.offset| 84))) (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse3 (= (select .cse2 .cse4) 0))) (or (and (not .cse1) (= .cse2 .cse0) .cse3 (= (select .cse0 88) 0)) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse4)) .cse1 (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0) .cse3)))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse9 .cse7)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse5) (< (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_416) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse10) 2147483647) (< (+ (select .cse9 .cse10) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse11 .cse7))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:39,811 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (= (select .cse0 84) 0) (not .cse1) (= (select .cse0 88) 0)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse1 (= (select .cse2 84) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select .cse2 88) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 84)))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse7 .cse5)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse3) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_416) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse8) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse9 .cse5))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:40,344 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse2))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_416) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_422)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse6 .cse2))) (= .cse5 20)))))) (= (select .cse0 88) 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:40,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= (select .cse1 88) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse1 84) 0) (forall ((v_ArrVal_422 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_414)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select .cse3 .cse6))) (or (= .cse2 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_416) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_416) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse7 .cse6)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:42,886 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= (select .cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_414)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (select .cse2 .cse5))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_416) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_416) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse6))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (= (select .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:44,579 INFO L93 Difference]: Finished difference Result 7702 states and 19243 transitions. [2022-09-16 10:17:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 10:17:44,579 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 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) Word has length 128 [2022-09-16 10:17:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:44,591 INFO L225 Difference]: With dead ends: 7702 [2022-09-16 10:17:44,592 INFO L226 Difference]: Without dead ends: 7702 [2022-09-16 10:17:44,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 207 SyntacticMatches, 20 SemanticMatches, 113 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 3525 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1054, Invalid=7568, Unknown=22, NotChecked=4466, Total=13110 [2022-09-16 10:17:44,595 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 573 mSDsluCounter, 5458 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 5586 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2475 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:44,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 5586 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 786 Invalid, 0 Unknown, 2475 Unchecked, 0.4s Time] [2022-09-16 10:17:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7702 states. [2022-09-16 10:17:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7702 to 7268. [2022-09-16 10:17:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 7256 states have (on average 2.5038588754134508) internal successors, (18168), 7267 states have internal predecessors, (18168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 18168 transitions. [2022-09-16 10:17:44,679 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 18168 transitions. Word has length 128 [2022-09-16 10:17:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:44,680 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 18168 transitions. [2022-09-16 10:17:44,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 18168 transitions. [2022-09-16 10:17:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:17:44,684 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:44,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:44,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-16 10:17:44,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-09-16 10:17:44,885 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1830910923, now seen corresponding path program 2 times [2022-09-16 10:17:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657213251] [2022-09-16 10:17:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657213251] [2022-09-16 10:17:45,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657213251] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020884490] [2022-09-16 10:17:45,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:17:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:45,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:17:45,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 10:17:45,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:17:45,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:17:45,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 74 conjunts are in the unsatisfiable core [2022-09-16 10:17:45,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:45,901 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:17:45,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:17:46,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:46,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:46,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:46,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:46,554 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:17:46,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-09-16 10:17:46,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:46,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:46,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:17:46,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:46,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-16 10:17:47,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:47,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:17:47,214 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:17:47,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 42 [2022-09-16 10:17:47,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:47,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:17:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:47,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:17:47,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:47,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (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_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:47,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (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_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:47,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:47,529 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:17:47,537 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:17:47,559 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_486 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (or (not (<= v_ArrVal_486 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_486) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:17:47,589 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_486 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_486) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_486)))) is different from false [2022-09-16 10:17:47,601 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_486 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_486) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_486) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:17:47,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse0 (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_485)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_486) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_486) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse4))))) is different from false [2022-09-16 10:17:47,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_485)))) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_486) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_486) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:17:47,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_485)))) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (select .cse1 .cse3))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_486) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_491)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_486) (= 20 .cse4)))))) is different from false [2022-09-16 10:17:47,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_485)))) (let ((.cse0 (select .cse3 .cse2)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_486) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_491)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_486)))))) is different from false [2022-09-16 10:17:47,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_485)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_486) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_491)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_486) (= .cse5 20)))))) is different from false [2022-09-16 10:17:48,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 Int) (v_ArrVal_485 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_481)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_485)))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_486) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_491)) .cse4) 2147483647) (= .cse5 20) (not (<= v_ArrVal_481 0)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_486)))))) is different from false [2022-09-16 10:17:48,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 425 treesize of output 235 [2022-09-16 10:17:48,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 336 treesize of output 320 [2022-09-16 10:17:48,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 139 [2022-09-16 10:17:48,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 192 [2022-09-16 10:17:48,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:17:48,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 371 treesize of output 291 [2022-09-16 10:17:48,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-09-16 10:17:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:17:48,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020884490] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:17:48,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:17:48,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:17:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345195147] [2022-09-16 10:17:48,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:17:48,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:17:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:17:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=3757, Unknown=15, NotChecked=2100, Total=6320 [2022-09-16 10:17:48,889 INFO L87 Difference]: Start difference. First operand 7268 states and 18168 transitions. Second operand has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:53,367 INFO L93 Difference]: Finished difference Result 9456 states and 23804 transitions. [2022-09-16 10:17:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 10:17:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 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) Word has length 128 [2022-09-16 10:17:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:53,382 INFO L225 Difference]: With dead ends: 9456 [2022-09-16 10:17:53,382 INFO L226 Difference]: Without dead ends: 9456 [2022-09-16 10:17:53,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 206 SyntacticMatches, 25 SemanticMatches, 116 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3596 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1755, Invalid=8796, Unknown=15, NotChecked=3240, Total=13806 [2022-09-16 10:17:53,385 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 3453 mSDsluCounter, 5074 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3453 SdHoareTripleChecker+Valid, 5306 SdHoareTripleChecker+Invalid, 7523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6027 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:53,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3453 Valid, 5306 Invalid, 7523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1275 Invalid, 0 Unknown, 6027 Unchecked, 0.7s Time] [2022-09-16 10:17:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9456 states. [2022-09-16 10:17:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9456 to 7105. [2022-09-16 10:17:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7093 states have (on average 2.5152967714648247) internal successors, (17841), 7104 states have internal predecessors, (17841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 17841 transitions. [2022-09-16 10:17:53,521 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 17841 transitions. Word has length 128 [2022-09-16 10:17:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:53,522 INFO L495 AbstractCegarLoop]: Abstraction has 7105 states and 17841 transitions. [2022-09-16 10:17:53,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 4.341772151898734) internal successors, (343), 80 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:17:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 17841 transitions. [2022-09-16 10:17:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:17:53,526 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:53,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:53,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-16 10:17:53,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:53,727 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:17:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 898051427, now seen corresponding path program 1 times [2022-09-16 10:17:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:53,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521839116] [2022-09-16 10:17:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521839116] [2022-09-16 10:17:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521839116] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565142288] [2022-09-16 10:17:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:54,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:17:54,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 10:17:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 10:17:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:54,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:17:54,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-09-16 10:17:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:54,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:17:54,782 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 10:17:54,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 32 [2022-09-16 10:17:55,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-09-16 10:17:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:55,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:24,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_555 Int) (v_ArrVal_553 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_553) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_555) (+ 88 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_555 2147483648) 0))) is different from false [2022-09-16 10:18:24,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (< (+ v_ArrVal_555 2147483648) 0) (< 0 (+ 2147483650 (select (store (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|) v_ArrVal_551)) |c_~#stored_elements~0.base| v_ArrVal_553) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_555) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 10:18:24,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:24,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-09-16 10:18:24,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:24,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 60 [2022-09-16 10:18:24,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2022-09-16 10:18:24,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-09-16 10:18:24,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:24,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-09-16 10:18:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:24,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565142288] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:24,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:24,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-09-16 10:18:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313530251] [2022-09-16 10:18:24,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:24,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 10:18:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 10:18:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1999, Unknown=59, NotChecked=186, Total=2450 [2022-09-16 10:18:24,641 INFO L87 Difference]: Start difference. First operand 7105 states and 17841 transitions. Second operand has 50 states, 49 states have (on average 6.979591836734694) internal successors, (342), 50 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:18:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:18:27,200 INFO L93 Difference]: Finished difference Result 15855 states and 40321 transitions. [2022-09-16 10:18:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 10:18:27,201 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 6.979591836734694) internal successors, (342), 50 states have internal predecessors, (342), 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) Word has length 128 [2022-09-16 10:18:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:18:27,227 INFO L225 Difference]: With dead ends: 15855 [2022-09-16 10:18:27,227 INFO L226 Difference]: Without dead ends: 15855 [2022-09-16 10:18:27,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 229 SyntacticMatches, 27 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=1187, Invalid=4614, Unknown=59, NotChecked=302, Total=6162 [2022-09-16 10:18:27,229 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 4752 mSDsluCounter, 5886 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4752 SdHoareTripleChecker+Valid, 6296 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:18:27,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4752 Valid, 6296 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1177 Invalid, 0 Unknown, 1352 Unchecked, 0.5s Time] [2022-09-16 10:18:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15855 states. [2022-09-16 10:18:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15855 to 9431. [2022-09-16 10:18:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9431 states, 9419 states have (on average 2.5676823441978978) internal successors, (24185), 9430 states have internal predecessors, (24185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:18:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9431 states to 9431 states and 24185 transitions. [2022-09-16 10:18:27,444 INFO L78 Accepts]: Start accepts. Automaton has 9431 states and 24185 transitions. Word has length 128 [2022-09-16 10:18:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:18:27,445 INFO L495 AbstractCegarLoop]: Abstraction has 9431 states and 24185 transitions. [2022-09-16 10:18:27,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 6.979591836734694) internal successors, (342), 50 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:18:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9431 states and 24185 transitions. [2022-09-16 10:18:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:18:27,450 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:18:27,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:18:27,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 10:18:27,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 10:18:27,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:18:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:18:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -104519622, now seen corresponding path program 1 times [2022-09-16 10:18:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:18:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21688238] [2022-09-16 10:18:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:18:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:28,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21688238] [2022-09-16 10:18:28,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21688238] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:18:28,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74779648] [2022-09-16 10:18:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:18:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:18:28,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:18:28,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 10:18:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:28,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 10:18:28,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:28,937 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:18:28,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:18:28,964 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:18:28,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:18:29,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:18:29,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:18:29,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:18:29,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:29,686 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:18:29,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:18:29,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:18:29,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:29,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:29,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:18:30,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:30,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:18:30,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:30,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:18:30,375 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:18:30,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 10:18:30,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:30,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:18:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:30,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:55,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:18:55,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int)) (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|) v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_627 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 10:18:55,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int)) (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|) v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_627)))) is different from false [2022-09-16 10:18:55,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_627) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-09-16 10:18:55,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_627) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_625 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-09-16 10:18:55,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_627) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_625))))) is different from false [2022-09-16 10:18:55,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_625) .cse3 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_625) (< (+ (select .cse1 .cse3) 1) v_ArrVal_627) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:18:55,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_625) .cse3 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_625) (< (+ (select .cse1 .cse3) 1) v_ArrVal_627)))))) is different from false [2022-09-16 10:18:55,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (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_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_625) .cse1 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_625) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:18:55,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int)) (or (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_625) .cse3 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_625) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_627)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:18:56,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_627) (< (+ (select .cse3 .cse4) 1) v_ArrVal_625))))))) is different from false [2022-09-16 10:18:56,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_625) .cse3 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_625) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse4 .cse3))))))))) is different from false [2022-09-16 10:18:56,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_625) .cse1 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_625) (< (+ (select .cse2 .cse1) 1) v_ArrVal_627) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse4 .cse1)))))))))) is different from false [2022-09-16 10:18:56,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_619)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse1) 2147483647) (not (<= v_ArrVal_619 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_627) (< (+ (select .cse3 .cse1) 1) v_ArrVal_625) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse4 .cse2)))))))))) is different from false [2022-09-16 10:18:56,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:56,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 419 treesize of output 244 [2022-09-16 10:18:56,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:56,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 566 treesize of output 562 [2022-09-16 10:18:56,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 223 [2022-09-16 10:18:56,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 351 [2022-09-16 10:18:56,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 399 [2022-09-16 10:18:56,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:56,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:18:57,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:57,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 298 [2022-09-16 10:18:58,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:58,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-09-16 10:18:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:18:58,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74779648] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:58,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:58,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-09-16 10:18:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10626376] [2022-09-16 10:18:58,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:58,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-16 10:18:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-16 10:18:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=4229, Unknown=45, NotChecked=2058, Total=6806 [2022-09-16 10:18:58,677 INFO L87 Difference]: Start difference. First operand 9431 states and 24185 transitions. Second operand has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:19:02,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_625) (< (+ (select .cse3 .cse2) 1) v_ArrVal_627) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse5 .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse8 (= (select .cse0 84) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse8 (not .cse9) (= (select .cse0 88) 0)) (and .cse9 .cse8 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)))))) is different from false [2022-09-16 10:19:03,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_625) .cse2 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_625) (< (+ (select .cse3 .cse2) 1) v_ArrVal_627) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse5 .cse2)))))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (= (select .cse10 84) 0))) (or (and .cse8 .cse9 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse8) .cse9 (= .cse0 .cse10) (= (select .cse0 88) 0))))))) is different from false [2022-09-16 10:19:03,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 84))) (let ((.cse2 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse3 (= (select .cse4 .cse1) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0) .cse3) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) (not .cse2) (= .cse4 .cse0) .cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) (= (select .cse0 88) 0))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_625) .cse6 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse5 .cse6))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_625) (< (+ (select .cse7 .cse6) 1) v_ArrVal_627) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse8) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse9 .cse6)))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:04,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) (= (select .cse0 84) 0) (not .cse1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) (= (select .cse0 88) 0)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse1 (= (select .cse2 84) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select .cse2 88) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 84)))))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_625) .cse4 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_625) (< (+ (select .cse5 .cse4) 1) v_ArrVal_627) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse7 .cse4)))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:06,192 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_625) .cse4 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_625) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse3 .cse4))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse5 .cse4))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (let ((.cse7 (= (select .cse0 84) 0)) (.cse8 (= (select .cse0 88) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) .cse8) (and .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse8))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:07,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (= (select .cse3 88) 0)) (.cse2 (= (select .cse3 84) 0))) (or (and .cse1 .cse2 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)))))) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse5 (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| (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse7 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (select (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_625) .cse6 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse5 .cse6))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_627) (< (+ (select .cse7 .cse8) 1) v_ArrVal_625))))))) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:09,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (= (select .cse5 .cse2) 0)) (.cse4 (= (select .cse5 .cse1) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2)) .cse3 .cse4) (and .cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) .cse4)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int)) (or (forall ((v_ArrVal_631 Int) (v_ArrVal_624 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_623 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624))) (let ((.cse7 (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select (store (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_625) .cse9 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse6 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_625) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse7 .cse9) 1) v_ArrVal_627)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:12,041 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse0 (select |c_#memory_int| 7)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 .cse1) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse3 84) 4) 4) (<= (select .cse4 .cse1) 1) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= (select .cse3 88) 1) (<= (* (select .cse4 .cse5) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= (select .cse0 .cse5) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse3 (+ 88 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) is different from false [2022-09-16 10:19:12,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse1 84) 4) 4) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (<= (select .cse1 88) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 88 |c_~#queue~0.offset|)) 1))) is different from false [2022-09-16 10:19:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:19:14,517 INFO L93 Difference]: Finished difference Result 17073 states and 43748 transitions. [2022-09-16 10:19:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 10:19:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 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) Word has length 132 [2022-09-16 10:19:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:19:14,551 INFO L225 Difference]: With dead ends: 17073 [2022-09-16 10:19:14,551 INFO L226 Difference]: Without dead ends: 17073 [2022-09-16 10:19:14,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 214 SyntacticMatches, 16 SemanticMatches, 120 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3806 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=1076, Invalid=8661, Unknown=57, NotChecked=4968, Total=14762 [2022-09-16 10:19:14,554 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1185 mSDsluCounter, 8468 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 8615 SdHoareTripleChecker+Invalid, 9295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7354 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:19:14,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 8615 Invalid, 9295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1845 Invalid, 0 Unknown, 7354 Unchecked, 0.8s Time] [2022-09-16 10:19:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17073 states. [2022-09-16 10:19:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17073 to 11672. [2022-09-16 10:19:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11672 states, 11660 states have (on average 2.578730703259005) internal successors, (30068), 11671 states have internal predecessors, (30068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:19:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 30068 transitions. [2022-09-16 10:19:14,777 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 30068 transitions. Word has length 132 [2022-09-16 10:19:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:19:14,777 INFO L495 AbstractCegarLoop]: Abstraction has 11672 states and 30068 transitions. [2022-09-16 10:19:14,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:19:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 30068 transitions. [2022-09-16 10:19:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:19:14,787 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:19:14,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:19:14,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 10:19:14,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-09-16 10:19:14,990 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:19:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:19:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -322267980, now seen corresponding path program 2 times [2022-09-16 10:19:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:19:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203506978] [2022-09-16 10:19:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:19:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:19:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:19:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:19:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:19:16,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203506978] [2022-09-16 10:19:16,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203506978] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:19:16,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192503295] [2022-09-16 10:19:16,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:19:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:19:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:19:16,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:19:16,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 10:19:16,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:19:16,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:19:16,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 10:19:16,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:19:16,393 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:19:16,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:19:16,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:19:16,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:19:16,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:19:16,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:19:16,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:19:17,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:19:17,307 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:19:17,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:19:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:19:17,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:19:17,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:19:17,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:19:17,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:17,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:19:17,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:19:17,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:19:18,149 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:19:18,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 10:19:18,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:18,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:19:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:19:18,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:19:44,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:19:44,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (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|) v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_703 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:19:44,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (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|) v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_703)))) is different from false [2022-09-16 10:19:44,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_703))))) is different from false [2022-09-16 10:19:44,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:19:44,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_700 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_703)))))) is different from false [2022-09-16 10:19:44,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_703) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_700)))))) is different from false [2022-09-16 10:19:44,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_703) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700))))))) is different from false [2022-09-16 10:19:45,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse1 (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_698)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (< (+ (select .cse3 .cse4) 1) v_ArrVal_703))))))) is different from false [2022-09-16 10:19:45,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_698)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_703) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:19:45,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse5 .cse4 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_703) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-09-16 10:19:45,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_703) (< (+ (select .cse2 .cse3) 1) v_ArrVal_700) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse1))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse3) 2147483647)))))))) is different from false [2022-09-16 10:19:45,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_700) (< (+ (select .cse4 .cse1) 1) v_ArrVal_703) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse1))))))))))) is different from false [2022-09-16 10:19:45,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 Int) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_695)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_700) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_703) (not (<= v_ArrVal_695 0)))))))))) is different from false [2022-09-16 10:19:45,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:45,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 408 treesize of output 248 [2022-09-16 10:19:45,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:45,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 514 [2022-09-16 10:19:46,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 352 [2022-09-16 10:19:46,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 211 [2022-09-16 10:19:46,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 320 [2022-09-16 10:19:46,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:19:46,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:46,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 266 [2022-09-16 10:19:47,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:47,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 10:19:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:19:47,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192503295] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:19:47,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:19:47,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-09-16 10:19:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84943185] [2022-09-16 10:19:47,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:19:47,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-16 10:19:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:19:47,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-16 10:19:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=4228, Unknown=44, NotChecked=2058, Total=6806 [2022-09-16 10:19:47,838 INFO L87 Difference]: Start difference. First operand 11672 states and 30068 transitions. Second operand has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:20:04,540 WARN L233 SmtUtils]: Spent 16.12s on a formula simplification. DAG size of input: 107 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:20:05,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (+ (select .cse5 .cse2) 1) v_ArrVal_703) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse2))))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (let ((.cse10 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (= (select .cse0 84) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse9 (not .cse10) (= (select .cse0 88) 0)) (and .cse10 .cse9 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)))))) is different from false [2022-09-16 10:20:05,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (+ (select .cse5 .cse2) 1) v_ArrVal_703) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse2))))))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse10 (= (select .cse11 84) 0))) (or (and .cse9 .cse10 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0)) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse9) .cse10 (= .cse0 .cse11) (= (select .cse0 88) 0))))))) is different from false [2022-09-16 10:20:06,583 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 84))) (let ((.cse2 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse3 (= (select .cse4 .cse1) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 88) 0) .cse3) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse2) (= .cse4 .cse0) .cse3 (= (select .cse0 88) 0))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store .cse7 .cse8 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store .cse9 .cse6 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse5 .cse6))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_700) (< (+ (select .cse9 .cse6) 1) v_ArrVal_703) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse8) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse10 .cse6))))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:20:07,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= (select .cse0 84) 0) (not .cse1) (= (select .cse0 88) 0)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse1 (= (select .cse2 84) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 88)) (= (select .cse2 88) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 84)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse4 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_700) (< (+ (select .cse7 .cse4) 1) v_ArrVal_703) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse8 .cse4))))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:20:08,948 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= (select .cse2 84) 0)) (.cse1 (= (select .cse2 88) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse0 .cse1) (and .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse1))) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_703) (< (+ (select .cse5 .cse6) 1) v_ArrVal_700) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse7 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse8 .cse4))) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse6) 2147483647)))))))))) is different from false [2022-09-16 10:20:10,697 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse1 .cse2 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse6 (select .cse7 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (select (store (store .cse7 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse5 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse3 (+ 84 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (< (+ 1 (select .cse6 .cse5)) v_ArrVal_703) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (= (select .cse10 88) 0)) (.cse9 (= (select .cse10 84) 0))) (or (and .cse8 .cse9 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and .cse8 (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse9)))))) is different from false [2022-09-16 10:20:12,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= (select .cse1 .cse2) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse3)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse1 .cse3) 0) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_698)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse4 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_703) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse6 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_700))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))))) is different from false [2022-09-16 10:20:15,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse1 84) 4) 4) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (<= (select .cse1 88) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 88 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) is different from false [2022-09-16 10:20:15,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_705 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_706 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse1 84) 4) 4) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (<= (select .cse1 88) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 88 |c_~#queue~0.offset|)) 1))) is different from false [2022-09-16 10:20:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:20:19,103 INFO L93 Difference]: Finished difference Result 20023 states and 50493 transitions. [2022-09-16 10:20:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-09-16 10:20:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 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) Word has length 132 [2022-09-16 10:20:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:20:19,135 INFO L225 Difference]: With dead ends: 20023 [2022-09-16 10:20:19,136 INFO L226 Difference]: Without dead ends: 20023 [2022-09-16 10:20:19,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 22 SemanticMatches, 122 ConstructedPredicates, 23 IntricatePredicates, 3 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=1175, Invalid=8961, Unknown=56, NotChecked=5060, Total=15252 [2022-09-16 10:20:19,142 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1271 mSDsluCounter, 7522 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 7684 SdHoareTripleChecker+Invalid, 6470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5011 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:20:19,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 7684 Invalid, 6470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1403 Invalid, 0 Unknown, 5011 Unchecked, 0.6s Time] [2022-09-16 10:20:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20023 states. [2022-09-16 10:20:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20023 to 13107. [2022-09-16 10:20:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13107 states, 13095 states have (on average 2.577319587628866) internal successors, (33750), 13106 states have internal predecessors, (33750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:20:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13107 states to 13107 states and 33750 transitions. [2022-09-16 10:20:19,368 INFO L78 Accepts]: Start accepts. Automaton has 13107 states and 33750 transitions. Word has length 132 [2022-09-16 10:20:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:20:19,368 INFO L495 AbstractCegarLoop]: Abstraction has 13107 states and 33750 transitions. [2022-09-16 10:20:19,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.329268292682927) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:20:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 13107 states and 33750 transitions. [2022-09-16 10:20:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:20:19,379 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:20:19,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:20:19,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-16 10:20:19,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-09-16 10:20:19,580 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:20:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:20:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1660132424, now seen corresponding path program 3 times [2022-09-16 10:20:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:20:19,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647709116] [2022-09-16 10:20:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:20:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:20:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:20:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:20:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:20:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647709116] [2022-09-16 10:20:52,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647709116] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:20:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514501279] [2022-09-16 10:20:52,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 10:20:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:20:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:20:52,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:20:52,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 10:20:53,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 10:20:53,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:20:53,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 10:20:53,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:20:53,102 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:20:53,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:20:53,135 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:20:53,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:20:53,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:20:53,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:20:53,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:20:53,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:20:53,894 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:20:53,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:20:54,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:20:54,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:20:54,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:20:54,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:54,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:20:54,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:20:54,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:20:54,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:20:54,669 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:20:54,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 10:20:54,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:54,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-09-16 10:20:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:20:54,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:21:21,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_781 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:21:21,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:21:21,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int)) (let ((.cse0 (select (store (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|) v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_778 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-09-16 10:21:21,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int)) (let ((.cse0 (select (store (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|) v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-09-16 10:21:21,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_778))))) is different from false [2022-09-16 10:21:21,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_777) .cse2 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_777 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_778))))) is different from false [2022-09-16 10:21:21,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_777) .cse2 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_777) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_778))))) is different from false [2022-09-16 10:21:21,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_777) .cse3 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_777) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_778))))) is different from false [2022-09-16 10:21:21,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse1 (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_775)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_777) .cse2 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_778) (< (+ (select .cse1 .cse3) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-09-16 10:21:21,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_775)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_777) .cse3 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_778))))))) is different from false [2022-09-16 10:21:21,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_775)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_777) .cse1 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_777) (< (+ (select .cse3 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-09-16 10:21:21,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_777) .cse1 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_777) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse1)))))))) is different from false [2022-09-16 10:21:22,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_777) .cse3 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse3))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_778))))))) is different from false [2022-09-16 10:21:22,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_772 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_777) .cse3 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_777) (not (<= v_ArrVal_772 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_778))))))) is different from false [2022-09-16 10:21:22,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:21:22,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 255 treesize of output 170 [2022-09-16 10:21:22,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:21:22,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 661 treesize of output 655 [2022-09-16 10:21:22,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 529 [2022-09-16 10:21:22,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 589 treesize of output 541 [2022-09-16 10:21:22,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 193 [2022-09-16 10:21:22,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:21:22,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:21:22,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:21:22,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 196 [2022-09-16 10:21:23,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:21:23,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-09-16 10:21:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 10:21:24,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514501279] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:21:24,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:21:24,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 10:21:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276960046] [2022-09-16 10:21:24,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:21:24,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 10:21:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:21:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 10:21:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4324, Unknown=44, NotChecked=2086, Total=6972 [2022-09-16 10:21:24,053 INFO L87 Difference]: Start difference. First operand 13107 states and 33750 transitions. Second operand has 84 states, 83 states have (on average 4.27710843373494) internal successors, (355), 84 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:21:25,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= .cse1 .cse2) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (<= (select .cse2 (+ |c_ULTIMATE.start_init_~q#1.offset| 84)) 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_777) .cse6 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse7 .cse6))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse4) 2147483647) (< (+ (select .cse3 .cse6) 1) v_ArrVal_778))))))) (= .cse1 .cse0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 10:21:26,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse0 .cse1))) (let ((.cse5 (store .cse0 .cse4 0))) (let ((.cse6 (@diff .cse5 .cse1))) (let ((.cse2 (store .cse5 .cse6 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= .cse1 (store .cse2 .cse3 0)) (or (<= .cse3 80) (= .cse1 .cse2)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (or (<= .cse4 80) (= .cse1 .cse0)) (or (= .cse1 .cse5) (<= .cse6 80)) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_777) .cse10 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse7 .cse8) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse9 .cse10))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse11 .cse10))) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse8) 2147483647) (< (+ (select .cse7 .cse10) 1) v_ArrVal_778))))))) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))))))) is different from false [2022-09-16 10:21:27,053 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse3 .cse2))) (let ((.cse6 (store .cse3 .cse1 0))) (let ((.cse7 (@diff .cse6 .cse2))) (let ((.cse5 (store .cse6 .cse7 0))) (let ((.cse4 (@diff .cse5 .cse2)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (<= .cse1 80) (= .cse2 .cse3)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (<= .cse4 80) (= .cse2 .cse5)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (or (= .cse2 .cse6) (<= .cse7 80)) (= .cse2 (store .cse5 .cse4 0)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse11 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_777) .cse11 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse8 .cse9) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse10 .cse11))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse12 .cse11))) (< (select (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse9) 2147483647) (< (+ (select .cse8 .cse11) 1) v_ArrVal_778))))))) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)))))))) is different from false [2022-09-16 10:21:28,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse1))) (let ((.cse2 (store .cse12 .cse13 0))) (let ((.cse3 (@diff .cse2 .cse1))) (let ((.cse4 (store .cse2 .cse3 0))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (@diff .cse4 .cse1))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (or (= .cse1 .cse2) (<= .cse3 80)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (or (= .cse1 .cse4) (<= .cse5 80)) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_777) .cse9 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse7) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse8 .cse9))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse10 .cse9))) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse7) 2147483647) (< (+ (select .cse6 .cse9) 1) v_ArrVal_778))))))) (or (= .cse1 .cse12) (<= .cse13 80)) (= (select .cse12 (+ |c_ULTIMATE.start_empty_~q#1.offset| 84)) 0) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (or (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= .cse1 (store .cse4 .cse5 0))))))))) is different from false [2022-09-16 10:21:29,243 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse12 (@diff .cse0 .cse1))) (let ((.cse4 (store .cse0 .cse12 0))) (let ((.cse5 (@diff .cse4 .cse1))) (let ((.cse2 (store .cse4 .cse5 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= .cse1 (store .cse2 .cse3 0)) (or (<= .cse3 80) (= .cse1 .cse2)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (or (= .cse1 .cse4) (<= .cse5 80)) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_777) .cse9 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse7) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse8 .cse9))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse10 .cse9))) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse7) 2147483647) (< (+ (select .cse6 .cse9) 1) v_ArrVal_778))))))) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (= (select .cse0 .cse12) 0) (<= .cse12 80)) (<= |c_~#stored_elements~0.base| 6)))))))) is different from false [2022-09-16 10:21:31,251 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse15 (@diff .cse0 .cse7))) (let ((.cse14 (store .cse0 .cse15 0))) (let ((.cse16 (@diff .cse14 .cse7))) (let ((.cse13 (store .cse14 .cse16 0))) (let ((.cse17 (@diff .cse13 .cse7))) (let ((.cse8 (store .cse13 .cse17 0))) (let ((.cse9 (@diff .cse8 .cse7)) (.cse1 (= .cse7 .cse8))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (or .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_777) .cse3 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_777) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse5) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse6 .cse3)))))))) (= 7 |c_~#queue~0.base|) (= .cse7 (store .cse8 .cse9 0)) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (let ((.cse10 (<= .cse17 80)) (.cse12 (<= .cse16 80)) (.cse11 (<= .cse15 80))) (or (and .cse10 .cse11 .cse12 (<= .cse9 80)) (and .cse1 (or .cse10 (= .cse7 .cse13)) (or (= .cse7 .cse14) .cse12) (or (= (select .cse0 .cse15) 0) .cse11)))) (<= |c_~#stored_elements~0.base| 6)))))))))) is different from false [2022-09-16 10:21:33,290 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse14 (@diff .cse0 .cse4))) (let ((.cse6 (store .cse0 .cse14 0))) (let ((.cse7 (@diff .cse6 .cse4))) (let ((.cse5 (store .cse6 .cse7 0))) (let ((.cse3 (@diff .cse5 .cse4))) (let ((.cse8 (store .cse5 .cse3 0))) (let ((.cse1 (@diff .cse8 .cse4)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (or (= (select .cse0 .cse1) 0) (<= .cse1 80)) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 0) (or (<= .cse3 80) (= .cse4 .cse5)) (or (= .cse4 .cse6) (<= .cse7 80)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= .cse4 (store .cse8 .cse1 0)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse12 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_775)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_777) .cse10 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse9 .cse10))) (< (select (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse12 .cse13) 1) v_ArrVal_777) (< (+ (select .cse12 .cse10) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse11 (+ 84 |c_~#queue~0.offset|))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (= .cse4 .cse8) (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (or (= (select .cse0 .cse14) 0) (<= .cse14 80)) (<= |c_~#stored_elements~0.base| 6)))))))))) is different from false [2022-09-16 10:21:35,300 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) .cse2) (= (select .cse3 .cse1) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse4)) .cse2) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_775 Int) (v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_778 Int) (v_ArrVal_777 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_775)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_777) .cse8 v_ArrVal_778)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_780) |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse7 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse5 .cse8) 1) v_ArrVal_778))))))) (<= (select .cse0 (+ 88 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse3 .cse4) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:39,042 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| 7)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 .cse1) 1) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2)) .cse3) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (let ((.cse4 (select .cse5 .cse2))) (or (<= 23 .cse4) (<= .cse4 21))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_781 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse6 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (or (<= 22 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 20)) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) .cse3) (<= (select .cse5 .cse1) 1) (<= (select .cse7 (+ 84 |c_~#queue~0.offset|)) 1) (let ((.cse9 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) (<= (select .cse8 88) 1) .cse9 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) (let ((.cse10 (select .cse8 84))) (or (<= 23 .cse10) (<= .cse10 21))))) (and (let ((.cse11 (select .cse7 84))) (or (<= .cse11 21) (<= 23 .cse11))) (not .cse9) (<= (select .cse7 88) 1)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= (select .cse0 .cse2) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse7 (+ 88 |c_~#queue~0.offset|)) 1))) is different from false [2022-09-16 10:21:39,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse0 (select .cse1 84))) (or (<= .cse0 21) (<= 23 .cse0))) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_781 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (<= (select .cse1 88) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 88 |c_~#queue~0.offset|)) 1))) is different from false [2022-09-16 10:21:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:21:45,213 INFO L93 Difference]: Finished difference Result 34649 states and 88314 transitions. [2022-09-16 10:21:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-16 10:21:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 4.27710843373494) internal successors, (355), 84 states have internal predecessors, (355), 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) Word has length 132 [2022-09-16 10:21:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:21:45,278 INFO L225 Difference]: With dead ends: 34649 [2022-09-16 10:21:45,278 INFO L226 Difference]: Without dead ends: 34649 [2022-09-16 10:21:45,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 260 SyntacticMatches, 18 SemanticMatches, 124 ConstructedPredicates, 24 IntricatePredicates, 6 DeprecatedPredicates, 4326 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=1370, Invalid=8970, Unknown=58, NotChecked=5352, Total=15750 [2022-09-16 10:21:45,280 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 2951 mSDsluCounter, 9914 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2951 SdHoareTripleChecker+Valid, 10042 SdHoareTripleChecker+Invalid, 10776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9153 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:21:45,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2951 Valid, 10042 Invalid, 10776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1506 Invalid, 0 Unknown, 9153 Unchecked, 1.0s Time] [2022-09-16 10:21:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34649 states. [2022-09-16 10:21:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34649 to 15707. [2022-09-16 10:21:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15707 states, 15695 states have (on average 2.6230009557183815) internal successors, (41168), 15706 states have internal predecessors, (41168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:21:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 41168 transitions. [2022-09-16 10:21:45,654 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 41168 transitions. Word has length 132 [2022-09-16 10:21:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:21:45,654 INFO L495 AbstractCegarLoop]: Abstraction has 15707 states and 41168 transitions. [2022-09-16 10:21:45,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 4.27710843373494) internal successors, (355), 84 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:21:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 41168 transitions. [2022-09-16 10:21:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:21:45,667 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:21:45,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:21:45,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 10:21:45,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:21:45,868 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 10:21:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:21:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -820682180, now seen corresponding path program 4 times [2022-09-16 10:21:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:21:45,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227641868] [2022-09-16 10:21:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:21:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:21:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:21:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:21:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:21:47,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227641868] [2022-09-16 10:21:47,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227641868] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:21:47,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798102452] [2022-09-16 10:21:47,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 10:21:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:21:47,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:21:47,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:21:47,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 10:21:47,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 10:21:47,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:21:47,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:21:47,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:21:47,245 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:21:47,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:21:47,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-16 10:21:47,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:21:47,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:21:48,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:21:48,100 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:21:48,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:21:48,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:21:48,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:21:48,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:21:48,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:21:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:21:48,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:21:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:21:48,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:21:48,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-09-16 10:21:49,020 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:21:49,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:21:49,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 10:21:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:21:49,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:22:22,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int)) (let ((.cse0 (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856)) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:22:22,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse1 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:22:22,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse0 (select (let ((.cse1 (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|) v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse1 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_854 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-09-16 10:22:22,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse0 (select (let ((.cse1 (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|) v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse1 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_854)))) is different from false [2022-09-16 10:22:22,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854))))) is different from false [2022-09-16 10:22:22,431 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:22:22,445 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:22:22,487 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_852) .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_852 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 10:22:22,540 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_852) .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_852) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-09-16 10:22:22,560 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_852) .cse3 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_852) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-09-16 10:22:22,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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_850)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_852) .cse5 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_854) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_852))))) is different from false [2022-09-16 10:22:22,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_850)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_852) .cse5 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= .cse1 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_852) (< (+ .cse1 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))))) is different from false [2022-09-16 10:22:22,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_852) .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse6 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse1 .cse2))) (= .cse3 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_852) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_854)))))) is different from false [2022-09-16 10:22:22,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_852) .cse2 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse6 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse2))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse3 .cse2))) (< (+ .cse4 1) v_ArrVal_854) (< (+ (select .cse5 .cse1) 1) v_ArrVal_852) (= .cse4 20)))))) is different from false [2022-09-16 10:22:23,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_848))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_852) .cse4 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse6 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_852) (= 20 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse5 .cse4))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) .cse1) 2147483647) (< (+ .cse2 1) v_ArrVal_854))))))) is different from false [2022-09-16 10:22:23,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_850 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 Int) (v_ArrVal_847 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_847)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_848))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_852) .cse3 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse6 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|)) (.cse5 (select .cse2 .cse3))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_852) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_854) (not (<= v_ArrVal_847 0)) (= .cse5 20))))))) is different from false [2022-09-16 10:22:23,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:22:23,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 421 treesize of output 261 [2022-09-16 10:22:23,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:22:23,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6969 treesize of output 6885 [2022-09-16 10:22:24,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11116 treesize of output 10476 [2022-09-16 10:22:24,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 10978 treesize of output 10898 [2022-09-16 10:22:24,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:22:24,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 Received shutdown request... [2022-09-16 10:30:15,506 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-09-16 10:30:15,509 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2022-09-16 10:30:15,516 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 10:30:15,516 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 10:30:15,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-09-16 10:30:15,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:30:15,710 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-09-16 10:30:15,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2022-09-16 10:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2022-09-16 10:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2022-09-16 10:30:15,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2022-09-16 10:30:15,716 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:30:15,722 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 10:30:15,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 10:30:15,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 10:30:15 BasicIcfg [2022-09-16 10:30:15,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 10:30:15,725 INFO L158 Benchmark]: Toolchain (without parser) took 832744.39ms. Allocated memory was 204.5MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 145.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-09-16 10:30:15,725 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 10:30:15,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.59ms. Allocated memory was 204.5MB in the beginning and 247.5MB in the end (delta: 43.0MB). Free memory was 145.0MB in the beginning and 201.1MB in the end (delta: -56.1MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-09-16 10:30:15,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.84ms. Allocated memory is still 247.5MB. Free memory was 201.1MB in the beginning and 198.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 10:30:15,726 INFO L158 Benchmark]: Boogie Preprocessor took 39.72ms. Allocated memory is still 247.5MB. Free memory was 198.1MB in the beginning and 196.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 10:30:15,726 INFO L158 Benchmark]: RCFGBuilder took 550.58ms. Allocated memory is still 247.5MB. Free memory was 196.0MB in the beginning and 175.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-09-16 10:30:15,728 INFO L158 Benchmark]: TraceAbstraction took 831574.71ms. Allocated memory was 247.5MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 174.4MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-09-16 10:30:15,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.59ms. Allocated memory was 204.5MB in the beginning and 247.5MB in the end (delta: 43.0MB). Free memory was 145.0MB in the beginning and 201.1MB in the end (delta: -56.1MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.84ms. Allocated memory is still 247.5MB. Free memory was 201.1MB in the beginning and 198.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.72ms. Allocated memory is still 247.5MB. Free memory was 198.1MB in the beginning and 196.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 550.58ms. Allocated memory is still 247.5MB. Free memory was 196.0MB in the beginning and 175.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 831574.71ms. Allocated memory was 247.5MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 174.4MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 133 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 831.4s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 113.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26246 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26246 mSDsluCounter, 80823 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36953 IncrementalHoareTripleChecker+Unchecked, 75248 mSDsCounter, 1199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15256 IncrementalHoareTripleChecker+Invalid, 53408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1199 mSolverCounterUnsat, 6145 mSDtfsCounter, 15256 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2825 GetRequests, 1649 SyntacticMatches, 148 SemanticMatches, 1028 ConstructedPredicates, 131 IntricatePredicates, 9 DeprecatedPredicates, 26188 ImplicationChecksByTransitivity, 214.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75649occurred in iteration=8, InterpolantAutomatonStates: 475, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 94985 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 194.5s InterpolantComputationTime, 3043 NumberOfCodeBlocks, 3043 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3917 ConstructedInterpolants, 595 QuantifiedInterpolants, 167921 SizeOfPredicates, 209 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 466 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 48/387 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