/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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:16:24,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:16:24,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:16:24,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:16:24,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:16:24,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:16:24,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:16:24,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:16:24,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:16:24,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:16:24,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:16:24,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:16:24,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:16:24,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:16:24,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:16:24,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:16:24,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:16:24,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:16:24,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:16:24,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:16:24,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:16:24,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:16:24,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:16:24,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:16:24,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:16:24,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:16:24,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:16:24,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:16:24,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:16:24,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:16:24,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:16:24,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:16:24,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:16:24,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:16:24,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:16:24,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:16:24,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:16:24,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:16:24,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:16:24,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:16:24,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:16:24,334 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:24,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:16:24,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:16:24,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:16:24,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:16:24,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:16:24,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:16:24,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:16:24,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:16:24,370 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:16:24,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:16:24,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:16:24,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:16:24,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:16:24,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:16:24,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:16:24,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:16:24,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:16:24,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:16:24,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:24,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:16:24,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:16:24,376 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:24,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:16:24,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:16:24,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:16:24,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:16:24,618 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:16:24,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-09-16 10:16:24,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0002105/364df9b46a5a4979a8d721ab1c700933/FLAGa9b49d49e [2022-09-16 10:16:25,138 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:16:25,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-09-16 10:16:25,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0002105/364df9b46a5a4979a8d721ab1c700933/FLAGa9b49d49e [2022-09-16 10:16:25,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0002105/364df9b46a5a4979a8d721ab1c700933 [2022-09-16 10:16:25,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:16:25,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:16:25,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:25,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:16:25,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:16:25,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:25" (1/1) ... [2022-09-16 10:16:25,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592258b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:25, skipping insertion in model container [2022-09-16 10:16:25,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:25" (1/1) ... [2022-09-16 10:16:25,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:16:25,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:16:26,131 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_longest.i[43280,43293] [2022-09-16 10:16:26,136 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_longest.i[43553,43566] [2022-09-16 10:16:26,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:26,150 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:16:26,179 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_longest.i[43280,43293] [2022-09-16 10:16:26,181 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_longest.i[43553,43566] [2022-09-16 10:16:26,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:26,224 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:16:26,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:26 WrapperNode [2022-09-16 10:16:26,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:26,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:26,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:16:26,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:16:26,230 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:26" (1/1) ... [2022-09-16 10:16:26,254 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:26" (1/1) ... [2022-09-16 10:16:26,283 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-09-16 10:16:26,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:26,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:16:26,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:16:26,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:16:26,290 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:26" (1/1) ... [2022-09-16 10:16:26,290 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:26" (1/1) ... [2022-09-16 10:16:26,303 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:26" (1/1) ... [2022-09-16 10:16:26,303 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:26" (1/1) ... [2022-09-16 10:16:26,308 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:26" (1/1) ... [2022-09-16 10:16:26,311 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:26" (1/1) ... [2022-09-16 10:16:26,312 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:26" (1/1) ... [2022-09-16 10:16:26,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:16:26,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:16:26,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:16:26,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:16:26,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:26" (1/1) ... [2022-09-16 10:16:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:26,369 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:26,391 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:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 10:16:26,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 10:16:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 10:16:26,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 10:16:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:16:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:16:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:16:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:16:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 10:16:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:16:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:16:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:16:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:16:26,406 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:26,598 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:16:26,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:16:26,859 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:16:26,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:16:26,869 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 10:16:26,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:26 BoogieIcfgContainer [2022-09-16 10:16:26,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:16:26,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:16:26,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:16:26,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:16:26,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:16:25" (1/3) ... [2022-09-16 10:16:26,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554bc76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:26, skipping insertion in model container [2022-09-16 10:16:26,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:26" (2/3) ... [2022-09-16 10:16:26,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554bc76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:26, skipping insertion in model container [2022-09-16 10:16:26,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:26" (3/3) ... [2022-09-16 10:16:26,885 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-09-16 10:16:26,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:16:26,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:16:26,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-09-16 10:16:26,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:16:27,070 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 10:16:27,108 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 10:16:27,951 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:27,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:16:27,993 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;@20877988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:16:27,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-09-16 10:16:28,049 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:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-09-16 10:16:28,082 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:28,084 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:28,084 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:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash -731197578, now seen corresponding path program 1 times [2022-09-16 10:16:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:28,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704092951] [2022-09-16 10:16:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:28,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:28,652 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:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704092951] [2022-09-16 10:16:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704092951] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 10:16:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801142229] [2022-09-16 10:16:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:16:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:16:28,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:16:28,749 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:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:29,446 INFO L93 Difference]: Finished difference Result 21859 states and 61196 transitions. [2022-09-16 10:16:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:16:29,465 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:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:29,718 INFO L225 Difference]: With dead ends: 21859 [2022-09-16 10:16:29,718 INFO L226 Difference]: Without dead ends: 21778 [2022-09-16 10:16:29,720 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:29,723 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:29,724 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:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21778 states. [2022-09-16 10:16:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21778 to 21778. [2022-09-16 10:16:30,374 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:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21778 states to 21778 states and 60968 transitions. [2022-09-16 10:16:30,592 INFO L78 Accepts]: Start accepts. Automaton has 21778 states and 60968 transitions. Word has length 85 [2022-09-16 10:16:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:30,593 INFO L495 AbstractCegarLoop]: Abstraction has 21778 states and 60968 transitions. [2022-09-16 10:16:30,593 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:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21778 states and 60968 transitions. [2022-09-16 10:16:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 10:16:30,598 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:30,598 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:30,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:16:30,599 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:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 992572438, now seen corresponding path program 1 times [2022-09-16 10:16:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877296807] [2022-09-16 10:16:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:39,373 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:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:39,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877296807] [2022-09-16 10:16:39,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877296807] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:39,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:39,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298737899] [2022-09-16 10:16:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:39,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:39,377 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:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:47,543 INFO L93 Difference]: Finished difference Result 23978 states and 67012 transitions. [2022-09-16 10:16:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:47,544 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:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:47,614 INFO L225 Difference]: With dead ends: 23978 [2022-09-16 10:16:47,614 INFO L226 Difference]: Without dead ends: 23978 [2022-09-16 10:16:47,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:16:47,616 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 746 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:47,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3788 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-09-16 10:16:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23978 states. [2022-09-16 10:16:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23978 to 22898. [2022-09-16 10:16:48,233 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:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22898 states to 22898 states and 64035 transitions. [2022-09-16 10:16:48,323 INFO L78 Accepts]: Start accepts. Automaton has 22898 states and 64035 transitions. Word has length 86 [2022-09-16 10:16:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:48,329 INFO L495 AbstractCegarLoop]: Abstraction has 22898 states and 64035 transitions. [2022-09-16 10:16:48,329 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:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22898 states and 64035 transitions. [2022-09-16 10:16:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 10:16:48,335 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:48,335 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:48,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 10:16:48,335 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:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1810513622, now seen corresponding path program 1 times [2022-09-16 10:16:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019555806] [2022-09-16 10:16:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:49,171 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:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:49,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019555806] [2022-09-16 10:16:49,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019555806] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:49,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:49,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:16:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118427450] [2022-09-16 10:16:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:16:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:16:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:16:49,174 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:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:51,153 INFO L93 Difference]: Finished difference Result 36064 states and 101030 transitions. [2022-09-16 10:16:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:16:51,153 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:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:51,298 INFO L225 Difference]: With dead ends: 36064 [2022-09-16 10:16:51,298 INFO L226 Difference]: Without dead ends: 36064 [2022-09-16 10:16:51,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 10:16:51,303 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.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:51,305 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.8s Time] [2022-09-16 10:16:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36064 states. [2022-09-16 10:16:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36064 to 27700. [2022-09-16 10:16:52,033 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:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27700 states to 27700 states and 77855 transitions. [2022-09-16 10:16:52,160 INFO L78 Accepts]: Start accepts. Automaton has 27700 states and 77855 transitions. Word has length 91 [2022-09-16 10:16:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:52,161 INFO L495 AbstractCegarLoop]: Abstraction has 27700 states and 77855 transitions. [2022-09-16 10:16:52,161 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:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27700 states and 77855 transitions. [2022-09-16 10:16:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-09-16 10:16:52,168 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:52,168 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:52,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 10:16:52,168 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:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1381084976, now seen corresponding path program 1 times [2022-09-16 10:16:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:52,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266162986] [2022-09-16 10:16:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:52,199 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:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266162986] [2022-09-16 10:16:52,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266162986] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:52,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:52,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 10:16:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369459099] [2022-09-16 10:16:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:52,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:52,201 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:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:52,429 INFO L93 Difference]: Finished difference Result 47010 states and 131774 transitions. [2022-09-16 10:16:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:16:52,430 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:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:52,773 INFO L225 Difference]: With dead ends: 47010 [2022-09-16 10:16:52,773 INFO L226 Difference]: Without dead ends: 47010 [2022-09-16 10:16:52,776 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:52,784 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:52,785 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:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47010 states. [2022-09-16 10:16:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47010 to 29088. [2022-09-16 10:16:53,707 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:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 81727 transitions. [2022-09-16 10:16:53,902 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 81727 transitions. Word has length 94 [2022-09-16 10:16:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:53,905 INFO L495 AbstractCegarLoop]: Abstraction has 29088 states and 81727 transitions. [2022-09-16 10:16:53,905 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:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 81727 transitions. [2022-09-16 10:16:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 10:16:53,923 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:53,924 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:53,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 10:16:53,924 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:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1147024205, now seen corresponding path program 1 times [2022-09-16 10:16:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713404779] [2022-09-16 10:16:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:53,961 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:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:53,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713404779] [2022-09-16 10:16:53,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713404779] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:53,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085871886] [2022-09-16 10:16:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:53,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:53,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:53,962 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:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:54,188 INFO L93 Difference]: Finished difference Result 51879 states and 145951 transitions. [2022-09-16 10:16:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:54,188 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:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:54,427 INFO L225 Difference]: With dead ends: 51879 [2022-09-16 10:16:54,427 INFO L226 Difference]: Without dead ends: 51879 [2022-09-16 10:16:54,427 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:54,428 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:54,428 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:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51879 states. [2022-09-16 10:16:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51879 to 49313. [2022-09-16 10:16:55,394 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:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49313 states to 49313 states and 140224 transitions. [2022-09-16 10:16:55,672 INFO L78 Accepts]: Start accepts. Automaton has 49313 states and 140224 transitions. Word has length 95 [2022-09-16 10:16:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:55,672 INFO L495 AbstractCegarLoop]: Abstraction has 49313 states and 140224 transitions. [2022-09-16 10:16:55,673 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:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 49313 states and 140224 transitions. [2022-09-16 10:16:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:16:55,679 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:55,679 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:55,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 10:16:55,680 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:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 96222015, now seen corresponding path program 1 times [2022-09-16 10:16:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:55,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353595061] [2022-09-16 10:16:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:57,353 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,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:57,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353595061] [2022-09-16 10:16:57,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353595061] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:57,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:57,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755615455] [2022-09-16 10:16:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:57,355 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:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:59,569 INFO L93 Difference]: Finished difference Result 53192 states and 151096 transitions. [2022-09-16 10:16:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:59,570 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:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:59,790 INFO L225 Difference]: With dead ends: 53192 [2022-09-16 10:16:59,791 INFO L226 Difference]: Without dead ends: 53192 [2022-09-16 10:16:59,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2022-09-16 10:16:59,792 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 772 mSDsluCounter, 3320 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:59,792 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.9s Time] [2022-09-16 10:17:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53192 states. [2022-09-16 10:17:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53192 to 51250. [2022-09-16 10:17:01,176 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:17:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51250 states to 51250 states and 145660 transitions. [2022-09-16 10:17:01,610 INFO L78 Accepts]: Start accepts. Automaton has 51250 states and 145660 transitions. Word has length 96 [2022-09-16 10:17:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:01,611 INFO L495 AbstractCegarLoop]: Abstraction has 51250 states and 145660 transitions. [2022-09-16 10:17:01,611 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:17:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 51250 states and 145660 transitions. [2022-09-16 10:17:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-09-16 10:17:01,623 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:01,623 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:17:01,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 10:17:01,623 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:17:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1823850669, now seen corresponding path program 1 times [2022-09-16 10:17:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:01,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040961153] [2022-09-16 10:17:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:02,092 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:17:02,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:02,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040961153] [2022-09-16 10:17:02,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040961153] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:02,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:02,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:17:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966454433] [2022-09-16 10:17:02,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:17:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:17:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:17:02,094 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:17:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:03,703 INFO L93 Difference]: Finished difference Result 64136 states and 181611 transitions. [2022-09-16 10:17:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:17:03,704 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:17:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:03,938 INFO L225 Difference]: With dead ends: 64136 [2022-09-16 10:17:03,938 INFO L226 Difference]: Without dead ends: 64136 [2022-09-16 10:17:03,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 10:17:03,940 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:17:03,940 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:17:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64136 states. [2022-09-16 10:17:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64136 to 55001. [2022-09-16 10:17:05,405 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:17:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55001 states to 55001 states and 156623 transitions. [2022-09-16 10:17:05,600 INFO L78 Accepts]: Start accepts. Automaton has 55001 states and 156623 transitions. Word has length 101 [2022-09-16 10:17:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:05,601 INFO L495 AbstractCegarLoop]: Abstraction has 55001 states and 156623 transitions. [2022-09-16 10:17:05,601 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:17:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 55001 states and 156623 transitions. [2022-09-16 10:17:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-09-16 10:17:05,612 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:05,612 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:17:05,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 10:17:05,613 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:17:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1482775012, now seen corresponding path program 1 times [2022-09-16 10:17:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864020349] [2022-09-16 10:17:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:05,659 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:17:05,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:05,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864020349] [2022-09-16 10:17:05,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864020349] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:05,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:05,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:17:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284500055] [2022-09-16 10:17:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:05,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:17:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:17:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:17:05,661 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:17:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:06,454 INFO L93 Difference]: Finished difference Result 78661 states and 223274 transitions. [2022-09-16 10:17:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:17:06,455 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:17:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:06,752 INFO L225 Difference]: With dead ends: 78661 [2022-09-16 10:17:06,752 INFO L226 Difference]: Without dead ends: 78661 [2022-09-16 10:17:06,752 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:17:06,753 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:17:06,753 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:17:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78661 states. [2022-09-16 10:17:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78661 to 75649. [2022-09-16 10:17:08,265 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:17:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75649 states to 75649 states and 216536 transitions. [2022-09-16 10:17:08,716 INFO L78 Accepts]: Start accepts. Automaton has 75649 states and 216536 transitions. Word has length 102 [2022-09-16 10:17:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:08,716 INFO L495 AbstractCegarLoop]: Abstraction has 75649 states and 216536 transitions. [2022-09-16 10:17:08,716 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:17:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 75649 states and 216536 transitions. [2022-09-16 10:17:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-09-16 10:17:08,728 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:08,728 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:17:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 10:17:08,728 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:17:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 742742521, now seen corresponding path program 1 times [2022-09-16 10:17:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678714393] [2022-09-16 10:17:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:08,807 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:17:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:08,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678714393] [2022-09-16 10:17:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678714393] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:08,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:08,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:17:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910845972] [2022-09-16 10:17:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:08,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:17:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:17:08,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:17:08,809 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:17:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:08,875 INFO L93 Difference]: Finished difference Result 7144 states and 17997 transitions. [2022-09-16 10:17:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:17:08,876 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:17:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:08,887 INFO L225 Difference]: With dead ends: 7144 [2022-09-16 10:17:08,888 INFO L226 Difference]: Without dead ends: 7025 [2022-09-16 10:17:08,888 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:17:08,889 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:17:08,889 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:17:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2022-09-16 10:17:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2022-09-16 10:17:08,991 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:17:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 17718 transitions. [2022-09-16 10:17:09,006 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 17718 transitions. Word has length 106 [2022-09-16 10:17:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:09,007 INFO L495 AbstractCegarLoop]: Abstraction has 7025 states and 17718 transitions. [2022-09-16 10:17:09,007 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:17:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 17718 transitions. [2022-09-16 10:17:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-09-16 10:17:09,012 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:09,012 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:17:09,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:17:09,012 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:17:09,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash 603226518, now seen corresponding path program 1 times [2022-09-16 10:17:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:09,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580342666] [2022-09-16 10:17:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:09,326 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:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:09,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580342666] [2022-09-16 10:17:09,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580342666] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:17:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569445973] [2022-09-16 10:17:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:09,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 10:17:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 10:17:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-09-16 10:17:09,328 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:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:10,173 INFO L93 Difference]: Finished difference Result 7089 states and 17887 transitions. [2022-09-16 10:17:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 10:17:10,174 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:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:10,182 INFO L225 Difference]: With dead ends: 7089 [2022-09-16 10:17:10,182 INFO L226 Difference]: Without dead ends: 7089 [2022-09-16 10:17:10,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:17:10,183 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 631 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:10,183 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.5s Time] [2022-09-16 10:17:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-09-16 10:17:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 7052. [2022-09-16 10:17:10,253 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:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7052 states to 7052 states and 17790 transitions. [2022-09-16 10:17:10,263 INFO L78 Accepts]: Start accepts. Automaton has 7052 states and 17790 transitions. Word has length 121 [2022-09-16 10:17:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:10,264 INFO L495 AbstractCegarLoop]: Abstraction has 7052 states and 17790 transitions. [2022-09-16 10:17:10,264 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:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 7052 states and 17790 transitions. [2022-09-16 10:17:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-09-16 10:17:10,268 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:10,268 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:10,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 10:17:10,268 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:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash -596804606, now seen corresponding path program 1 times [2022-09-16 10:17:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:10,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278116654] [2022-09-16 10:17:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:22,057 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:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278116654] [2022-09-16 10:17:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278116654] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:22,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:22,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:17:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455649531] [2022-09-16 10:17:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:22,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:17:22,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:17:22,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:17:22,060 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:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:27,645 INFO L93 Difference]: Finished difference Result 7755 states and 19633 transitions. [2022-09-16 10:17:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 10:17:27,645 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:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:27,658 INFO L225 Difference]: With dead ends: 7755 [2022-09-16 10:17:27,659 INFO L226 Difference]: Without dead ends: 7755 [2022-09-16 10:17:27,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:27,660 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 480 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:27,660 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.5s Time] [2022-09-16 10:17:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2022-09-16 10:17:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7496. [2022-09-16 10:17:27,772 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:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 18954 transitions. [2022-09-16 10:17:27,783 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 18954 transitions. Word has length 126 [2022-09-16 10:17:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:27,785 INFO L495 AbstractCegarLoop]: Abstraction has 7496 states and 18954 transitions. [2022-09-16 10:17:27,785 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:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 18954 transitions. [2022-09-16 10:17:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-09-16 10:17:27,816 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:27,816 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:27,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 10:17:27,817 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:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2106228004, now seen corresponding path program 2 times [2022-09-16 10:17:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23629864] [2022-09-16 10:17:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:28,402 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:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23629864] [2022-09-16 10:17:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23629864] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:28,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:17:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489938266] [2022-09-16 10:17:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:28,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:17:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:17:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:17:28,405 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:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:29,410 INFO L93 Difference]: Finished difference Result 7422 states and 18723 transitions. [2022-09-16 10:17:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:17:29,411 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:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:29,424 INFO L225 Difference]: With dead ends: 7422 [2022-09-16 10:17:29,424 INFO L226 Difference]: Without dead ends: 7422 [2022-09-16 10:17:29,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:29,426 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:29,426 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:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2022-09-16 10:17:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 6941. [2022-09-16 10:17:29,554 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:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 17462 transitions. [2022-09-16 10:17:29,569 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 17462 transitions. Word has length 126 [2022-09-16 10:17:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:29,570 INFO L495 AbstractCegarLoop]: Abstraction has 6941 states and 17462 transitions. [2022-09-16 10:17:29,570 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:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 17462 transitions. [2022-09-16 10:17:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-09-16 10:17:29,575 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:29,575 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:29,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-16 10:17:29,575 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:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1414442702, now seen corresponding path program 1 times [2022-09-16 10:17:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:29,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268325712] [2022-09-16 10:17:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:30,367 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:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:30,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268325712] [2022-09-16 10:17:30,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268325712] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:30,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453023868] [2022-09-16 10:17:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:30,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:30,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:30,369 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:30,370 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:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:30,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:17:30,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:30,723 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:17:30,723 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:30,870 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:30,917 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:31,167 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:31,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:31,480 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:17:31,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:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:31,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:31,613 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:31,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:31,877 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:31,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:31,960 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,202 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:17:32,202 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:32,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:32,213 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:32,217 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,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:17:32,570 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 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:32,601 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|) (+ 3204 |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 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:32,617 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|) (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:32,627 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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:32,642 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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 10:17:32,653 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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:32,686 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |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 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:32,728 WARN L833 $PredicateComparison]: unable to prove that (or (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (forall ((v_ArrVal_346 Int) (v_ArrVal_352 Int) (v_ArrVal_350 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_346) (< (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |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 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:17:32,744 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 (+ 3208 |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 (+ 3204 |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 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:32,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))) (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_344)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_346) (= .cse2 800) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_346) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:17:32,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (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)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_346) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_346) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 10:17:32,866 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 ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_344)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse5 .cse4))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_346)))))) is different from false [2022-09-16 10:17:32,930 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 ((.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 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse1 .cse4)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse0 800) (< (+ (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 (+ .cse0 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)))))) is different from false [2022-09-16 10:17:33,165 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 ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse3 .cse2)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_346) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_346) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_352)) .cse4) 2147483647))))))) is different from false [2022-09-16 10:17:33,564 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 ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_341)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (not (<= v_ArrVal_341 0)) (= .cse2 800) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_352)) .cse6) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346))))))) is different from false [2022-09-16 10:17:33,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,584 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:33,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,604 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:33,624 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 181 treesize of output 161 [2022-09-16 10:17:33,635 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 204 treesize of output 180 [2022-09-16 10:17:33,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,678 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:33,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:33,864 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 209 treesize of output 217 [2022-09-16 10:17:35,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:35,264 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,321 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,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453023868] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:17:35,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:17:35,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:17:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287560268] [2022-09-16 10:17:35,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:17:35,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:17:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:17:35,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=3754, Unknown=15, NotChecked=2100, Total=6320 [2022-09-16 10:17:35,324 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:36,374 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204))) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= .cse0 0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (<= .cse0 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |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|)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= (select .cse1 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse1 3204) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (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 ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse4)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse2 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_352)) .cse6) 2147483647))))))) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 10:17:36,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse0 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6) (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 ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select .cse4 .cse3)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse1 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_346) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_346) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_352)) .cse5) 2147483647))))))))) is different from false [2022-09-16 10:17:37,499 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (and (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|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse0 3204) 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|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= (select .cse0 3208) 0) (<= |c_~#stored_elements~0.base| 6) (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 ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse4)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse2 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_346) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_346) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_352)) .cse6) 2147483647))))))))) is different from false [2022-09-16 10:17:38,057 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse1 .cse0) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse1 3208) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (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 ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse6 .cse5)) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse3 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse4 .cse5))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_346) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_346) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) v_ArrVal_352)) .cse7) 2147483647))))))) (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| 3208))))) is different from false [2022-09-16 10:17:38,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|)) (= 7 |c_~#queue~0.base|) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= (select .cse1 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= 0 (select .cse1 3204)))) (and (not .cse0) (= (select .cse2 3208) 0) (= (select .cse2 3204) 0)))) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6) (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 ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_343))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_344)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse6 .cse5)) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse3 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse4 .cse5))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_346) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_346) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) v_ArrVal_352)) .cse7) 2147483647))))))))) is different from false [2022-09-16 10:17:39,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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_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 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse1 .cse4)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (or (= .cse0 800) (< (+ (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 (+ .cse0 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)))))) (= (select .cse6 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse6 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:39,920 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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 ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_344)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse5 .cse4))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_346)))))) (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 .cse6 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse6 3208) 0) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 3208 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:41,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (= |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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (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)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_346) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_346) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_352)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (= 0 (select .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:45,054 INFO L93 Difference]: Finished difference Result 16640 states and 41988 transitions. [2022-09-16 10:17:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-09-16 10:17:45,059 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:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:45,098 INFO L225 Difference]: With dead ends: 16640 [2022-09-16 10:17:45,099 INFO L226 Difference]: Without dead ends: 16640 [2022-09-16 10:17:45,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 206 SyntacticMatches, 18 SemanticMatches, 123 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4108 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1222, Invalid=9149, Unknown=23, NotChecked=5106, Total=15500 [2022-09-16 10:17:45,105 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1404 mSDsluCounter, 10596 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 10860 SdHoareTripleChecker+Invalid, 8030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6022 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:45,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 10860 Invalid, 8030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1879 Invalid, 0 Unknown, 6022 Unchecked, 1.0s Time] [2022-09-16 10:17:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16640 states. [2022-09-16 10:17:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16640 to 7217. [2022-09-16 10:17:45,306 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:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 18065 transitions. [2022-09-16 10:17:45,323 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 18065 transitions. Word has length 127 [2022-09-16 10:17:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:45,323 INFO L495 AbstractCegarLoop]: Abstraction has 7217 states and 18065 transitions. [2022-09-16 10:17:45,323 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:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 18065 transitions. [2022-09-16 10:17:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:17:45,329 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:45,359 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:45,387 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:45,559 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:45,560 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:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash 751752859, now seen corresponding path program 1 times [2022-09-16 10:17:45,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:45,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477793771] [2022-09-16 10:17:45,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:46,341 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:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:46,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477793771] [2022-09-16 10:17:46,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477793771] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614676224] [2022-09-16 10:17:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:46,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:46,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:46,343 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:46,384 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:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:46,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:17:46,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:17:46,535 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:17:46,536 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,644 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,687 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,913 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,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:47,184 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:17:47,185 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:47,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:47,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:17:47,301 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:47,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:47,542 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,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:17:47,616 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,847 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:17:47,847 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,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:47,856 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,858 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,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:17:48,079 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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:48,097 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|) (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:48,107 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|) (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:48,113 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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:17:48,122 WARN L833 $PredicateComparison]: unable to prove that (or (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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 10:17:48,129 WARN L833 $PredicateComparison]: unable to prove that (or (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 (+ 3204 |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 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:48,269 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_416) (< (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:48,280 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_422 Int) (v_ArrVal_416 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_416) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_416) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:17:48,302 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (= .cse0 800) (< (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 (+ |c_~#queue~0.offset| (* (select .cse1 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416))))) is different from false [2022-09-16 10:17:48,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int)) (or (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)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (= .cse0 800) (< (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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:17:48,350 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 ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_414)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (= .cse0 800) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~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 (+ |c_~#queue~0.offset| (* 4 (select .cse1 (+ |c_~#queue~0.offset| 3204)))) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse4))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416)))))) is different from false [2022-09-16 10:17:48,390 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 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_422)) .cse3) 2147483647) (= .cse4 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse1)))))))) is different from false [2022-09-16 10:17:48,552 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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_416) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_416) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_422)) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse6 .cse3))) (= .cse5 800))))))) is different from false [2022-09-16 10:17:48,819 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 ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_412)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_416) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_416) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_422)) .cse1) 2147483647) (= 800 .cse5) (not (<= v_ArrVal_412 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse6 .cse3))))))))) is different from false [2022-09-16 10:17:48,837 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,837 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:48,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:48,846 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:48,854 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 181 treesize of output 161 [2022-09-16 10:17:48,860 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 204 treesize of output 180 [2022-09-16 10:17:48,887 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:49,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:49,190 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 518 treesize of output 478 [2022-09-16 10:17:50,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:17:50,289 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:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-09-16 10:17:50,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614676224] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:17:50,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:17:50,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:17:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120654907] [2022-09-16 10:17:50,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:17:50,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:17:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:17:50,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=3872, Unknown=25, NotChecked=1974, Total=6320 [2022-09-16 10:17:50,361 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:51,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204))) (.cse1 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= .cse0 0) (or .cse1 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (<= .cse0 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse2 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse4 (= (select .cse3 3204) 0))) (or (and (not .cse2) (= (select .cse3 3208) 0) .cse4) (and .cse2 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0) .cse4))) (= |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|)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) .cse1 (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse3 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse3 (+ 3208 |c_~#queue~0.offset|)) 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 ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse5 .cse8))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_416) (< (select (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_416) .cse8 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_ArrVal_422)) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse11 .cse8))) (= .cse10 800))))))) (= |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:52,397 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 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse2 (= (select .cse1 3204) 0))) (or (and (not .cse0) (= (select .cse1 3208) 0) .cse2) (and .cse0 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0) .cse2))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 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 ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_416) (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_416) .cse6 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_422)) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse9 .cse6))) (= .cse8 800))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:52,940 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 ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse2 (= (select .cse3 3204) 0))) (or (and (not .cse0) (= (select .cse1 3208) 0) .cse2 (= .cse1 .cse3)) (and .cse0 (= |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|) .cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |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 .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (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 ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (select .cse4 .cse7))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_416) (< (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_416) .cse7 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_422)) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse10 .cse7))) (= .cse9 800))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:53,448 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse4 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (let ((.cse1 (= (select .cse3 .cse4) 0)) (.cse2 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and .cse1 (not .cse2) (= .cse3 .cse0) (= (select .cse0 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse4)) .cse1 .cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 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 ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse5 .cse8))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_416) (< (select (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_416) .cse8 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_ArrVal_422)) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse11 .cse8))) (= .cse10 800))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:53,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|)) (= 7 |c_~#queue~0.base|) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= (select .cse1 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= 0 (select .cse1 3204)))) (and (not .cse0) (= (select .cse2 3208) 0) (= (select .cse2 3204) 0)))) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 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 ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_413))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_414)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_416) (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_416) .cse6 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_420) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_422)) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse9 .cse6))) (= .cse8 800))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:54,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~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 ((.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 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_422)) .cse3) 2147483647) (= .cse4 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse1)))))))) (= |c_~#queue~0.offset| 0) (= (select .cse6 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse6 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:55,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 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 ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_414)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (= .cse0 800) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~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 (+ |c_~#queue~0.offset| (* 4 (select .cse1 (+ |c_~#queue~0.offset| 3204)))) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse5 .cse4))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416)))))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse6 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse6 3208) 0) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 3208 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:57,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (= |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_22| Int)) (or (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)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (= .cse0 800) (< (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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_422)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_416))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 0 (select .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:17:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:58,722 INFO L93 Difference]: Finished difference Result 7702 states and 19243 transitions. [2022-09-16 10:17:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 10:17:58,727 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:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:58,739 INFO L225 Difference]: With dead ends: 7702 [2022-09-16 10:17:58,740 INFO L226 Difference]: Without dead ends: 7702 [2022-09-16 10:17:58,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 208 SyntacticMatches, 17 SemanticMatches, 113 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 3528 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1006, Invalid=7605, Unknown=33, NotChecked=4466, Total=13110 [2022-09-16 10:17:58,744 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 482 mSDsluCounter, 6222 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 6347 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2361 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:58,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 6347 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 933 Invalid, 0 Unknown, 2361 Unchecked, 0.4s Time] [2022-09-16 10:17:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7702 states. [2022-09-16 10:17:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7702 to 7268. [2022-09-16 10:17:58,867 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:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 18168 transitions. [2022-09-16 10:17:58,880 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 18168 transitions. Word has length 128 [2022-09-16 10:17:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:58,891 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 18168 transitions. [2022-09-16 10:17:58,891 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:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 18168 transitions. [2022-09-16 10:17:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:17:58,895 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:58,895 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:58,914 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:59,096 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:59,097 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:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1830910923, now seen corresponding path program 2 times [2022-09-16 10:17:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:59,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966463217] [2022-09-16 10:17:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:59,952 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:59,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966463217] [2022-09-16 10:17:59,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966463217] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:17:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939991070] [2022-09-16 10:17:59,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:17:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:17:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:17:59,953 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:59,955 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:18:00,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:18:00,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:18:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 74 conjunts are in the unsatisfiable core [2022-09-16 10:18:00,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:00,199 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:18:00,200 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:00,280 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:00,308 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:00,466 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:00,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:00,659 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:18:00,660 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:18:00,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:00,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:00,767 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:00,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:00,963 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:18:01,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:01,018 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:01,196 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:18:01,197 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:18:01,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:01,214 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:01,216 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:01,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:01,460 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 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:18:01,491 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|) (+ 3204 |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 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:18:01,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|) (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:18:01,508 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 (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 10:18:01,525 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 (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 10:18:03,805 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_486 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_486) (< (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |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 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:18:03,820 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_486 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 .cse2 v_ArrVal_486) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_486)))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:18:03,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_491 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_485)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 3208 |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_486) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse4 800) (< (+ (select .cse1 .cse2) 1) v_ArrVal_486))))) is different from false [2022-09-16 10:18:03,886 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_485)))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_486) (= .cse2 800) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_486) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:18:03,914 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 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse5 .cse4))) v_ArrVal_485)))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_486) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~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 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_491)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:18:03,981 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 ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_485)))) (let ((.cse3 (+ 3208 |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_486) .cse1 (+ .cse4 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)) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_486) (= .cse4 800)))))) is different from false [2022-09-16 10:18:04,126 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 ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_485)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_486) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_486) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_491)) .cse1) 2147483647) (= 800 .cse5)))))) is different from false [2022-09-16 10:18:04,420 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 ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_481)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_485)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_486) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_486) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_490) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_491)) .cse1) 2147483647) (not (<= v_ArrVal_481 0))))))) is different from false [2022-09-16 10:18:04,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:04,435 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:18:04,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:04,445 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:18:04,453 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:18:04,459 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:18:04,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:04,476 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:04,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:04,756 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 521 treesize of output 389 [2022-09-16 10:18:05,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:05,184 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:18:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-09-16 10:18:05,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939991070] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:05,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:05,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 10:18:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006619816] [2022-09-16 10:18:05,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:05,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 10:18:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:05,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 10:18:05,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3967, Unknown=34, NotChecked=1846, Total=6320 [2022-09-16 10:18:05,260 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:18:15,434 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 86 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:18:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:18:17,360 INFO L93 Difference]: Finished difference Result 13263 states and 33244 transitions. [2022-09-16 10:18:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-09-16 10:18:17,360 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:18:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:18:17,387 INFO L225 Difference]: With dead ends: 13263 [2022-09-16 10:18:17,388 INFO L226 Difference]: Without dead ends: 13263 [2022-09-16 10:18:17,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 208 SyntacticMatches, 24 SemanticMatches, 128 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4521 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=2361, Invalid=11229, Unknown=34, NotChecked=3146, Total=16770 [2022-09-16 10:18:17,394 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 2821 mSDsluCounter, 7347 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2821 SdHoareTripleChecker+Valid, 7552 SdHoareTripleChecker+Invalid, 8040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6383 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:18:17,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2821 Valid, 7552 Invalid, 8040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1470 Invalid, 0 Unknown, 6383 Unchecked, 0.7s Time] [2022-09-16 10:18:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13263 states. [2022-09-16 10:18:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13263 to 7310. [2022-09-16 10:18:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7310 states, 7298 states have (on average 2.50561797752809) internal successors, (18286), 7309 states have internal predecessors, (18286), 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:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 18286 transitions. [2022-09-16 10:18:17,568 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 18286 transitions. Word has length 128 [2022-09-16 10:18:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:18:17,570 INFO L495 AbstractCegarLoop]: Abstraction has 7310 states and 18286 transitions. [2022-09-16 10:18:17,570 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:18:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 18286 transitions. [2022-09-16 10:18:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:18:17,575 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:18:17,576 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:18:17,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 10:18:17,777 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:18:17,778 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:18:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:18:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 898051427, now seen corresponding path program 1 times [2022-09-16 10:18:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:18:17,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33237942] [2022-09-16 10:18:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:18:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:18,096 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:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:18,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33237942] [2022-09-16 10:18:18,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33237942] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:18:18,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408968933] [2022-09-16 10:18:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:18:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:18:18,098 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:18:18,100 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:18:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:18,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 10:18:18,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:18,463 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:18,554 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:18:18,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:18,606 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:18:18,787 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 10:18:18,788 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:18:18,823 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:18:18,827 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:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:53,406 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) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_555 2147483648) 0))) is different from false [2022-09-16 10:18:53,443 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|) (+ 3204 |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) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 10:18:53,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:53,498 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:53,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:53,505 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:53,510 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:53,519 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:53,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:53,527 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:53,778 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:53,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408968933] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:53,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:53,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-09-16 10:18:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121900833] [2022-09-16 10:18:53,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:53,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 10:18:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 10:18:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1992, Unknown=65, NotChecked=186, Total=2450 [2022-09-16 10:18:53,780 INFO L87 Difference]: Start difference. First operand 7310 states and 18286 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:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:18:56,479 INFO L93 Difference]: Finished difference Result 15484 states and 39241 transitions. [2022-09-16 10:18:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:18:56,480 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:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:18:56,509 INFO L225 Difference]: With dead ends: 15484 [2022-09-16 10:18:56,509 INFO L226 Difference]: Without dead ends: 15484 [2022-09-16 10:18:56,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 228 SyntacticMatches, 13 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=1025, Invalid=4174, Unknown=65, NotChecked=286, Total=5550 [2022-09-16 10:18:56,511 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 3813 mSDsluCounter, 6075 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3813 SdHoareTripleChecker+Valid, 6469 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:18:56,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3813 Valid, 6469 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1410 Invalid, 0 Unknown, 1560 Unchecked, 0.8s Time] [2022-09-16 10:18:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2022-09-16 10:18:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 9636. [2022-09-16 10:18:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9636 states, 9624 states have (on average 2.5587073981712387) internal successors, (24625), 9635 states have internal predecessors, (24625), 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:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9636 states to 9636 states and 24625 transitions. [2022-09-16 10:18:56,684 INFO L78 Accepts]: Start accepts. Automaton has 9636 states and 24625 transitions. Word has length 128 [2022-09-16 10:18:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:18:56,685 INFO L495 AbstractCegarLoop]: Abstraction has 9636 states and 24625 transitions. [2022-09-16 10:18:56,685 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:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9636 states and 24625 transitions. [2022-09-16 10:18:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:18:56,690 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:18:56,691 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:56,709 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:56,895 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:56,896 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:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:18:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -104519622, now seen corresponding path program 1 times [2022-09-16 10:18:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:18:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013658411] [2022-09-16 10:18:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:18:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:57,939 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:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013658411] [2022-09-16 10:18:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013658411] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:18:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334758011] [2022-09-16 10:18:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:57,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:18:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:18:57,940 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:57,941 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:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:58,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 10:18:58,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:58,127 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:18:58,127 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:58,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:18:58,155 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:58,271 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:58,306 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:58,545 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:58,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:58,867 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:18:58,867 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:58,944 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:59,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:59,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:59,198 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:59,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:59,551 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:59,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:59,684 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:59,975 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:18:59,975 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:59,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:59,985 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:59,988 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:59,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:19:29,663 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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:19:29,734 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_627 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:19:29,783 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:19:29,803 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 (+ 3204 |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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:19:29,919 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_627) (not (<= v_ArrVal_625 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 10:19:30,008 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_625))))) is different from false [2022-09-16 10:19:30,041 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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_625) (< (+ (select .cse1 .cse3) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 10:19:30,075 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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)))) (< (+ (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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_627)))))) is different from false [2022-09-16 10:19:30,223 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|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_627)))))) is different from false [2022-09-16 10:19:30,275 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 ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 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) (< (+ (select .cse0 .cse2) 1) v_ArrVal_625) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse3 (+ |c_~#queue~0.offset| 3204))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:19:30,369 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 ((.cse3 (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 .cse3 (+ (* 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 ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse2 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) (< (+ (select .cse0 .cse2) 1) v_ArrVal_625) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse3 .cse1))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse4 (+ |c_~#queue~0.offset| 3204)))))))))) is different from false [2022-09-16 10:19:30,493 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 ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* 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 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_627))))))) is different from false [2022-09-16 10:19:31,092 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 ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_627) (< (+ (select .cse3 .cse4) 1) v_ArrVal_625) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse4) 2147483647)))))))) is different from false [2022-09-16 10:19:31,903 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|) (+ 3208 |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|)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_625) .cse1 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_619 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_625) (< (+ (select .cse3 .cse1) 1) v_ArrVal_627) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse4 .cse1)))))))))) is different from false [2022-09-16 10:19:31,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:31,929 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:19:31,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:31,986 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:19:32,015 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 394 treesize of output 362 [2022-09-16 10:19:32,035 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 247 treesize of output 235 [2022-09-16 10:19:32,078 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:19:32,200 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:33,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:33,536 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 255 treesize of output 235 [2022-09-16 10:19:34,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:19:34,156 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:19:34,259 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:34,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334758011] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:19:34,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:19:34,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-09-16 10:19:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62835780] [2022-09-16 10:19:34,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:19:34,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-16 10:19:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:19:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-16 10:19:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=4229, Unknown=45, NotChecked=2058, Total=6806 [2022-09-16 10:19:34,269 INFO L87 Difference]: Start difference. First operand 9636 states and 24625 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:44,507 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 103 DAG size of output: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:19:45,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse1 (= (select .cse2 3204) 0))) (or (and .cse0 (= |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|) 3208) 0) .cse1) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse2 3208) 0) .cse1))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (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 ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse7 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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse5 .cse4))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_627) (< (+ (select .cse6 .cse7) 1) v_ArrVal_625) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse7) 2147483647)))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:45,964 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) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse2 (= (select .cse3 3204) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse1 3208) 0) .cse2 (= .cse1 .cse3)) (and .cse0 (= |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|)) .cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0))))) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |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 .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |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|) (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 ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_621))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |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 ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_625) .cse5 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 .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse6 .cse5))) (< (+ (select .cse7 .cse5) 1) v_ArrVal_627) (< (+ (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) .cse8) 2147483647)))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:46,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (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 ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse5 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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_627) (< (+ (select .cse4 .cse5) 1) v_ArrVal_625) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse5) 2147483647)))))))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse8 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (let ((.cse9 (= (select .cse11 .cse8) 0)) (.cse10 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse8)) .cse9 .cse10 (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|) 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and .cse9 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (not .cse10) (= .cse11 .cse0) (= (select .cse0 3208) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:47,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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 ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse0 (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| 3204)) (= (select .cse1 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= 0 (select .cse1 3204)))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (not .cse0) (= (select .cse2 3208) 0) (= (select .cse2 3204) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))))) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (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 ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse7 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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse5 .cse4))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_627) (< (+ (select .cse6 .cse7) 1) v_ArrVal_625) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse7) 2147483647)))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:49,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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_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 ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* 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 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_627))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (let ((.cse7 (= (select .cse6 3208) 0)) (.cse8 (= (select .cse6 3204) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse7 .cse8) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse7 .cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:19:50,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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 ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (= (select .cse2 3204) 0)) (.cse1 (= (select .cse2 3208) 0))) (or (and .cse0 .cse1 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))))) (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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 (+ (* 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 .cse8 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (select (store (store .cse8 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse5 v_ArrVal_625) .cse4 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_627) (< (+ (select .cse3 .cse5) 1) v_ArrVal_625) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse6 .cse4))) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse7 (+ |c_~#queue~0.offset| 3204)))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse9 (+ 3208 |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:52,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |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 ((.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (= 0 (select .cse4 .cse3))) (.cse1 (= (select .cse4 .cse2) 0))) (or (and .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) .cse1) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2)) .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse3)) .cse1)))) (= 7 |c_~#queue~0.base|) (<= (select .cse5 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse5 (+ 3208 |c_~#queue~0.offset|)) 0) (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 ((.cse6 (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select (store (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse8 v_ArrVal_625) .cse7 v_ArrVal_627)) |c_~#stored_elements~0.base| v_ArrVal_629) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse7) 1) v_ArrVal_627) (< (+ (select .cse6 .cse8) 1) v_ArrVal_625) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse9 (+ |c_~#queue~0.offset| 3204))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (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:57,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| 7)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 .cse1) 1) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 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|)) (<= (select .cse2 3208) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_631 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_629 (Array Int Int))) (let ((.cse3 (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 .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (* (select .cse4 .cse5) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (<= (select .cse4 .cse1) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse0 .cse5) 1) (<= (* (select .cse2 3204) 4) 4) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) is different from false [2022-09-16 10:19:58,062 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (= |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 ((.cse1 (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 .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_631) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 3204) 4) 4) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:20:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:20:02,969 INFO L93 Difference]: Finished difference Result 16725 states and 42720 transitions. [2022-09-16 10:20:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 10:20:02,970 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:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:20:02,999 INFO L225 Difference]: With dead ends: 16725 [2022-09-16 10:20:02,999 INFO L226 Difference]: Without dead ends: 16725 [2022-09-16 10:20:03,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 219 SyntacticMatches, 17 SemanticMatches, 119 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3743 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=1052, Invalid=8488, Unknown=58, NotChecked=4922, Total=14520 [2022-09-16 10:20:03,022 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1599 mSDsluCounter, 6372 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 6535 SdHoareTripleChecker+Invalid, 6859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5147 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:20:03,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 6535 Invalid, 6859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1626 Invalid, 0 Unknown, 5147 Unchecked, 0.8s Time] [2022-09-16 10:20:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2022-09-16 10:20:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 11373. [2022-09-16 10:20:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11373 states, 11361 states have (on average 2.5682598362820173) internal successors, (29178), 11372 states have internal predecessors, (29178), 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:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 29178 transitions. [2022-09-16 10:20:03,244 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 29178 transitions. Word has length 132 [2022-09-16 10:20:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:20:03,244 INFO L495 AbstractCegarLoop]: Abstraction has 11373 states and 29178 transitions. [2022-09-16 10:20:03,244 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:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 29178 transitions. [2022-09-16 10:20:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:20:03,253 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:20:03,253 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:03,275 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:20:03,470 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:20:03,471 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:20:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:20:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -322267980, now seen corresponding path program 2 times [2022-09-16 10:20:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:20:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959290937] [2022-09-16 10:20:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:20:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:20:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:20:04,742 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:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:20:04,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959290937] [2022-09-16 10:20:04,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959290937] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:20:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948487626] [2022-09-16 10:20:04,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:20:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:20:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:20:04,744 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:20:04,745 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:20:04,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:20:04,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:20:04,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 82 conjunts are in the unsatisfiable core [2022-09-16 10:20:04,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:20:05,389 INFO L356 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-09-16 10:20:05,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2022-09-16 10:20:05,521 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-09-16 10:20:05,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2022-09-16 10:20:06,096 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:06,255 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:08,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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:10,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:20:10,633 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:20:10,634 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:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:20:11,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:20:11,723 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:11,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 10:20:12,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:12,400 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:12,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:20:12,541 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:12,860 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:20:12,860 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:12,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:12,874 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:12,878 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:12,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:20:42,140 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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:20:42,230 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|) (+ 3204 |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|))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:20:42,290 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:20:42,313 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 (+ 3204 |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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 10:20:42,429 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 ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_703)))))) is different from false [2022-09-16 10:20:42,464 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|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |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 (not (<= v_ArrVal_700 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 10:20:42,566 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|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_700)))))) is different from false [2022-09-16 10:20:42,605 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (< (+ (select .cse2 .cse3) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 10:20:42,787 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 (+ 3208 |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 (+ 3204 |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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (< (+ (select .cse3 .cse4) 1) v_ArrVal_703) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 10:20:42,838 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 ((.cse0 (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)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (< (+ (select .cse2 .cse3) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:20:42,930 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 ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse3 .cse4 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|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.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 .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (+ (select .cse5 .cse2) 1) v_ArrVal_703) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-09-16 10:20:43,049 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_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .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) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse2))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_700) (< (+ 1 (select .cse5 .cse2)) v_ArrVal_703)))))))) is different from false [2022-09-16 10:20:43,643 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 ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (< (+ (select .cse2 .cse3) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse3))))))))))) is different from false [2022-09-16 10:20:44,534 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_695)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 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) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_700) (< (+ (select .cse5 .cse3) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse3))) (not (<= v_ArrVal_695 0)))))))))) is different from false [2022-09-16 10:20:44,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:44,591 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:20:44,610 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:44,611 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:20:44,628 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:20:44,649 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:20:44,669 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:20:44,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:44,735 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:20:45,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:20:45,655 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 99 treesize of output 111 [2022-09-16 10:20:46,745 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:20:46,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948487626] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:20:46,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:20:46,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 34, 30] total 90 [2022-09-16 10:20:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169200716] [2022-09-16 10:20:46,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:20:46,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-09-16 10:20:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:20:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-09-16 10:20:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=5325, Unknown=46, NotChecked=2282, Total=8190 [2022-09-16 10:20:46,748 INFO L87 Difference]: Start difference. First operand 11373 states and 29178 transitions. Second operand has 91 states, 90 states have (on average 4.155555555555556) internal successors, (374), 91 states have internal predecessors, (374), 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:44,329 WARN L233 SmtUtils]: Spent 56.54s on a formula simplification. DAG size of input: 148 DAG size of output: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:21:45,032 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse1 (= (select .cse2 3204) 0))) (or (and .cse0 (= |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|) 3208) 0) .cse1) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse2 3208) 0) .cse1))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (not (= 6 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= 2 |c_ULTIMATE.start_main_~#id1~0#1.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 ((.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 ((.cse3 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (+ (select .cse5 .cse6) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse7 .cse6))) (< (select (store .cse7 (+ (* 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 .cse8 .cse6))))))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (<= 2 |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (not (= 4 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (not (= 3 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:45,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (not (= 6 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= 2 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_~#queue~0.offset| 0) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse2 (= (select .cse3 3204) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse1 3208) 0) .cse2 (= .cse1 .cse3)) (and .cse0 (= |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|)) .cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 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 ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_697))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store .cse6 .cse7 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_700) (< (+ (select .cse6 .cse7) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse8 .cse7))) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse9 .cse7))))))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (<= 2 |c_ULTIMATE.start_main_~#id1~0#1.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (not (= 4 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |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|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (not (= 3 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:46,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (not (= 6 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= 2 |c_ULTIMATE.start_main_~#id1~0#1.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 ((.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 ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (< (+ (select .cse2 .cse3) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse3))))))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (<= 2 |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (not (= 4 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse8 (+ 3208 |c_~#queue~0.offset|)) 0) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse9 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (let ((.cse10 (= (select .cse12 .cse9) 0)) (.cse11 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse9)) .cse10 .cse11 (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|) 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and .cse10 (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse11) (= .cse12 .cse8) (= (select .cse8 3208) 0))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (not (= 3 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:47,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse0 (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| 3204)) (= (select .cse1 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= 0 (select .cse1 3204)))) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse2 3208) 0) (= (select .cse2 3204) 0)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (not (= 6 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= 2 |c_ULTIMATE.start_main_~#id1~0#1.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 ((.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 ((.cse3 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (+ (select .cse5 .cse6) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse7 .cse6))) (< (select (store .cse7 (+ (* 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 .cse8 .cse6))))))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (<= 2 |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (not (= 4 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (not (= 3 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:49,335 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (= 7 |c_~#queue~0.base|) (let ((.cse0 (= (select .cse2 3208) 0)) (.cse1 (= (select .cse2 3204) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse0 .cse1) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse0 .cse1))) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (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 ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse4 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse5 v_ArrVal_703)) |c_~#stored_elements~0.base| v_ArrVal_705) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse3 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse5))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_700) (< (+ 1 (select .cse8 .cse5)) v_ArrVal_703)))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:51,300 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (= (select .cse2 3204) 0)) (.cse1 (= (select .cse2 3208) 0))) (or (and .cse0 .cse1 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse0 .cse1)))) (= 7 |c_~#queue~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 ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse7 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse8 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse8 .cse5 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 (+ |c_~#queue~0.offset| 3204)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_700) (< (+ (select .cse8 .cse5) 1) v_ArrVal_703) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))))) (<= (select .cse10 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse10 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:53,308 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 3)) (= |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|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= 0 (select .cse0 .cse1)) (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 ((.cse2 (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)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_700)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse4 (select .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select (store (store .cse7 |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 .cse2 .cse3) 1) v_ArrVal_700) (< (+ (select .cse4 .cse5) 1) v_ArrVal_703) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse6 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 6)) (= 7 |c_~#queue~0.base|) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse8 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse0 .cse9) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 2)) (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| .cse9)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:21:55,893 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| 7)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) (<= (select .cse1 .cse2) 1) (<= (select .cse3 (+ |c_~#queue~0.offset| 3204)) 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|)) (<= (select .cse3 3208) 1) (<= (select .cse3 3204) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse4 .cse5) 1) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (<= (select .cse4 .cse2) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse1 .cse5) 1) (<= (select .cse3 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) is different from false [2022-09-16 10:21:56,604 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_706) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse1 3208) 1) (<= (select .cse1 3204) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:22:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:22:03,312 INFO L93 Difference]: Finished difference Result 18531 states and 47509 transitions. [2022-09-16 10:22:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 10:22:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 4.155555555555556) internal successors, (374), 91 states have internal predecessors, (374), 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:22:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:22:03,349 INFO L225 Difference]: With dead ends: 18531 [2022-09-16 10:22:03,349 INFO L226 Difference]: Without dead ends: 18531 [2022-09-16 10:22:03,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 210 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 23 IntricatePredicates, 2 DeprecatedPredicates, 4122 ImplicationChecksByTransitivity, 107.0s TimeCoverageRelationStatistics Valid=1167, Invalid=8965, Unknown=60, NotChecked=5060, Total=15252 [2022-09-16 10:22:03,351 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 1103 mSDsluCounter, 8138 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 8276 SdHoareTripleChecker+Invalid, 7331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5524 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:22:03,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 8276 Invalid, 7331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1712 Invalid, 0 Unknown, 5524 Unchecked, 0.9s Time] [2022-09-16 10:22:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18531 states. [2022-09-16 10:22:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18531 to 12846. [2022-09-16 10:22:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12846 states, 12834 states have (on average 2.5745675549322113) internal successors, (33042), 12845 states have internal predecessors, (33042), 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:22:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12846 states to 12846 states and 33042 transitions. [2022-09-16 10:22:03,611 INFO L78 Accepts]: Start accepts. Automaton has 12846 states and 33042 transitions. Word has length 132 [2022-09-16 10:22:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:22:03,611 INFO L495 AbstractCegarLoop]: Abstraction has 12846 states and 33042 transitions. [2022-09-16 10:22:03,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 4.155555555555556) internal successors, (374), 91 states have internal predecessors, (374), 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:22:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 12846 states and 33042 transitions. [2022-09-16 10:22:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:22:03,623 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:22:03,624 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:22:03,645 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:22:03,838 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:22:03,838 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:22:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:22:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1660132424, now seen corresponding path program 3 times [2022-09-16 10:22:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:22:03,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467587608] [2022-09-16 10:22:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:22:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:22:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:22:47,591 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:22:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:22:47,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467587608] [2022-09-16 10:22:47,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467587608] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:22:47,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566200440] [2022-09-16 10:22:47,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 10:22:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:22:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:22:47,593 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:22:47,594 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:22:47,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 10:22:47,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:22:47,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 10:22:47,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:22:47,805 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:22:47,805 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:22:47,842 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:22:47,842 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:22:47,995 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:22:48,037 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:22:48,335 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:22:48,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:22:48,731 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:22:48,731 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:22:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:22:48,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:22:49,000 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:22:49,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:22:49,334 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:22:49,375 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:22:49,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:22:49,448 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:22:49,622 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:22:49,622 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:22:49,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:22:49,630 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:22:49,633 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:22:49,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:23:16,743 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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:23:16,783 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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:23:16,797 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|) (+ 3204 |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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_778 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 10:23:16,828 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|) (+ 3204 |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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_778)))) is different from false [2022-09-16 10:23:16,840 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 |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:23:16,902 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (not (<= v_ArrVal_777 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:23:16,948 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:23:16,968 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|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_777) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:23:17,084 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)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 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 .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_777) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_778))))) is different from false [2022-09-16 10:23:17,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (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)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_777))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:23:17,199 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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_778) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-09-16 10:23:17,278 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 ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse3) 2147483647)))))) is different from false [2022-09-16 10:23:17,639 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)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (< (+ (select .cse0 .cse2) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse2) 2147483647))))))) is different from false [2022-09-16 10:23:17,982 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .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 .cse2 .cse1) 1) v_ArrVal_778) (not (<= v_ArrVal_772 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse3 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse4) 2147483647) (< (+ (select .cse2 .cse4) 1) v_ArrVal_777))))))) is different from false [2022-09-16 10:23:17,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:17,998 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:23:18,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:18,008 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 659 treesize of output 655 [2022-09-16 10:23:18,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 289 treesize of output 277 [2022-09-16 10:23:18,029 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 561 treesize of output 513 [2022-09-16 10:23:18,038 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 543 treesize of output 519 [2022-09-16 10:23:18,071 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:23:18,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:18,491 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 174 treesize of output 190 [2022-09-16 10:23:19,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:19,345 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:23:19,446 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:23:19,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566200440] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:23:19,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:23:19,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 10:23:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537475543] [2022-09-16 10:23:19,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:23:19,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 10:23:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:23:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 10:23:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4322, Unknown=46, NotChecked=2086, Total=6972 [2022-09-16 10:23:19,448 INFO L87 Difference]: Start difference. First operand 12846 states and 33042 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:23:20,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|))) (<= (select .cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~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 ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store (store .cse6 |c_~#queue~0.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 .cse1 .cse2) 1) v_ArrVal_778) (< (+ (select .cse1 .cse3) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse5 .cse2))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse3) 2147483647))))))) (= |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|)) (= ((as const (Array Int Int)) 0) .cse0) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse7 (+ 3208 |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:23:21,811 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse9 .cse0))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse0))) (let ((.cse1 (store .cse12 .cse11 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (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|))) (= .cse0 (store .cse1 .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~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)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_777) .cse4 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_778) (< (+ (select .cse3 .cse5) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse6 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse7 .cse4))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse5) 2147483647))))))) (= |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 (= .cse0 .cse9) (<= .cse10 3200)) (or (<= .cse11 3200) (= .cse0 .cse12)) (= 7 |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (or (= .cse0 .cse1) (<= .cse2 3200)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))))))) is different from false [2022-09-16 10:23:22,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse6 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse9 .cse6))) (let ((.cse7 (store .cse9 .cse10 0))) (let ((.cse8 (@diff .cse7 .cse6))) (let ((.cse11 (store .cse7 .cse8 0))) (let ((.cse12 (@diff .cse11 .cse6)) (.cse13 (select |c_#memory_int| |c_~#queue~0.base|))) (and (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|))) (not (= |c_~#queue~0.base| |c_~#stored_elements~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 ((.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)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (< (+ (select .cse0 .cse2) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse2) 2147483647))))))) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (= .cse6 .cse7) (<= .cse8 3200)) (or (= .cse6 .cse9) (<= .cse10 3200)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= .cse6 (store .cse11 .cse12 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|) (<= (select .cse13 (+ |c_~#queue~0.offset| 3204)) 0) (or (<= .cse12 3200) (= .cse6 .cse11)) (<= (select .cse13 (+ 3208 |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:23:23,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse8 (@diff .cse0 .cse7))) (let ((.cse9 (store .cse0 .cse8 0))) (let ((.cse10 (@diff .cse9 .cse7))) (let ((.cse11 (store .cse9 .cse10 0))) (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse12 (@diff .cse11 .cse7))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204)) 0) (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 ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store (store .cse6 |c_~#queue~0.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 .cse1 .cse2) 1) v_ArrVal_778) (< (+ (select .cse1 .cse3) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse5 .cse2))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse3) 2147483647))))))) (= |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 (= .cse7 .cse0) (<= .cse8 3200)) (or (= .cse7 .cse9) (<= .cse10 3200)) (or (= .cse7 .cse11) (<= .cse12 3200)) (= 7 |c_~#queue~0.base|) (<= (select .cse13 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse13 (+ 3208 |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|))) (= .cse7 (store .cse11 .cse12 0))))))))) is different from false [2022-09-16 10:23:24,729 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse9 .cse0))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse0))) (let ((.cse1 (store .cse12 .cse11 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~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)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_777) .cse4 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_778) (< (+ (select .cse3 .cse5) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse6 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse7 .cse4))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse5) 2147483647))))))) (= |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 (= (select .cse9 .cse10) 0) (<= .cse10 3200)) (or (<= .cse11 3200) (= .cse0 .cse12)) (= 7 |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (or (= .cse0 .cse1) (<= .cse2 3200)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))))))) is different from false [2022-09-16 10:23:26,740 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse6 .cse10))) (let ((.cse14 (store .cse6 .cse13 0))) (let ((.cse17 (@diff .cse14 .cse10))) (let ((.cse15 (store .cse14 .cse17 0))) (let ((.cse16 (@diff .cse15 .cse10))) (let ((.cse11 (store .cse15 .cse16 0))) (let ((.cse5 (= .cse10 .cse11))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (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 ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_775)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .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 (< (+ (select .cse0 .cse1) 1) v_ArrVal_778) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse4 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) .cse3) 2147483647)))))) (or .cse5 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (let ((.cse9 (<= .cse13 3200)) (.cse7 (<= .cse17 3200)) (.cse8 (<= .cse16 3200))) (or (let ((.cse12 (@diff .cse11 .cse10))) (and .cse7 .cse8 .cse9 (= .cse10 (store .cse11 .cse12 0)) (<= .cse12 3200))) (and .cse5 (or (= (select .cse6 .cse13) 0) .cse9) (or .cse7 (= .cse10 .cse14)) (or (= .cse10 .cse15) .cse8)))) (<= |c_~#stored_elements~0.base| 6)))))))))) is different from false [2022-09-16 10:23:28,775 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse5))) (let ((.cse11 (store .cse12 .cse13 0))) (let ((.cse18 (@diff .cse11 .cse5))) (let ((.cse16 (store .cse11 .cse18 0))) (let ((.cse17 (@diff .cse16 .cse5))) (let ((.cse6 (store .cse16 .cse17 0))) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (@diff .cse6 .cse5)) (.cse9 (= .cse5 .cse6))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_778) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_777) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= .cse5 (store .cse6 .cse7 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 .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse8 (+ 3208 |c_~#queue~0.offset|)) 0) (let ((.cse10 (<= .cse18 3200)) (.cse15 (<= .cse17 3200)) (.cse14 (<= .cse13 3200))) (or (and .cse9 (or .cse10 (= .cse5 .cse11)) (or (= (select .cse12 .cse13) 0) .cse14) (or .cse15 (= .cse5 .cse16))) (and .cse10 .cse15 (<= .cse7 3200) .cse14))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or .cse9 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (<= |c_~#stored_elements~0.base| 6)))))))))) is different from false [2022-09-16 10:23:30,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)))) (and (= |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|) (= 0 (select .cse0 .cse1)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (or (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 ((.cse2 (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)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .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 (< (+ (select .cse2 .cse3) 1) v_ArrVal_778) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse2 .cse5) 1) v_ArrVal_777))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 7 |c_~#queue~0.base|) (or .cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse0 .cse8) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse8)) .cse6) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:23:48,815 WARN L233 SmtUtils]: Spent 15.91s on a formula simplification. DAG size of input: 99 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:23:49,766 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| 7)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 .cse1) 1) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 1) (or (<= 802 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 800)) (= |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 ((.cse3 (select .cse4 .cse5))) (or (<= 803 .cse3) (<= .cse3 801))) (<= (select .cse2 3208) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse4 .cse1) 1) (= 7 |c_~#queue~0.base|) (or .cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= (select .cse0 .cse5) 1) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_781 (Array Int Int))) (let ((.cse7 (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 .cse7 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse5)) .cse6) (<= |c_~#stored_elements~0.base| 6) (let ((.cse8 (select .cse2 3204))) (or (<= .cse8 801) (<= 803 .cse8))))) is different from false [2022-09-16 10:23:50,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_783 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_781 (Array Int Int))) (let ((.cse1 (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 .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_783) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= |c_~#stored_elements~0.base| 6) (let ((.cse2 (select .cse0 3204))) (or (<= .cse2 801) (<= 803 .cse2))))) is different from false [2022-09-16 10:23:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:23:57,069 INFO L93 Difference]: Finished difference Result 36047 states and 91966 transitions. [2022-09-16 10:23:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-09-16 10:23:57,069 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:23:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:23:57,137 INFO L225 Difference]: With dead ends: 36047 [2022-09-16 10:23:57,137 INFO L226 Difference]: Without dead ends: 36047 [2022-09-16 10:23:57,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 266 SyntacticMatches, 17 SemanticMatches, 127 ConstructedPredicates, 24 IntricatePredicates, 6 DeprecatedPredicates, 4524 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=1479, Invalid=9476, Unknown=61, NotChecked=5496, Total=16512 [2022-09-16 10:23:57,139 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 4049 mSDsluCounter, 7482 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 7631 SdHoareTripleChecker+Invalid, 9747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8322 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:23:57,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 7631 Invalid, 9747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1302 Invalid, 0 Unknown, 8322 Unchecked, 1.0s Time] [2022-09-16 10:23:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36047 states. [2022-09-16 10:23:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36047 to 15853. [2022-09-16 10:23:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15853 states, 15841 states have (on average 2.6116406792500473) internal successors, (41371), 15852 states have internal predecessors, (41371), 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:23:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15853 states to 15853 states and 41371 transitions. [2022-09-16 10:23:57,600 INFO L78 Accepts]: Start accepts. Automaton has 15853 states and 41371 transitions. Word has length 132 [2022-09-16 10:23:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:23:57,600 INFO L495 AbstractCegarLoop]: Abstraction has 15853 states and 41371 transitions. [2022-09-16 10:23:57,600 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:23:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15853 states and 41371 transitions. [2022-09-16 10:23:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:23:57,612 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:23:57,612 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:23:57,630 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:23:57,823 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:23:57,824 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:23:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:23:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash -820682180, now seen corresponding path program 4 times [2022-09-16 10:23:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:23:57,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774198977] [2022-09-16 10:23:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:23:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:23:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:23:59,240 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:23:59,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:23:59,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774198977] [2022-09-16 10:23:59,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774198977] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:23:59,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110565169] [2022-09-16 10:23:59,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 10:23:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:23:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:23:59,252 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:23:59,264 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:23:59,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 10:23:59,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:23:59,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 10:23:59,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:23:59,469 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:23:59,469 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:23:59,644 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:23:59,694 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:24:00,042 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:24:00,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:24:00,390 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:24:00,391 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:24:00,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:24:00,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:24:00,572 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:24:00,834 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:24:00,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:24:00,944 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:24:01,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:24:01,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:24:01,069 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:24:01,271 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:24:01,271 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:24:01,309 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:24:01,336 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:24:01,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:24:33,803 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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:24:33,861 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 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:24:33,926 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|) (+ 3204 |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|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 10:24:33,967 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|) (+ 3204 |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_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_854)))) is different from false [2022-09-16 10:24:33,984 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 |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 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 .cse0 .cse1) 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 10:24:34,016 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 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 .cse0 .cse1) 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 10:24:34,034 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 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 .cse0 .cse1) 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:24:34,092 WARN L833 $PredicateComparison]: unable to prove that (or (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_852) .cse1 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 .cse0 .cse1) 1) v_ArrVal_854) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_852 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))) is different from false [2022-09-16 10:24:34,164 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_852) .cse1 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 .cse0 .cse1) 1) v_ArrVal_854) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_852))))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:24:34,186 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_852) .cse2 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 .cse0 .cse2) 1) v_ArrVal_854) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse3 (+ |c_~#queue~0.offset| 3204)))))))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) is different from false [2022-09-16 10:24:34,306 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 ((.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_850)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_852) .cse4 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse5 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse5 |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) (< (+ .cse2 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse2 800))))) is different from false [2022-09-16 10:24:34,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (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 ((.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)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_852) .cse4 v_ArrVal_854)) |c_~#stored_elements~0.base| v_ArrVal_855))) (store .cse5 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_856))) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse4))) (or (< (+ .cse0 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_852) (= 800 .cse0))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-09-16 10:24:34,424 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 ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (select (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse5 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|)) (.cse0 (select .cse4 .cse3))) (or (= 800 .cse0) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (+ .cse0 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_852)))))) is different from false [2022-09-16 10:24:34,552 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 ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse2 .cse1)) (.cse0 (select (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_852) .cse1 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|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_852) (< (+ .cse4 1) v_ArrVal_854) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse5 .cse1))) (= .cse4 800) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) .cse3) 2147483647)))))) is different from false [2022-09-16 10:24:35,087 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 ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .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 .cse4 .cse3))) (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_64| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_852) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse3))) (= .cse5 800) (< (+ .cse5 1) v_ArrVal_854))))))) is different from false [2022-09-16 10:24:36,051 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_847)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_848))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_850)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_852) .cse1 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 .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_859) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_852) (< (+ .cse5 1) v_ArrVal_854) (not (<= v_ArrVal_847 0)) (= 800 .cse5))))))) is different from false [2022-09-16 10:24:36,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:24:36,078 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:24:36,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:24:36,125 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 9219 treesize of output 9087 [2022-09-16 10:24:36,173 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 9858 treesize of output 9794 [2022-09-16 10:24:36,230 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 16256 treesize of output 15344 [2022-09-16 10:24:36,497 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 Received shutdown request... [2022-09-16 10:30:38,898 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-09-16 10:30:38,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2022-09-16 10:30:38,906 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:38,906 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:38,925 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:39,108 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:39,109 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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2022-09-16 10:30:39,111 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2022-09-16 10:30:39,112 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2022-09-16 10:30:39,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2022-09-16 10:30:39,114 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2022-09-16 10:30:39,114 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2022-09-16 10:30:39,114 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2022-09-16 10:30:39,114 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2022-09-16 10:30:39,114 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2022-09-16 10:30:39,116 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2022-09-16 10:30:39,117 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2022-09-16 10:30:39,117 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2022-09-16 10:30:39,120 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:39,138 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 10:30:39,138 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 10:30:39,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 10:30:39 BasicIcfg [2022-09-16 10:30:39,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 10:30:39,141 INFO L158 Benchmark]: Toolchain (without parser) took 853488.30ms. Allocated memory was 167.8MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 111.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-09-16 10:30:39,141 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 10:30:39,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.03ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 125.5MB in the end (delta: -13.8MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-09-16 10:30:39,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.80ms. Allocated memory is still 167.8MB. Free memory was 125.5MB in the beginning and 122.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 10:30:39,142 INFO L158 Benchmark]: Boogie Preprocessor took 30.18ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 10:30:39,142 INFO L158 Benchmark]: RCFGBuilder took 556.88ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 100.1MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-09-16 10:30:39,142 INFO L158 Benchmark]: TraceAbstraction took 852267.28ms. Allocated memory was 167.8MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 99.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-09-16 10:30:39,143 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.42ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 569.03ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 125.5MB in the end (delta: -13.8MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.80ms. Allocated memory is still 167.8MB. Free memory was 125.5MB in the beginning and 122.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.18ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 556.88ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 100.1MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 852267.28ms. Allocated memory was 167.8MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 99.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.2GB. 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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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 ∧-6-2-2-2-2-2-2-2-2-2-2-2-2-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: 852.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 201.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25874 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25874 mSDsluCounter, 79817 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35319 IncrementalHoareTripleChecker+Unchecked, 74273 mSDsCounter, 1148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15671 IncrementalHoareTripleChecker+Invalid, 52138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1148 mSolverCounterUnsat, 6115 mSDtfsCounter, 15671 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2818 GetRequests, 1658 SyntacticMatches, 122 SemanticMatches, 1038 ConstructedPredicates, 130 IntricatePredicates, 8 DeprecatedPredicates, 26885 ImplicationChecksByTransitivity, 316.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75649occurred in iteration=8, InterpolantAutomatonStates: 479, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 97687 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 232.3s InterpolantComputationTime, 3043 NumberOfCodeBlocks, 3043 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3917 ConstructedInterpolants, 601 QuantifiedInterpolants, 171274 SizeOfPredicates, 209 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 478 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