/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-PN-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 11:28:24,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 11:28:24,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 11:28:24,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 11:28:24,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 11:28:24,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 11:28:24,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 11:28:24,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 11:28:24,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 11:28:24,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 11:28:24,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 11:28:24,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 11:28:24,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 11:28:24,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 11:28:24,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 11:28:24,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 11:28:24,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 11:28:24,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 11:28:24,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 11:28:24,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 11:28:24,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 11:28:24,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 11:28:24,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 11:28:24,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 11:28:24,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 11:28:24,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 11:28:24,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 11:28:24,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 11:28:24,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 11:28:24,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 11:28:24,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 11:28:24,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 11:28:24,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 11:28:24,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 11:28:24,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 11:28:24,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 11:28:24,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 11:28:24,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 11:28:24,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 11:28:24,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 11:28:24,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 11:28:24,438 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-PN-NoLbe.epf [2022-09-16 11:28:24,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 11:28:24,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 11:28:24,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 11:28:24,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 11:28:24,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 11:28:24,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 11:28:24,454 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 11:28:24,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 11:28:24,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 11:28:24,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 11:28:24,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:28:24,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 11:28:24,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-16 11:28:24,458 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 11:28:24,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 11:28:24,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 11:28:24,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 11:28:24,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 11:28:24,637 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 11:28:24,639 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 11:28:24,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42e2e7c8/9f53d6b930d646f9b80a49651b719c1a/FLAG4152e12af [2022-09-16 11:28:25,213 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 11:28:25,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-09-16 11:28:25,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42e2e7c8/9f53d6b930d646f9b80a49651b719c1a/FLAG4152e12af [2022-09-16 11:28:25,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42e2e7c8/9f53d6b930d646f9b80a49651b719c1a [2022-09-16 11:28:25,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 11:28:25,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 11:28:25,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 11:28:25,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 11:28:25,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 11:28:25,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:28:25" (1/1) ... [2022-09-16 11:28:25,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591c5961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:25, skipping insertion in model container [2022-09-16 11:28:25,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:28:25" (1/1) ... [2022-09-16 11:28:25,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 11:28:25,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 11:28:26,007 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 11:28:26,012 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 11:28:26,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:28:26,026 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 11:28:26,072 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 11:28:26,075 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 11:28:26,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:28:26,125 INFO L208 MainTranslator]: Completed translation [2022-09-16 11:28:26,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26 WrapperNode [2022-09-16 11:28:26,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 11:28:26,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 11:28:26,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 11:28:26,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 11:28:26,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,190 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-09-16 11:28:26,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 11:28:26,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 11:28:26,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 11:28:26,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 11:28:26,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 11:28:26,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 11:28:26,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 11:28:26,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 11:28:26,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (1/1) ... [2022-09-16 11:28:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:28:26,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:28:26,277 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 11:28:26,281 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 11:28:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 11:28:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 11:28:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 11:28:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 11:28:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 11:28:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 11:28:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 11:28:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 11:28:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 11:28:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 11:28:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 11:28:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 11:28:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 11:28:26,310 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 11:28:26,456 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 11:28:26,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 11:28:26,704 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 11:28:26,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 11:28:26,712 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 11:28:26,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:28:26 BoogieIcfgContainer [2022-09-16 11:28:26,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 11:28:26,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 11:28:26,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 11:28:26,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 11:28:26,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 11:28:25" (1/3) ... [2022-09-16 11:28:26,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faa0e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:28:26, skipping insertion in model container [2022-09-16 11:28:26,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:26" (2/3) ... [2022-09-16 11:28:26,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faa0e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:28:26, skipping insertion in model container [2022-09-16 11:28:26,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:28:26" (3/3) ... [2022-09-16 11:28:26,726 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-09-16 11:28:26,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 11:28:26,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-09-16 11:28:26,761 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 11:28:26,855 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 11:28:26,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 11:28:26,992 INFO L130 PetriNetUnfolder]: 13/251 cut-off events. [2022-09-16 11:28:26,993 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-16 11:28:27,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 13/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-09-16 11:28:27,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 11:28:27,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 241 transitions, 491 flow [2022-09-16 11:28:27,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 11:28:27,025 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=false, mAutomataTypeConcurrency=PETRI_NET, 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;@511f8b2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 11:28:27,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-09-16 11:28:27,047 INFO L130 PetriNetUnfolder]: 6/140 cut-off events. [2022-09-16 11:28:27,047 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-09-16 11:28:27,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:27,048 INFO L208 CegarLoopForPetriNet]: 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 11:28:27,049 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 11:28:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash -731197578, now seen corresponding path program 1 times [2022-09-16 11:28:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349837727] [2022-09-16 11:28:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:27,475 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 11:28:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:27,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349837727] [2022-09-16 11:28:27,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349837727] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:27,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 11:28:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990510176] [2022-09-16 11:28:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:27,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:28:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:28:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:28:27,534 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 253 [2022-09-16 11:28:27,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 241 transitions, 491 flow. Second operand has 12 states, 12 states have (on average 190.5) internal successors, (2286), 12 states have internal predecessors, (2286), 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 11:28:27,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:27,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 253 [2022-09-16 11:28:27,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:28,219 INFO L130 PetriNetUnfolder]: 611/2942 cut-off events. [2022-09-16 11:28:28,220 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-09-16 11:28:28,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 2942 events. 611/2942 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24642 event pairs, 459 based on Foata normal form. 118/2695 useless extension candidates. Maximal degree in co-relation 3504. Up to 882 conditions per place. [2022-09-16 11:28:28,245 INFO L137 encePairwiseOnDemand]: 236/253 looper letters, 42 selfloop transitions, 12 changer transitions 0/229 dead transitions. [2022-09-16 11:28:28,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 229 transitions, 575 flow [2022-09-16 11:28:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 11:28:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-16 11:28:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2503 transitions. [2022-09-16 11:28:28,261 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7610215871085436 [2022-09-16 11:28:28,262 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2503 transitions. [2022-09-16 11:28:28,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2503 transitions. [2022-09-16 11:28:28,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:28,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2503 transitions. [2022-09-16 11:28:28,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 192.53846153846155) internal successors, (2503), 13 states have internal predecessors, (2503), 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 11:28:28,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 253.0) internal successors, (3542), 14 states have internal predecessors, (3542), 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 11:28:28,284 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 253.0) internal successors, (3542), 14 states have internal predecessors, (3542), 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 11:28:28,286 INFO L175 Difference]: Start difference. First operand has 235 places, 241 transitions, 491 flow. Second operand 13 states and 2503 transitions. [2022-09-16 11:28:28,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 229 transitions, 575 flow [2022-09-16 11:28:28,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 229 transitions, 570 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-16 11:28:28,293 INFO L231 Difference]: Finished difference. Result has 237 places, 229 transitions, 486 flow [2022-09-16 11:28:28,295 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=486, PETRI_PLACES=237, PETRI_TRANSITIONS=229} [2022-09-16 11:28:28,297 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2022-09-16 11:28:28,298 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 229 transitions, 486 flow [2022-09-16 11:28:28,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 190.5) internal successors, (2286), 12 states have internal predecessors, (2286), 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 11:28:28,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:28,299 INFO L208 CegarLoopForPetriNet]: 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 11:28:28,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 11:28:28,300 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 11:28:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 992572438, now seen corresponding path program 1 times [2022-09-16 11:28:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:28,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199321714] [2022-09-16 11:28:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:36,471 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 11:28:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199321714] [2022-09-16 11:28:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199321714] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:36,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:28:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486987929] [2022-09-16 11:28:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:36,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:28:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:28:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:28:36,479 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:28:36,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 229 transitions, 486 flow. Second operand has 18 states, 18 states have (on average 181.88888888888889) internal successors, (3274), 18 states have internal predecessors, (3274), 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 11:28:36,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:36,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:28:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:43,998 INFO L130 PetriNetUnfolder]: 1364/5590 cut-off events. [2022-09-16 11:28:43,999 INFO L131 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2022-09-16 11:28:44,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 5590 events. 1364/5590 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 51733 event pairs, 1005 based on Foata normal form. 1/4826 useless extension candidates. Maximal degree in co-relation 7678. Up to 1675 conditions per place. [2022-09-16 11:28:44,043 INFO L137 encePairwiseOnDemand]: 232/253 looper letters, 108 selfloop transitions, 27 changer transitions 0/301 dead transitions. [2022-09-16 11:28:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 301 transitions, 906 flow [2022-09-16 11:28:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:28:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-16 11:28:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3739 transitions. [2022-09-16 11:28:44,052 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7389328063241106 [2022-09-16 11:28:44,052 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3739 transitions. [2022-09-16 11:28:44,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3739 transitions. [2022-09-16 11:28:44,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:44,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3739 transitions. [2022-09-16 11:28:44,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 186.95) internal successors, (3739), 20 states have internal predecessors, (3739), 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 11:28:44,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 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 11:28:44,074 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 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 11:28:44,074 INFO L175 Difference]: Start difference. First operand has 237 places, 229 transitions, 486 flow. Second operand 20 states and 3739 transitions. [2022-09-16 11:28:44,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 301 transitions, 906 flow [2022-09-16 11:28:44,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 301 transitions, 883 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-09-16 11:28:44,086 INFO L231 Difference]: Finished difference. Result has 254 places, 250 transitions, 620 flow [2022-09-16 11:28:44,087 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=620, PETRI_PLACES=254, PETRI_TRANSITIONS=250} [2022-09-16 11:28:44,087 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 19 predicate places. [2022-09-16 11:28:44,088 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 250 transitions, 620 flow [2022-09-16 11:28:44,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 181.88888888888889) internal successors, (3274), 18 states have internal predecessors, (3274), 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 11:28:44,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:44,091 INFO L208 CegarLoopForPetriNet]: 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 11:28:44,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 11:28:44,091 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 11:28:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2115220582, now seen corresponding path program 1 times [2022-09-16 11:28:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056564622] [2022-09-16 11:28:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:44,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:44,838 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 11:28:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:44,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056564622] [2022-09-16 11:28:44,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056564622] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:44,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:44,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 11:28:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607312616] [2022-09-16 11:28:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:44,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 11:28:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 11:28:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-09-16 11:28:44,844 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 253 [2022-09-16 11:28:44,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 250 transitions, 620 flow. Second operand has 20 states, 20 states have (on average 171.2) internal successors, (3424), 20 states have internal predecessors, (3424), 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 11:28:44,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:44,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 253 [2022-09-16 11:28:44,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:46,799 INFO L130 PetriNetUnfolder]: 2220/7785 cut-off events. [2022-09-16 11:28:46,800 INFO L131 PetriNetUnfolder]: For 892/899 co-relation queries the response was YES. [2022-09-16 11:28:46,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 7785 events. 2220/7785 cut-off events. For 892/899 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 73121 event pairs, 175 based on Foata normal form. 86/7091 useless extension candidates. Maximal degree in co-relation 12298. Up to 1746 conditions per place. [2022-09-16 11:28:46,877 INFO L137 encePairwiseOnDemand]: 231/253 looper letters, 210 selfloop transitions, 44 changer transitions 0/411 dead transitions. [2022-09-16 11:28:46,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 411 transitions, 1509 flow [2022-09-16 11:28:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:28:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-09-16 11:28:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3960 transitions. [2022-09-16 11:28:46,884 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7114624505928854 [2022-09-16 11:28:46,884 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3960 transitions. [2022-09-16 11:28:46,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3960 transitions. [2022-09-16 11:28:46,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:46,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3960 transitions. [2022-09-16 11:28:46,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 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 11:28:46,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 253.0) internal successors, (5819), 23 states have internal predecessors, (5819), 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 11:28:46,898 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 253.0) internal successors, (5819), 23 states have internal predecessors, (5819), 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 11:28:46,898 INFO L175 Difference]: Start difference. First operand has 254 places, 250 transitions, 620 flow. Second operand 22 states and 3960 transitions. [2022-09-16 11:28:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 411 transitions, 1509 flow [2022-09-16 11:28:46,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 411 transitions, 1496 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-09-16 11:28:46,907 INFO L231 Difference]: Finished difference. Result has 275 places, 279 transitions, 865 flow [2022-09-16 11:28:46,907 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=865, PETRI_PLACES=275, PETRI_TRANSITIONS=279} [2022-09-16 11:28:46,908 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 40 predicate places. [2022-09-16 11:28:46,908 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 279 transitions, 865 flow [2022-09-16 11:28:46,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 171.2) internal successors, (3424), 20 states have internal predecessors, (3424), 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 11:28:46,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:46,909 INFO L208 CegarLoopForPetriNet]: 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 11:28:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 11:28:46,910 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 11:28:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1381084976, now seen corresponding path program 1 times [2022-09-16 11:28:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757661179] [2022-09-16 11:28:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:46,938 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 11:28:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757661179] [2022-09-16 11:28:46,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757661179] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:46,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:46,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 11:28:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019811952] [2022-09-16 11:28:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:46,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:28:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:28:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:28:46,940 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 253 [2022-09-16 11:28:46,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 279 transitions, 865 flow. Second operand has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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 11:28:46,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:46,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 253 [2022-09-16 11:28:46,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:47,261 INFO L130 PetriNetUnfolder]: 220/3317 cut-off events. [2022-09-16 11:28:47,261 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-09-16 11:28:47,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 3317 events. 220/3317 cut-off events. For 227/229 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 29858 event pairs, 15 based on Foata normal form. 0/2897 useless extension candidates. Maximal degree in co-relation 3961. Up to 224 conditions per place. [2022-09-16 11:28:47,280 INFO L137 encePairwiseOnDemand]: 248/253 looper letters, 15 selfloop transitions, 4 changer transitions 0/286 dead transitions. [2022-09-16 11:28:47,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 919 flow [2022-09-16 11:28:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 11:28:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-16 11:28:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 952 transitions. [2022-09-16 11:28:47,284 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9407114624505929 [2022-09-16 11:28:47,284 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 952 transitions. [2022-09-16 11:28:47,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 952 transitions. [2022-09-16 11:28:47,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:47,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 952 transitions. [2022-09-16 11:28:47,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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 11:28:47,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 11:28:47,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 11:28:47,287 INFO L175 Difference]: Start difference. First operand has 275 places, 279 transitions, 865 flow. Second operand 4 states and 952 transitions. [2022-09-16 11:28:47,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 919 flow [2022-09-16 11:28:47,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 286 transitions, 886 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-09-16 11:28:47,293 INFO L231 Difference]: Finished difference. Result has 272 places, 282 transitions, 860 flow [2022-09-16 11:28:47,293 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=272, PETRI_TRANSITIONS=282} [2022-09-16 11:28:47,294 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 37 predicate places. [2022-09-16 11:28:47,294 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 282 transitions, 860 flow [2022-09-16 11:28:47,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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 11:28:47,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:47,295 INFO L208 CegarLoopForPetriNet]: 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 11:28:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 11:28:47,295 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 11:28:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1147024205, now seen corresponding path program 1 times [2022-09-16 11:28:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:47,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102072712] [2022-09-16 11:28:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:47,319 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 11:28:47,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102072712] [2022-09-16 11:28:47,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102072712] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:47,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:28:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656217370] [2022-09-16 11:28:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:28:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:28:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:28:47,321 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 253 [2022-09-16 11:28:47,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 282 transitions, 860 flow. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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 11:28:47,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:47,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 253 [2022-09-16 11:28:47,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:47,756 INFO L130 PetriNetUnfolder]: 372/4923 cut-off events. [2022-09-16 11:28:47,757 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-09-16 11:28:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6385 conditions, 4923 events. 372/4923 cut-off events. For 323/333 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 51804 event pairs, 31 based on Foata normal form. 0/4347 useless extension candidates. Maximal degree in co-relation 6298. Up to 486 conditions per place. [2022-09-16 11:28:47,786 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 21 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-09-16 11:28:47,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 292 transitions, 933 flow [2022-09-16 11:28:47,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:28:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:28:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2022-09-16 11:28:47,788 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9312252964426877 [2022-09-16 11:28:47,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2022-09-16 11:28:47,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2022-09-16 11:28:47,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:47,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2022-09-16 11:28:47,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 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 11:28:47,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 11:28:47,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 11:28:47,792 INFO L175 Difference]: Start difference. First operand has 272 places, 282 transitions, 860 flow. Second operand 5 states and 1178 transitions. [2022-09-16 11:28:47,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 292 transitions, 933 flow [2022-09-16 11:28:47,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 292 transitions, 931 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 11:28:47,798 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 890 flow [2022-09-16 11:28:47,798 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=890, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-09-16 11:28:47,799 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 43 predicate places. [2022-09-16 11:28:47,799 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 890 flow [2022-09-16 11:28:47,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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 11:28:47,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:47,800 INFO L208 CegarLoopForPetriNet]: 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 11:28:47,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 11:28:47,800 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 11:28:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 96222015, now seen corresponding path program 1 times [2022-09-16 11:28:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258048811] [2022-09-16 11:28:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:49,620 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 11:28:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258048811] [2022-09-16 11:28:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258048811] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:49,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:28:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997669322] [2022-09-16 11:28:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:28:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:28:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:28:49,624 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:28:49,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 890 flow. Second operand has 18 states, 18 states have (on average 182.05555555555554) internal successors, (3277), 18 states have internal predecessors, (3277), 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 11:28:49,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:49,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:28:49,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:54,584 INFO L130 PetriNetUnfolder]: 6682/26257 cut-off events. [2022-09-16 11:28:54,584 INFO L131 PetriNetUnfolder]: For 4468/4535 co-relation queries the response was YES. [2022-09-16 11:28:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43975 conditions, 26257 events. 6682/26257 cut-off events. For 4468/4535 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 328760 event pairs, 4290 based on Foata normal form. 11/23511 useless extension candidates. Maximal degree in co-relation 43861. Up to 8780 conditions per place. [2022-09-16 11:28:54,758 INFO L137 encePairwiseOnDemand]: 231/253 looper letters, 134 selfloop transitions, 33 changer transitions 0/352 dead transitions. [2022-09-16 11:28:54,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 352 transitions, 1397 flow [2022-09-16 11:28:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:28:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-16 11:28:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3743 transitions. [2022-09-16 11:28:54,764 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7397233201581027 [2022-09-16 11:28:54,764 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3743 transitions. [2022-09-16 11:28:54,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3743 transitions. [2022-09-16 11:28:54,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:54,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3743 transitions. [2022-09-16 11:28:54,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 187.15) internal successors, (3743), 20 states have internal predecessors, (3743), 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 11:28:54,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 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 11:28:54,781 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 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 11:28:54,781 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 890 flow. Second operand 20 states and 3743 transitions. [2022-09-16 11:28:54,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 352 transitions, 1397 flow [2022-09-16 11:28:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 352 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 11:28:54,816 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 1033 flow [2022-09-16 11:28:54,816 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1033, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2022-09-16 11:28:54,818 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 66 predicate places. [2022-09-16 11:28:54,818 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 1033 flow [2022-09-16 11:28:54,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 182.05555555555554) internal successors, (3277), 18 states have internal predecessors, (3277), 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 11:28:54,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:54,819 INFO L208 CegarLoopForPetriNet]: 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 11:28:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 11:28:54,819 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 11:28:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -531736689, now seen corresponding path program 1 times [2022-09-16 11:28:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:54,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58337290] [2022-09-16 11:28:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:55,299 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 11:28:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:55,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58337290] [2022-09-16 11:28:55,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58337290] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:55,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:55,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 11:28:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174850701] [2022-09-16 11:28:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:55,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 11:28:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 11:28:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:28:55,304 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 253 [2022-09-16 11:28:55,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 1033 flow. Second operand has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 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 11:28:55,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:55,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 253 [2022-09-16 11:28:55,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:00,810 INFO L130 PetriNetUnfolder]: 8327/30066 cut-off events. [2022-09-16 11:29:00,810 INFO L131 PetriNetUnfolder]: For 7587/7662 co-relation queries the response was YES. [2022-09-16 11:29:00,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54270 conditions, 30066 events. 8327/30066 cut-off events. For 7587/7662 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 376447 event pairs, 1392 based on Foata normal form. 254/28093 useless extension candidates. Maximal degree in co-relation 54134. Up to 8392 conditions per place. [2022-09-16 11:29:01,041 INFO L137 encePairwiseOnDemand]: 230/253 looper letters, 217 selfloop transitions, 59 changer transitions 0/452 dead transitions. [2022-09-16 11:29:01,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 452 transitions, 2041 flow [2022-09-16 11:29:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:29:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-09-16 11:29:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3785 transitions. [2022-09-16 11:29:01,046 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.712403538490495 [2022-09-16 11:29:01,047 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3785 transitions. [2022-09-16 11:29:01,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3785 transitions. [2022-09-16 11:29:01,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:01,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3785 transitions. [2022-09-16 11:29:01,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 180.23809523809524) internal successors, (3785), 21 states have internal predecessors, (3785), 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 11:29:01,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 253.0) internal successors, (5566), 22 states have internal predecessors, (5566), 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 11:29:01,057 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 253.0) internal successors, (5566), 22 states have internal predecessors, (5566), 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 11:29:01,058 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 1033 flow. Second operand 21 states and 3785 transitions. [2022-09-16 11:29:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 452 transitions, 2041 flow [2022-09-16 11:29:01,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 452 transitions, 2009 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-09-16 11:29:01,173 INFO L231 Difference]: Finished difference. Result has 316 places, 319 transitions, 1339 flow [2022-09-16 11:29:01,173 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1339, PETRI_PLACES=316, PETRI_TRANSITIONS=319} [2022-09-16 11:29:01,174 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 81 predicate places. [2022-09-16 11:29:01,174 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 319 transitions, 1339 flow [2022-09-16 11:29:01,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 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 11:29:01,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:01,175 INFO L208 CegarLoopForPetriNet]: 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 11:29:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 11:29:01,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1947911875, now seen corresponding path program 2 times [2022-09-16 11:29:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:01,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618702928] [2022-09-16 11:29:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:01,764 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 11:29:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618702928] [2022-09-16 11:29:01,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618702928] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:29:01,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:29:01,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 11:29:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687271727] [2022-09-16 11:29:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:29:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 11:29:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 11:29:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:29:01,768 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 253 [2022-09-16 11:29:01,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 319 transitions, 1339 flow. Second operand has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 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 11:29:01,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:01,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 253 [2022-09-16 11:29:01,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:07,284 INFO L130 PetriNetUnfolder]: 8948/32438 cut-off events. [2022-09-16 11:29:07,285 INFO L131 PetriNetUnfolder]: For 16795/16984 co-relation queries the response was YES. [2022-09-16 11:29:07,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61556 conditions, 32438 events. 8948/32438 cut-off events. For 16795/16984 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 411020 event pairs, 1344 based on Foata normal form. 340/30380 useless extension candidates. Maximal degree in co-relation 61412. Up to 6856 conditions per place. [2022-09-16 11:29:07,540 INFO L137 encePairwiseOnDemand]: 232/253 looper letters, 196 selfloop transitions, 64 changer transitions 0/436 dead transitions. [2022-09-16 11:29:07,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 436 transitions, 2178 flow [2022-09-16 11:29:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:29:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-16 11:29:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3253 transitions. [2022-09-16 11:29:07,544 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7143170838823013 [2022-09-16 11:29:07,544 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3253 transitions. [2022-09-16 11:29:07,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3253 transitions. [2022-09-16 11:29:07,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:07,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3253 transitions. [2022-09-16 11:29:07,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 180.72222222222223) internal successors, (3253), 18 states have internal predecessors, (3253), 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 11:29:07,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 253.0) internal successors, (4807), 19 states have internal predecessors, (4807), 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 11:29:07,552 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 253.0) internal successors, (4807), 19 states have internal predecessors, (4807), 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 11:29:07,552 INFO L175 Difference]: Start difference. First operand has 316 places, 319 transitions, 1339 flow. Second operand 18 states and 3253 transitions. [2022-09-16 11:29:07,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 436 transitions, 2178 flow [2022-09-16 11:29:07,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 436 transitions, 2133 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-09-16 11:29:07,742 INFO L231 Difference]: Finished difference. Result has 328 places, 327 transitions, 1552 flow [2022-09-16 11:29:07,742 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1552, PETRI_PLACES=328, PETRI_TRANSITIONS=327} [2022-09-16 11:29:07,744 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 93 predicate places. [2022-09-16 11:29:07,744 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 327 transitions, 1552 flow [2022-09-16 11:29:07,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 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 11:29:07,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:07,745 INFO L208 CegarLoopForPetriNet]: 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 11:29:07,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 11:29:07,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1482775012, now seen corresponding path program 1 times [2022-09-16 11:29:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:07,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333010436] [2022-09-16 11:29:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:07,774 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 11:29:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:07,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333010436] [2022-09-16 11:29:07,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333010436] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:29:07,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:29:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:29:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136858917] [2022-09-16 11:29:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:29:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:29:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:29:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:29:07,777 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 253 [2022-09-16 11:29:07,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 327 transitions, 1552 flow. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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 11:29:07,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:07,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 253 [2022-09-16 11:29:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:08,693 INFO L130 PetriNetUnfolder]: 469/7725 cut-off events. [2022-09-16 11:29:08,693 INFO L131 PetriNetUnfolder]: For 2047/2441 co-relation queries the response was YES. [2022-09-16 11:29:08,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10608 conditions, 7725 events. 469/7725 cut-off events. For 2047/2441 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 88614 event pairs, 23 based on Foata normal form. 44/7092 useless extension candidates. Maximal degree in co-relation 10542. Up to 235 conditions per place. [2022-09-16 11:29:08,744 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 21 selfloop transitions, 4 changer transitions 0/337 dead transitions. [2022-09-16 11:29:08,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 337 transitions, 1628 flow [2022-09-16 11:29:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:29:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:29:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2022-09-16 11:29:08,747 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9312252964426877 [2022-09-16 11:29:08,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2022-09-16 11:29:08,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2022-09-16 11:29:08,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:08,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2022-09-16 11:29:08,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 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 11:29:08,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 11:29:08,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 11:29:08,750 INFO L175 Difference]: Start difference. First operand has 328 places, 327 transitions, 1552 flow. Second operand 5 states and 1178 transitions. [2022-09-16 11:29:08,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 337 transitions, 1628 flow [2022-09-16 11:29:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 337 transitions, 1582 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-09-16 11:29:08,774 INFO L231 Difference]: Finished difference. Result has 325 places, 330 transitions, 1538 flow [2022-09-16 11:29:08,774 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1538, PETRI_PLACES=325, PETRI_TRANSITIONS=330} [2022-09-16 11:29:08,775 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 90 predicate places. [2022-09-16 11:29:08,775 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 330 transitions, 1538 flow [2022-09-16 11:29:08,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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 11:29:08,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:08,776 INFO L208 CegarLoopForPetriNet]: 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 11:29:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 11:29:08,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 742742521, now seen corresponding path program 1 times [2022-09-16 11:29:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496103737] [2022-09-16 11:29:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:08,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:08,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496103737] [2022-09-16 11:29:08,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496103737] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:29:08,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:29:08,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:29:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937107197] [2022-09-16 11:29:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:29:08,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:29:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:29:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:29:08,834 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 253 [2022-09-16 11:29:08,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 330 transitions, 1538 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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 11:29:08,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:08,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 253 [2022-09-16 11:29:08,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:08,994 INFO L130 PetriNetUnfolder]: 49/996 cut-off events. [2022-09-16 11:29:08,994 INFO L131 PetriNetUnfolder]: For 388/389 co-relation queries the response was YES. [2022-09-16 11:29:09,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 996 events. 49/996 cut-off events. For 388/389 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4610 event pairs, 2 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1535. Up to 26 conditions per place. [2022-09-16 11:29:09,003 INFO L137 encePairwiseOnDemand]: 249/253 looper letters, 7 selfloop transitions, 2 changer transitions 5/297 dead transitions. [2022-09-16 11:29:09,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 297 transitions, 1251 flow [2022-09-16 11:29:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:29:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-16 11:29:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2022-09-16 11:29:09,005 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9499341238471674 [2022-09-16 11:29:09,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 721 transitions. [2022-09-16 11:29:09,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 721 transitions. [2022-09-16 11:29:09,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:09,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 721 transitions. [2022-09-16 11:29:09,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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 11:29:09,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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 11:29:09,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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 11:29:09,008 INFO L175 Difference]: Start difference. First operand has 325 places, 330 transitions, 1538 flow. Second operand 3 states and 721 transitions. [2022-09-16 11:29:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 297 transitions, 1251 flow [2022-09-16 11:29:09,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 297 transitions, 1226 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-09-16 11:29:09,019 INFO L231 Difference]: Finished difference. Result has 320 places, 291 transitions, 1195 flow [2022-09-16 11:29:09,020 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=320, PETRI_TRANSITIONS=291} [2022-09-16 11:29:09,021 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 85 predicate places. [2022-09-16 11:29:09,021 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 291 transitions, 1195 flow [2022-09-16 11:29:09,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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 11:29:09,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:09,021 INFO L208 CegarLoopForPetriNet]: 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 11:29:09,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 11:29:09,022 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 11:29:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash 603226518, now seen corresponding path program 1 times [2022-09-16 11:29:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302703816] [2022-09-16 11:29:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:09,401 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 11:29:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:09,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302703816] [2022-09-16 11:29:09,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302703816] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:29:09,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:29:09,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:29:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883033589] [2022-09-16 11:29:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:29:09,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 11:29:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:09,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 11:29:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-09-16 11:29:09,406 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 253 [2022-09-16 11:29:09,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 291 transitions, 1195 flow. Second operand has 17 states, 17 states have (on average 185.64705882352942) internal successors, (3156), 17 states have internal predecessors, (3156), 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 11:29:09,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:09,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 253 [2022-09-16 11:29:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:10,278 INFO L130 PetriNetUnfolder]: 331/2040 cut-off events. [2022-09-16 11:29:10,278 INFO L131 PetriNetUnfolder]: For 1029/1033 co-relation queries the response was YES. [2022-09-16 11:29:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2040 events. 331/2040 cut-off events. For 1029/1033 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12913 event pairs, 237 based on Foata normal form. 2/1922 useless extension candidates. Maximal degree in co-relation 3726. Up to 645 conditions per place. [2022-09-16 11:29:10,291 INFO L137 encePairwiseOnDemand]: 236/253 looper letters, 77 selfloop transitions, 30 changer transitions 0/299 dead transitions. [2022-09-16 11:29:10,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 299 transitions, 1423 flow [2022-09-16 11:29:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 11:29:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-16 11:29:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2829 transitions. [2022-09-16 11:29:10,310 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2022-09-16 11:29:10,310 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2829 transitions. [2022-09-16 11:29:10,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2829 transitions. [2022-09-16 11:29:10,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:10,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2829 transitions. [2022-09-16 11:29:10,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 188.6) internal successors, (2829), 15 states have internal predecessors, (2829), 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 11:29:10,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 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 11:29:10,320 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 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 11:29:10,320 INFO L175 Difference]: Start difference. First operand has 320 places, 291 transitions, 1195 flow. Second operand 15 states and 2829 transitions. [2022-09-16 11:29:10,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 299 transitions, 1423 flow [2022-09-16 11:29:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 299 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-16 11:29:10,332 INFO L231 Difference]: Finished difference. Result has 334 places, 294 transitions, 1281 flow [2022-09-16 11:29:10,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1281, PETRI_PLACES=334, PETRI_TRANSITIONS=294} [2022-09-16 11:29:10,333 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 99 predicate places. [2022-09-16 11:29:10,333 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 294 transitions, 1281 flow [2022-09-16 11:29:10,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 185.64705882352942) internal successors, (3156), 17 states have internal predecessors, (3156), 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 11:29:10,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:10,334 INFO L208 CegarLoopForPetriNet]: 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 11:29:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 11:29:10,334 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 11:29:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1252253510, now seen corresponding path program 1 times [2022-09-16 11:29:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328002134] [2022-09-16 11:29:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:10,873 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 11:29:10,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:10,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328002134] [2022-09-16 11:29:10,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328002134] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:29:10,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:29:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 11:29:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794006109] [2022-09-16 11:29:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:29:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 11:29:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 11:29:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:29:10,877 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 253 [2022-09-16 11:29:10,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 294 transitions, 1281 flow. Second operand has 19 states, 19 states have (on average 174.89473684210526) internal successors, (3323), 19 states have internal predecessors, (3323), 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 11:29:10,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:10,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 253 [2022-09-16 11:29:10,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:11,871 INFO L130 PetriNetUnfolder]: 317/1978 cut-off events. [2022-09-16 11:29:11,871 INFO L131 PetriNetUnfolder]: For 1131/1135 co-relation queries the response was YES. [2022-09-16 11:29:11,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3831 conditions, 1978 events. 317/1978 cut-off events. For 1131/1135 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12507 event pairs, 109 based on Foata normal form. 6/1875 useless extension candidates. Maximal degree in co-relation 3677. Up to 477 conditions per place. [2022-09-16 11:29:11,880 INFO L137 encePairwiseOnDemand]: 237/253 looper letters, 97 selfloop transitions, 26 changer transitions 0/306 dead transitions. [2022-09-16 11:29:11,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 306 transitions, 1544 flow [2022-09-16 11:29:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 11:29:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-16 11:29:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2678 transitions. [2022-09-16 11:29:11,883 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.70566534914361 [2022-09-16 11:29:11,883 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2678 transitions. [2022-09-16 11:29:11,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2678 transitions. [2022-09-16 11:29:11,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:11,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2678 transitions. [2022-09-16 11:29:11,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 178.53333333333333) internal successors, (2678), 15 states have internal predecessors, (2678), 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 11:29:11,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 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 11:29:11,890 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 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 11:29:11,890 INFO L175 Difference]: Start difference. First operand has 334 places, 294 transitions, 1281 flow. Second operand 15 states and 2678 transitions. [2022-09-16 11:29:11,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 306 transitions, 1544 flow [2022-09-16 11:29:11,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 306 transitions, 1510 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-09-16 11:29:11,899 INFO L231 Difference]: Finished difference. Result has 339 places, 294 transitions, 1309 flow [2022-09-16 11:29:11,899 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1309, PETRI_PLACES=339, PETRI_TRANSITIONS=294} [2022-09-16 11:29:11,900 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 104 predicate places. [2022-09-16 11:29:11,900 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 294 transitions, 1309 flow [2022-09-16 11:29:11,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 174.89473684210526) internal successors, (3323), 19 states have internal predecessors, (3323), 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 11:29:11,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:11,901 INFO L208 CegarLoopForPetriNet]: 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 11:29:11,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-16 11:29:11,901 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 11:29:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1414442702, now seen corresponding path program 1 times [2022-09-16 11:29:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:11,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162860246] [2022-09-16 11:29:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:12,576 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 11:29:12,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:12,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162860246] [2022-09-16 11:29:12,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162860246] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:29:12,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594745755] [2022-09-16 11:29:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:29:12,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:29:12,578 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 11:29:12,579 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 11:29:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:12,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 11:29:12,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:29:12,803 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:29:12,804 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 11:29:12,955 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 11:29:12,996 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 11:29:13,226 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 11:29:13,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:29:13,513 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:29:13,514 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 11:29:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:13,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:29:13,700 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 11:29:13,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:13,978 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 11:29:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:14,040 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 11:29:14,200 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:29:14,201 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 11:29:14,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:14,212 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 11:29:14,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 11:29:14,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:29:14,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_344 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:29:14,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_344 (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_344) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:29:14,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_344 (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_344) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:29:14,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_344 (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_344) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:29:14,539 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((v_ArrVal_345 Int) (v_ArrVal_344 (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_344) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:29:16,870 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_341) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_341))) (= 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 11:29:16,884 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int 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_341) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_341)))) (= 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 11:29:16,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 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_338)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse1 .cse3))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_341) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_341) (= 800 .cse4))))) is different from false [2022-09-16 11:29:16,947 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_345 Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse0 (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_338)) (.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_341) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:29:16,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_338)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_341) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 11:29:17,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse4 .cse1)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_341) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_345)) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_341)))))) is different from false [2022-09-16 11:29:17,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_341) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_345)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse6 .cse1))) (= 800 .cse5))))))) is different from false [2022-09-16 11:29:17,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int) (v_ArrVal_336 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_336)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_341) (not (<= v_ArrVal_336 0)) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|) v_ArrVal_345)) .cse1) 2147483647))))))) is different from false [2022-09-16 11:29:17,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:17,552 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 11:29:17,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:17,570 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 11:29:17,590 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 11:29:17,601 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 11:29:17,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:17,648 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 11:29:18,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:18,347 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 630 treesize of output 574 [2022-09-16 11:29:20,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:20,315 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 11:29:20,387 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 11:29:20,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594745755] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:29:20,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:29:20,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 11:29:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992312167] [2022-09-16 11:29:20,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:29:20,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 11:29:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 11:29:20,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3963, Unknown=39, NotChecked=1846, Total=6320 [2022-09-16 11:29:20,394 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 253 [2022-09-16 11:29:20,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 294 transitions, 1309 flow. Second operand has 80 states, 80 states have (on average 160.1625) internal successors, (12813), 80 states have internal predecessors, (12813), 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 11:29:20,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:20,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 253 [2022-09-16 11:29:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:22,071 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_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse8 .cse6))) (or (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_341) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_345)) .cse9) 2147483647) (< (+ (select .cse8 .cse9) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse11 .cse6))) (= 800 .cse10))))))) (= |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 11:29:22,564 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) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (select .cse7 .cse5))) (or (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_341) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_345)) .cse8) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse10 .cse5))) (= 800 .cse9))))))) (= |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 11:29:23,046 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_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse8 .cse6))) (or (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_341) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_345)) .cse9) 2147483647) (< (+ (select .cse8 .cse9) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse11 .cse6))) (= 800 .cse10))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:29:23,553 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_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse4))) (or (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_341) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_345)) .cse7) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse9 .cse4))) (= 800 .cse8))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:29:24,145 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) (= (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) (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse5 .cse2)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (= 800 .cse3) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_341) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) v_ArrVal_345)) .cse6) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_341)))))) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:29:24,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (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|) (= (select .cse0 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse0 3208) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_345 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 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_338)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (select .cse2 .cse6))) (or (< (+ 1 (select .cse2 .cse3)) v_ArrVal_341) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse5 .cse6))) (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_341) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-09-16 11:29:26,674 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_345 Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse0 (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_338)) (.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_341) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_345)) (+ 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 11:29:30,157 INFO L130 PetriNetUnfolder]: 740/3918 cut-off events. [2022-09-16 11:29:30,158 INFO L131 PetriNetUnfolder]: For 2161/2165 co-relation queries the response was YES. [2022-09-16 11:29:30,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 3918 events. 740/3918 cut-off events. For 2161/2165 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31087 event pairs, 442 based on Foata normal form. 6/3705 useless extension candidates. Maximal degree in co-relation 7575. Up to 741 conditions per place. [2022-09-16 11:29:30,217 INFO L137 encePairwiseOnDemand]: 218/253 looper letters, 202 selfloop transitions, 86 changer transitions 0/439 dead transitions. [2022-09-16 11:29:30,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 2594 flow [2022-09-16 11:29:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-09-16 11:29:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-09-16 11:29:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 8318 transitions. [2022-09-16 11:29:30,226 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.644656281484926 [2022-09-16 11:29:30,227 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 8318 transitions. [2022-09-16 11:29:30,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 8318 transitions. [2022-09-16 11:29:30,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:30,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 8318 transitions. [2022-09-16 11:29:30,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 163.09803921568627) internal successors, (8318), 51 states have internal predecessors, (8318), 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 11:29:30,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 253.0) internal successors, (13156), 52 states have internal predecessors, (13156), 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 11:29:30,255 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 253.0) internal successors, (13156), 52 states have internal predecessors, (13156), 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 11:29:30,256 INFO L175 Difference]: Start difference. First operand has 339 places, 294 transitions, 1309 flow. Second operand 51 states and 8318 transitions. [2022-09-16 11:29:30,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 2594 flow [2022-09-16 11:29:30,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 439 transitions, 2548 flow, removed 6 selfloop flow, removed 13 redundant places. [2022-09-16 11:29:30,277 INFO L231 Difference]: Finished difference. Result has 387 places, 339 transitions, 1855 flow [2022-09-16 11:29:30,278 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1855, PETRI_PLACES=387, PETRI_TRANSITIONS=339} [2022-09-16 11:29:30,278 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 152 predicate places. [2022-09-16 11:29:30,278 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 339 transitions, 1855 flow [2022-09-16 11:29:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 160.1625) internal successors, (12813), 80 states have internal predecessors, (12813), 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 11:29:30,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:30,280 INFO L208 CegarLoopForPetriNet]: 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 11:29:30,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-16 11:29:30,500 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 11:29:30,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 898051427, now seen corresponding path program 1 times [2022-09-16 11:29:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:30,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824497089] [2022-09-16 11:29:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:30,980 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 11:29:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824497089] [2022-09-16 11:29:30,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824497089] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:29:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504539398] [2022-09-16 11:29:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:30,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:29:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:29:30,982 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 11:29:30,983 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 11:29:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:31,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 11:29:31,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:29:31,526 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 11:29:31,690 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 11:29:31,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:31,786 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 11:29:32,060 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:29:32,060 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 11:29:32,104 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 11:29:32,109 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 11:29:32,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:30:05,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 Int)) (or (< (+ v_ArrVal_408 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_407) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 11:30:05,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 Int) (v_ArrVal_405 Int)) (or (< 0 (+ (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_405)) |c_~#stored_elements~0.base| v_ArrVal_407) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_408 2147483648) 0))) is different from false [2022-09-16 11:30:05,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:05,799 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 11:30:05,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:05,809 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 11:30:05,817 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 11:30:05,842 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 11:30:05,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:05,852 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 11:30:06,235 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 11:30:06,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504539398] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:30:06,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:30:06,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-09-16 11:30:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508128259] [2022-09-16 11:30:06,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:30:06,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 11:30:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:30:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 11:30:06,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1998, Unknown=59, NotChecked=186, Total=2450 [2022-09-16 11:30:06,242 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:30:06,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 339 transitions, 1855 flow. Second operand has 50 states, 50 states have (on average 183.1) internal successors, (9155), 50 states have internal predecessors, (9155), 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 11:30:06,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:30:06,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:30:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:30:10,175 INFO L130 PetriNetUnfolder]: 1014/6336 cut-off events. [2022-09-16 11:30:10,176 INFO L131 PetriNetUnfolder]: For 3173/3173 co-relation queries the response was YES. [2022-09-16 11:30:10,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11704 conditions, 6336 events. 1014/6336 cut-off events. For 3173/3173 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 58455 event pairs, 339 based on Foata normal form. 11/5997 useless extension candidates. Maximal degree in co-relation 11545. Up to 1038 conditions per place. [2022-09-16 11:30:10,285 INFO L137 encePairwiseOnDemand]: 229/253 looper letters, 190 selfloop transitions, 96 changer transitions 0/471 dead transitions. [2022-09-16 11:30:10,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 471 transitions, 3059 flow [2022-09-16 11:30:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 11:30:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-09-16 11:30:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5597 transitions. [2022-09-16 11:30:10,295 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7374176548089592 [2022-09-16 11:30:10,295 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5597 transitions. [2022-09-16 11:30:10,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5597 transitions. [2022-09-16 11:30:10,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:30:10,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5597 transitions. [2022-09-16 11:30:10,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 186.56666666666666) internal successors, (5597), 30 states have internal predecessors, (5597), 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 11:30:10,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 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 11:30:10,468 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 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 11:30:10,468 INFO L175 Difference]: Start difference. First operand has 387 places, 339 transitions, 1855 flow. Second operand 30 states and 5597 transitions. [2022-09-16 11:30:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 471 transitions, 3059 flow [2022-09-16 11:30:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 471 transitions, 2718 flow, removed 114 selfloop flow, removed 29 redundant places. [2022-09-16 11:30:10,500 INFO L231 Difference]: Finished difference. Result has 399 places, 382 transitions, 2174 flow [2022-09-16 11:30:10,501 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2174, PETRI_PLACES=399, PETRI_TRANSITIONS=382} [2022-09-16 11:30:10,502 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 164 predicate places. [2022-09-16 11:30:10,502 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 382 transitions, 2174 flow [2022-09-16 11:30:10,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 183.1) internal successors, (9155), 50 states have internal predecessors, (9155), 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 11:30:10,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:30:10,504 INFO L208 CegarLoopForPetriNet]: 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 11:30:10,533 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 11:30:10,727 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 11:30:10,727 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 11:30:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:30:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2106394750, now seen corresponding path program 1 times [2022-09-16 11:30:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:30:10,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59915533] [2022-09-16 11:30:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:30:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:30:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:30:12,048 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 11:30:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:30:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59915533] [2022-09-16 11:30:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59915533] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:30:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995951455] [2022-09-16 11:30:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:30:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:30:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:30:12,050 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 11:30:12,051 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 11:30:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:30:12,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 11:30:12,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:30:12,282 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:30:12,283 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 11:30:12,352 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:30:12,353 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 11:30:12,544 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 11:30:12,599 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 11:30:12,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:30:13,071 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 11:30:13,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:30:13,452 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:30:13,453 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 11:30:13,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:30:13,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:30:13,588 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 11:30:13,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:13,842 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 11:30:13,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:30:13,930 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 11:30:14,128 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:30:14,128 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 11:30:14,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:14,139 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 11:30:14,146 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 11:30:14,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:30:41,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:30:41,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| 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_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_481 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:30:41,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| 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_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:30:41,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| 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_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:30:41,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 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_479) .cse2 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_479 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-09-16 11:30:41,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 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_479) .cse2 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_481) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:30:41,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 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_479) .cse3 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_479) (< (+ (select .cse1 .cse3) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:30:41,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 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_477)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_479) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:30:41,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (or (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_477)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (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 11:30:41,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_477)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-09-16 11:30:41,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_481) (< (+ (select .cse4 .cse3) 1) v_ArrVal_479)))))) is different from false [2022-09-16 11:30:41,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_479) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_481))))))) is different from false [2022-09-16 11:30:41,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_481) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))))))))) is different from false [2022-09-16 11:30:42,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (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_473)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_479) .cse3 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_473 0)) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_481))))))) is different from false [2022-09-16 11:30:42,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:42,254 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 270 treesize of output 185 [2022-09-16 11:30:42,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:42,267 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 1320 treesize of output 1308 [2022-09-16 11:30:42,281 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 836 treesize of output 772 [2022-09-16 11:30:42,296 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 638 treesize of output 614 [2022-09-16 11:30:42,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:42,310 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 1140 treesize of output 1092 [2022-09-16 11:30:42,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:42,334 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 11:30:43,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:43,148 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 622 treesize of output 638 [2022-09-16 11:30:45,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:45,563 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 11:30:45,651 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 11:30:45,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995951455] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:30:45,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:30:45,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 11:30:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756197963] [2022-09-16 11:30:45,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:30:45,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 11:30:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:30:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 11:30:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=4351, Unknown=47, NotChecked=2086, Total=6972 [2022-09-16 11:30:45,658 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:30:45,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 382 transitions, 2174 flow. Second operand has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:30:45,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:30:45,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:30:45,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:30:46,804 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) (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (<= .cse0 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |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|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse1 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_479) .cse3 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_481) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse6 .cse3))))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse1 3204) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 11:30:47,480 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_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) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (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) (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_479) .cse3 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_481) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse6 .cse3))))))))) (<= (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|) (= (select .cse0 3208) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:30:48,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204)) (.cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse2 .cse1) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse3 (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0) (= 7 |c_~#queue~0.base|) (<= (select .cse4 (+ |c_~#queue~0.offset| 3204)) 0) (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_479) .cse6 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse6))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_481) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse8) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse9 .cse6))))))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse4 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse2 3208) 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 .cse3 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208))))) is different from false [2022-09-16 11:30:49,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse6 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse0 (not .cse6)) (.cse1 (not .cse4)) (.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 ((.cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (and .cse0 .cse1 (= (select .cse2 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse3 .cse4 (= (select .cse5 3208) 0)) (and .cse6 .cse3 (= (select .cse7 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208))))) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 0) (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (let ((.cse10 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_479) .cse9 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse8 .cse9))) (< (+ (select .cse10 .cse9) 1) v_ArrVal_481) (< (select (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse11) 2147483647) (< (+ (select .cse10 .cse11) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse12 .cse9))))))))) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 0) (or (and .cse6 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= 0 (select .cse7 3204))) (and (= (select .cse5 3204) 0) .cse4 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) (and .cse0 .cse1 (= (select .cse2 3204) 0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-16 11:30:50,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (let ((.cse6 (not .cse8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_476 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_479) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_481))))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (or (and .cse6 (= (select .cse7 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse8 (= (select .cse9 3208) 0))) (or (and .cse6 (= (select .cse7 3204) 0)) (and (= (select .cse9 3204) 0) .cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 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 11:30:51,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (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_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_481) (< (+ (select .cse4 .cse3) 1) v_ArrVal_479)))))) (= (select .cse5 3208) 0) (= 7 |c_~#queue~0.base|) (<= (select .cse5 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse5 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse5 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:30:53,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse6 (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_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_479 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_477)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 3204))))))))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse5 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse5 3208) 0) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:30:55,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (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_29| Int)) (or (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_479 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_477)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 0 (select .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (<= (select .cse5 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse5 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:30:57,154 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) (= |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 .cse0 3208) 1) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_485 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 3204) 4) 4) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 0))) is different from false [2022-09-16 11:30:57,671 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_485 Int) (v_ArrVal_483 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_485) (+ 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 11:31:02,071 INFO L130 PetriNetUnfolder]: 1168/6741 cut-off events. [2022-09-16 11:31:02,071 INFO L131 PetriNetUnfolder]: For 4122/4126 co-relation queries the response was YES. [2022-09-16 11:31:02,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 6741 events. 1168/6741 cut-off events. For 4122/4126 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 62344 event pairs, 732 based on Foata normal form. 4/6396 useless extension candidates. Maximal degree in co-relation 13354. Up to 2302 conditions per place. [2022-09-16 11:31:02,133 INFO L137 encePairwiseOnDemand]: 220/253 looper letters, 228 selfloop transitions, 87 changer transitions 0/480 dead transitions. [2022-09-16 11:31:02,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 480 transitions, 3489 flow [2022-09-16 11:31:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 11:31:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-09-16 11:31:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6603 transitions. [2022-09-16 11:31:02,138 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6524703557312252 [2022-09-16 11:31:02,138 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6603 transitions. [2022-09-16 11:31:02,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6603 transitions. [2022-09-16 11:31:02,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:31:02,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6603 transitions. [2022-09-16 11:31:02,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 165.075) internal successors, (6603), 40 states have internal predecessors, (6603), 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 11:31:02,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 253.0) internal successors, (10373), 41 states have internal predecessors, (10373), 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 11:31:02,150 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 253.0) internal successors, (10373), 41 states have internal predecessors, (10373), 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 11:31:02,150 INFO L175 Difference]: Start difference. First operand has 399 places, 382 transitions, 2174 flow. Second operand 40 states and 6603 transitions. [2022-09-16 11:31:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 480 transitions, 3489 flow [2022-09-16 11:31:02,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 480 transitions, 3364 flow, removed 55 selfloop flow, removed 7 redundant places. [2022-09-16 11:31:02,179 INFO L231 Difference]: Finished difference. Result has 454 places, 442 transitions, 2889 flow [2022-09-16 11:31:02,180 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2889, PETRI_PLACES=454, PETRI_TRANSITIONS=442} [2022-09-16 11:31:02,180 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 219 predicate places. [2022-09-16 11:31:02,180 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 442 transitions, 2889 flow [2022-09-16 11:31:02,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:31:02,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:31:02,182 INFO L208 CegarLoopForPetriNet]: 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 11:31:02,200 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 11:31:02,395 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 11:31:02,395 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:31:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:31:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2005303624, now seen corresponding path program 2 times [2022-09-16 11:31:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:31:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302219475] [2022-09-16 11:31:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:31:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:31:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:31:03,438 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 11:31:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:31:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302219475] [2022-09-16 11:31:03,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302219475] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:31:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992946561] [2022-09-16 11:31:03,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:31:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:31:03,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:31:03,440 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 11:31:03,441 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 11:31:03,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:31:03,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:31:03,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 11:31:03,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:31:03,641 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:31:03,641 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 11:31:03,671 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:31:03,672 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 11:31:03,793 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 11:31:03,832 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 11:31:04,062 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 11:31:04,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:31:04,290 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:31:04,291 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 11:31:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:31:04,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:31:04,438 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 11:31:04,534 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:31:04,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:04,825 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 11:31:04,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:31:04,898 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 11:31:05,116 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:31:05,118 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 11:31:05,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:05,194 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 11:31:05,197 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 11:31:05,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:31:31,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:31:31,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_557 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:31:31,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_557)))) is different from false [2022-09-16 11:31:31,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_557) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:31:32,012 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_557) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 11:31:32,025 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_557) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |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 11:31:32,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse3))) (or (= .cse0 800) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (+ .cse0 1) v_ArrVal_557)))))) is different from false [2022-09-16 11:31:32,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse3))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_555 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ .cse1 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (= .cse1 800)))))) is different from false [2022-09-16 11:31:32,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse3))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_555) (< (+ .cse1 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (= .cse1 800)))))) is different from false [2022-09-16 11:31:32,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse5))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_555) (< (+ .cse3 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (= .cse3 800))))))) is different from false [2022-09-16 11:31:32,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 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_553)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_555) (= 800 .cse0) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:31:32,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_555) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (= 800 .cse3) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_557))))))))) is different from false [2022-09-16 11:31:32,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_557 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse7 .cse4)) (.cse5 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse7 .cse4 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_555) (< (+ .cse2 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse3 .cse4))) (= .cse2 800) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 (+ |c_~#queue~0.offset| 3204))))))))))) is different from false [2022-09-16 11:31:32,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_557 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse7 .cse3)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_555) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse3))) (= .cse4 800) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse1) 2147483647) (< (+ .cse4 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse3)))))))))) is different from false [2022-09-16 11:31:32,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse2)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse1 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse4) 2147483647) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_555) (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse2))))))))))) is different from false [2022-09-16 11:31:33,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse8 (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_550)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse7 .cse1)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_557) (= .cse2 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_555) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse1))) (not (<= v_ArrVal_550 0)) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse4) 2147483647))))))))) is different from false [2022-09-16 11:31:33,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:33,405 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 473 treesize of output 283 [2022-09-16 11:31:33,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:33,420 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 591 treesize of output 585 [2022-09-16 11:31:33,435 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 256 treesize of output 240 [2022-09-16 11:31:33,448 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 373 treesize of output 341 [2022-09-16 11:31:33,461 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 413 treesize of output 389 [2022-09-16 11:31:33,502 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 11:31:34,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:34,249 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 284 treesize of output 292 [2022-09-16 11:31:36,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:36,845 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 11:31:36,935 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 11:31:36,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992946561] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:31:36,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:31:36,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 31] total 85 [2022-09-16 11:31:36,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590887256] [2022-09-16 11:31:36,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:31:36,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:31:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:31:36,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:31:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=4354, Unknown=47, NotChecked=2416, Total=7310 [2022-09-16 11:31:36,941 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 253 [2022-09-16 11:31:36,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 442 transitions, 2889 flow. Second operand has 86 states, 86 states have (on average 159.04651162790697) internal successors, (13678), 86 states have internal predecessors, (13678), 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 11:31:36,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:31:36,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 253 [2022-09-16 11:31:36,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:31:38,276 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))) (.cse5 (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0)) (.cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= .cse0 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (<= .cse0 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse1 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse4 (= (select .cse6 3204) 0))) (or (and .cse1 .cse2 .cse3 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3208) 0) .cse4) (and .cse5 (not .cse1) (= (select .cse6 3208) 0) .cse4))) .cse5 (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse11 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store .cse12 .cse11 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse14 (select .cse13 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (select .cse14 .cse9)) (.cse10 (select (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse9 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse7 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse8 .cse9))) (< (select (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse11) 2147483647) (< (+ 1 (select .cse12 .cse11)) v_ArrVal_555) (= .cse7 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse10 .cse9))))))))))) (= |c_~#queue~0.offset| 0) (or (and .cse2 .cse3) (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |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) .cse2 (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) .cse3 (= 7 |c_~#queue~0.base|) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse6 (+ 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 11:31:38,995 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|)) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse2)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse1 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse4) 2147483647) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_555) (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse2))))))))))) (= |c_~#queue~0.offset| 0) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse11 (= (select .cse12 3204) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse9) (= (select .cse10 3208) 0) .cse11 (= .cse10 .cse12)) (and .cse9 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse11 (= (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 .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)) (= |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 11:31:39,668 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|)) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse2)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse1 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse4) 2147483647) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_555) (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse2))))))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse10 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (let ((.cse11 (= (select .cse13 .cse10) 0)) (.cse12 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse10)) .cse11 .cse12 (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 .cse11 (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse12) (= .cse13 .cse9) (= (select .cse9 3208) 0))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:31:40,443 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|))) (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)))) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_551))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse7 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse10 .cse5)) (.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse5 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ .cse3 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse5))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse7) 2147483647) (< (+ 1 (select .cse8 .cse7)) v_ArrVal_555) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse5))))))))))) (= |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)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:31:42,219 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) (= 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) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_557 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (select .cse10 .cse6)) (.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse6 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_555) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse5 .cse6))) (= .cse7 800) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) .cse4) 2147483647) (< (+ .cse7 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse8 .cse6)))))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:31:43,963 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (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_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_557 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse7 .cse4)) (.cse5 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse7 .cse4 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_555) (< (+ .cse2 1) v_ArrVal_557) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse3 .cse4))) (= .cse2 800) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 (+ |c_~#queue~0.offset| 3204))))))))))) (= |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 ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (= (select .cse10 3204) 0)) (.cse9 (= (select .cse10 3208) 0))) (or (and .cse8 .cse9 (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) .cse8 .cse9)))) (= 7 |c_~#queue~0.base|) (<= (select .cse11 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse11 (+ 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 11:31:45,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_555 Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_557 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_553)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_555)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_556))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_557)) |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_555) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (= 800 .cse3) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_557))))))))) (= |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 .cse7 .cse8)) (= 7 |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse7 .cse10) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (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| .cse10)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse8)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:31:48,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| 7)) (.cse4 (+ 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) (<= (select .cse2 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 .cse3 .cse4) 1) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (<= (select .cse3 .cse1) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (select .cse0 .cse4) 1) (<= (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 11:31:49,015 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) (<= (select .cse0 3204) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_559) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_560) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:31:55,158 INFO L130 PetriNetUnfolder]: 1691/9109 cut-off events. [2022-09-16 11:31:55,158 INFO L131 PetriNetUnfolder]: For 6520/6531 co-relation queries the response was YES. [2022-09-16 11:31:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19665 conditions, 9109 events. 1691/9109 cut-off events. For 6520/6531 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 89613 event pairs, 849 based on Foata normal form. 9/8676 useless extension candidates. Maximal degree in co-relation 19459. Up to 2205 conditions per place. [2022-09-16 11:31:55,259 INFO L137 encePairwiseOnDemand]: 216/253 looper letters, 307 selfloop transitions, 153 changer transitions 0/618 dead transitions. [2022-09-16 11:31:55,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 618 transitions, 4940 flow [2022-09-16 11:31:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-09-16 11:31:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-09-16 11:31:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 7624 transitions. [2022-09-16 11:31:55,265 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6411571776974182 [2022-09-16 11:31:55,265 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 7624 transitions. [2022-09-16 11:31:55,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 7624 transitions. [2022-09-16 11:31:55,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:31:55,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 7624 transitions. [2022-09-16 11:31:55,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 162.2127659574468) internal successors, (7624), 47 states have internal predecessors, (7624), 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 11:31:55,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:31:55,280 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:31:55,280 INFO L175 Difference]: Start difference. First operand has 454 places, 442 transitions, 2889 flow. Second operand 47 states and 7624 transitions. [2022-09-16 11:31:55,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 618 transitions, 4940 flow [2022-09-16 11:31:55,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 618 transitions, 4853 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-09-16 11:31:55,330 INFO L231 Difference]: Finished difference. Result has 511 places, 514 transitions, 4090 flow [2022-09-16 11:31:55,331 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=2804, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=4090, PETRI_PLACES=511, PETRI_TRANSITIONS=514} [2022-09-16 11:31:55,331 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 276 predicate places. [2022-09-16 11:31:55,331 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 514 transitions, 4090 flow [2022-09-16 11:31:55,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 159.04651162790697) internal successors, (13678), 86 states have internal predecessors, (13678), 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 11:31:55,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:31:55,333 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1] [2022-09-16 11:31:55,364 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 11:31:55,551 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 11:31:55,551 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:31:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:31:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1453701475, now seen corresponding path program 1 times [2022-09-16 11:31:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:31:55,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893555871] [2022-09-16 11:31:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:31:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:31:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:31:55,967 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 11:31:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:31:55,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893555871] [2022-09-16 11:31:55,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893555871] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:31:55,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211436700] [2022-09-16 11:31:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:31:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:31:55,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:31:55,980 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 11:31:55,981 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 11:31:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:31:56,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:31:56,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:31:56,536 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 11:31:56,698 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 24 [2022-09-16 11:31:56,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:31:56,769 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 11:31:56,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:31:56,837 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 11:31:57,058 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:31:57,059 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 11:31:57,099 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 11:31:57,103 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 11:31:57,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:32:23,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_629 2147483648) 0))) is different from false [2022-09-16 11:32:23,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int) (v_ArrVal_627 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< 0 (+ (select (store (select (store (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_627)) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_629 2147483648) 0))) is different from false [2022-09-16 11:32:23,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< 0 (+ 2147483650 (select (store (select (store (let ((.cse0 (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_625)))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_627))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_629 2147483648) 0))) is different from false [2022-09-16 11:32:23,172 INFO L356 Elim1Store]: treesize reduction 38, result has 58.2 percent of original size [2022-09-16 11:32:23,173 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 3 case distinctions, treesize of input 59 treesize of output 74 [2022-09-16 11:32:23,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:23,183 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 88 treesize of output 90 [2022-09-16 11:32:23,190 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 11:32:23,224 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 9 treesize of output 5 [2022-09-16 11:32:23,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:23,232 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 54 treesize of output 54 [2022-09-16 11:32:23,653 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 11:32:23,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211436700] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:32:23,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:32:23,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 11:32:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835693475] [2022-09-16 11:32:23,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:32:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:32:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:32:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:32:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2277, Unknown=47, NotChecked=300, Total=2862 [2022-09-16 11:32:23,658 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 253 [2022-09-16 11:32:23,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 514 transitions, 4090 flow. Second operand has 54 states, 54 states have (on average 180.92592592592592) internal successors, (9770), 54 states have internal predecessors, (9770), 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 11:32:23,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:32:23,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 253 [2022-09-16 11:32:23,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:32:24,845 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= 0 (+ 2147483649 |c_t1Thread1of1ForFork0_enqueue_#t~post38#1|)) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< 0 (+ 2147483650 (select (store (select (store (let ((.cse0 (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_625)))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_627))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_629 2147483648) 0))) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:26,526 WARN L833 $PredicateComparison]: unable to prove that (let ((.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|)) (<= 0 |c_~#queue~0.offset|) (= |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|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< 0 (+ 2147483650 (select (store (select (store (let ((.cse0 (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_625)))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_627))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_629 2147483648) 0))) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:28,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0) (and (not .cse0) (<= 0 (+ (select .cse1 3208) 2147483648))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_629 Int) (v_ArrVal_627 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< 0 (+ (select (store (select (store (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_627)) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_629) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_629 2147483648) 0))))) is different from false [2022-09-16 11:32:31,718 INFO L130 PetriNetUnfolder]: 1658/10050 cut-off events. [2022-09-16 11:32:31,718 INFO L131 PetriNetUnfolder]: For 20600/20610 co-relation queries the response was YES. [2022-09-16 11:32:31,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25488 conditions, 10050 events. 1658/10050 cut-off events. For 20600/20610 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 102779 event pairs, 625 based on Foata normal form. 7/9566 useless extension candidates. Maximal degree in co-relation 25269. Up to 2591 conditions per place. [2022-09-16 11:32:31,922 INFO L137 encePairwiseOnDemand]: 227/253 looper letters, 330 selfloop transitions, 122 changer transitions 0/648 dead transitions. [2022-09-16 11:32:31,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 648 transitions, 6359 flow [2022-09-16 11:32:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:32:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-09-16 11:32:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4991 transitions. [2022-09-16 11:32:31,926 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7306397306397306 [2022-09-16 11:32:31,926 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4991 transitions. [2022-09-16 11:32:31,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4991 transitions. [2022-09-16 11:32:31,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:32:31,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4991 transitions. [2022-09-16 11:32:31,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 184.85185185185185) internal successors, (4991), 27 states have internal predecessors, (4991), 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 11:32:31,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 253.0) internal successors, (7084), 28 states have internal predecessors, (7084), 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 11:32:31,935 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 253.0) internal successors, (7084), 28 states have internal predecessors, (7084), 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 11:32:31,935 INFO L175 Difference]: Start difference. First operand has 511 places, 514 transitions, 4090 flow. Second operand 27 states and 4991 transitions. [2022-09-16 11:32:31,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 648 transitions, 6359 flow [2022-09-16 11:32:32,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 648 transitions, 6218 flow, removed 53 selfloop flow, removed 16 redundant places. [2022-09-16 11:32:32,040 INFO L231 Difference]: Finished difference. Result has 538 places, 564 transitions, 5004 flow [2022-09-16 11:32:32,041 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=3963, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5004, PETRI_PLACES=538, PETRI_TRANSITIONS=564} [2022-09-16 11:32:32,041 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 303 predicate places. [2022-09-16 11:32:32,041 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 564 transitions, 5004 flow [2022-09-16 11:32:32,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 180.92592592592592) internal successors, (9770), 54 states have internal predecessors, (9770), 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 11:32:32,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:32:32,043 INFO L208 CegarLoopForPetriNet]: 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 11:32:32,060 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 11:32:32,255 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 11:32:32,255 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 11:32:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:32:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -5055314, now seen corresponding path program 3 times [2022-09-16 11:32:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:32:32,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302848448] [2022-09-16 11:32:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:32:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:32:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:32:33,349 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 11:32:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:32:33,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302848448] [2022-09-16 11:32:33,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302848448] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:32:33,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786194026] [2022-09-16 11:32:33,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:32:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:32:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:32:33,351 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 11:32:33,352 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 11:32:33,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 11:32:33,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:32:33,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 77 conjunts are in the unsatisfiable core [2022-09-16 11:32:33,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:32:33,546 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:32:33,546 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 11:32:33,570 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:32:33,570 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 11:32:33,657 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 11:32:33,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 11:32:33,884 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 11:32:34,075 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 11:32:34,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:34,215 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:32:34,216 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 11:32:34,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:34,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:34,348 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 11:32:34,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:34,647 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 11:32:34,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:34,731 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 11:32:34,936 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:32:34,936 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 11:32:34,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:34,973 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 11:32:34,977 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 11:32:34,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:32:35,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:35,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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_704) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:35,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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_704) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:35,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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_704) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:35,316 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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_704) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:32:35,325 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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_704) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 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 11:32:35,350 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_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int)) (or (not (<= v_ArrVal_700 (+ |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_700) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:32:35,396 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_700) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_700))) (= 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 11:32:35,411 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 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_700) (< (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_700) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 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 11:32:35,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 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_698)) (.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_700) (= .cse2 800) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_700) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:32:35,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_700) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse4 800))))) (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 11:32:35,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_700) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_700) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= 800 .cse5)))))) is different from false [2022-09-16 11:32:35,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse0 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select .cse3 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (= 800 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (select (let ((.cse5 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_700) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:32:35,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_700) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_706)) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse4))))))))) is different from false [2022-09-16 11:32:36,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_700) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_706)) .cse1) 2147483647))))))) is different from false [2022-09-16 11:32:36,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store (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_694)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse3 .cse2)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (or (= 800 .cse0) (not (<= v_ArrVal_694 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_700) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse2))) v_ArrVal_706)) .cse4) 2147483647))))))) is different from false [2022-09-16 11:32:36,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:36,509 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 336 treesize of output 221 [2022-09-16 11:32:36,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:36,521 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 1298 treesize of output 1278 [2022-09-16 11:32:36,534 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 854 treesize of output 758 [2022-09-16 11:32:36,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 760 treesize of output 720 [2022-09-16 11:32:36,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:36,567 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 1414 treesize of output 1334 [2022-09-16 11:32:36,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:36,597 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 11:32:40,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:40,504 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 318 treesize of output 298 [2022-09-16 11:32:40,816 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-09-16 11:32:41,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:41,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 11:32:41,386 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 11:32:41,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786194026] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:32:41,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:32:41,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 31] total 86 [2022-09-16 11:32:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392094226] [2022-09-16 11:32:41,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:32:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-09-16 11:32:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:32:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-09-16 11:32:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4522, Unknown=16, NotChecked=2448, Total=7482 [2022-09-16 11:32:41,393 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 253 [2022-09-16 11:32:41,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 564 transitions, 5004 flow. Second operand has 87 states, 87 states have (on average 159.02298850574712) internal successors, (13835), 87 states have internal predecessors, (13835), 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 11:32:41,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:32:41,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 253 [2022-09-16 11:32:41,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:32:43,181 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_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) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse0 3208) 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse1 .cse5)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (= 800 .cse3) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_700) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_706)) .cse2) 2147483647))))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:43,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (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_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) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (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|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse1 .cse5)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (= 800 .cse3) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_700) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_706)) .cse2) 2147483647))))))) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse8 (+ 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|) (= (select .cse0 3208) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:44,224 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|))) (and (or (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .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| 3208)))) (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|)) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse0)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse2 .cse6)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_700) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse6))) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_700) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_706)) .cse3) 2147483647))))))) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse1 3208) 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))) is different from false [2022-09-16 11:32:44,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (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|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_700) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_700) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_706)) .cse1) 2147483647))))))) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse8 .cse9 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= (select .cse10 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)) (= 0 (select .cse10 3204)))) (and (not .cse8) (not .cse11) (= (select .cse7 3208) 0) (= (select .cse7 3204) 0)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (= (select .cse12 3204) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse9 .cse11 (= (select .cse12 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 11:32:45,286 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) (let ((.cse1 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (= (select .cse0 3204) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse1 (= (select .cse0 3208) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) (and (not .cse1) (= (select .cse2 3208) 0) (= (select .cse2 3204) 0)))) (= 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_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select .cse3 .cse7)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (= 800 .cse5) (< (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_700) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_706)) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse9 .cse7))))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:45,877 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (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 ((.cse1 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and (= (select .cse0 3204) 0) (= (select .cse0 3208) 0) (not .cse1))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (= (select .cse2 3204) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (= (select .cse2 3208) 0) .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))))) (= 7 |c_~#queue~0.base|) (<= (select .cse3 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse3 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_697))) (let ((.cse4 (select .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_698)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse6 (select .cse7 .cse5))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (= 800 .cse6) (< (+ (select .cse7 .cse8) 1) v_ArrVal_700) (< (select (let ((.cse9 (select (store (store .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_700) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:46,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse0 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 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)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse6 (select .cse3 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_700) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_700) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= 800 .cse6)))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 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 11:32:48,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (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|) (= 0 (select .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_700 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_698)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse1 .cse4))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_700) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_700) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_706)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse5 800))))) (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|)))))) (<= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse6 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:54,718 INFO L130 PetriNetUnfolder]: 2326/13075 cut-off events. [2022-09-16 11:32:54,719 INFO L131 PetriNetUnfolder]: For 78864/78912 co-relation queries the response was YES. [2022-09-16 11:32:54,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41140 conditions, 13075 events. 2326/13075 cut-off events. For 78864/78912 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 141334 event pairs, 1262 based on Foata normal form. 12/12430 useless extension candidates. Maximal degree in co-relation 40898. Up to 3802 conditions per place. [2022-09-16 11:32:54,897 INFO L137 encePairwiseOnDemand]: 213/253 looper letters, 472 selfloop transitions, 118 changer transitions 0/753 dead transitions. [2022-09-16 11:32:54,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 753 transitions, 8495 flow [2022-09-16 11:32:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-09-16 11:32:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-09-16 11:32:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 9202 transitions. [2022-09-16 11:32:54,906 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6380972193329173 [2022-09-16 11:32:54,906 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 9202 transitions. [2022-09-16 11:32:54,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 9202 transitions. [2022-09-16 11:32:54,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:32:54,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 9202 transitions. [2022-09-16 11:32:54,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 161.43859649122808) internal successors, (9202), 57 states have internal predecessors, (9202), 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 11:32:54,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 253.0) internal successors, (14674), 58 states have internal predecessors, (14674), 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 11:32:54,936 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 253.0) internal successors, (14674), 58 states have internal predecessors, (14674), 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 11:32:54,936 INFO L175 Difference]: Start difference. First operand has 538 places, 564 transitions, 5004 flow. Second operand 57 states and 9202 transitions. [2022-09-16 11:32:54,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 753 transitions, 8495 flow [2022-09-16 11:32:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 753 transitions, 8159 flow, removed 151 selfloop flow, removed 6 redundant places. [2022-09-16 11:32:55,308 INFO L231 Difference]: Finished difference. Result has 607 places, 618 transitions, 5980 flow [2022-09-16 11:32:55,309 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=4810, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=5980, PETRI_PLACES=607, PETRI_TRANSITIONS=618} [2022-09-16 11:32:55,309 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 372 predicate places. [2022-09-16 11:32:55,309 INFO L495 AbstractCegarLoop]: Abstraction has has 607 places, 618 transitions, 5980 flow [2022-09-16 11:32:55,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 159.02298850574712) internal successors, (13835), 87 states have internal predecessors, (13835), 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 11:32:55,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:32:55,311 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1] [2022-09-16 11:32:55,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-16 11:32:55,528 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 11:32:55,529 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:32:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:32:55,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1387620751, now seen corresponding path program 2 times [2022-09-16 11:32:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:32:55,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937429944] [2022-09-16 11:32:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:32:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:32:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:32:55,945 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 11:32:55,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:32:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937429944] [2022-09-16 11:32:55,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937429944] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:32:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207822212] [2022-09-16 11:32:55,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:32:55,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:32:55,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:32:55,946 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 11:32:55,947 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 11:32:56,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:32:56,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:32:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 11:32:56,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:32:56,147 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:32:56,147 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 11:32:56,156 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:32:56,156 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 11:32:56,473 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 11:32:56,592 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 11:32:56,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:56,692 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 11:32:56,731 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 11:32:56,929 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:32:56,929 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 11:32:56,964 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 11:32:56,968 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 11:32:56,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:33:29,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_775 Int) (v_ArrVal_773 (Array Int Int))) (or (< (+ v_ArrVal_775 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_773) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_775) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 11:33:29,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_775 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_773) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_775) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_775 2147483648) 0))) is different from false [2022-09-16 11:33:29,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_775 Int) (v_ArrVal_770 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (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_770)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_773) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_775) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_775 2147483648) 0))) is different from false [2022-09-16 11:33:29,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:29,805 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 39 treesize of output 45 [2022-09-16 11:33:29,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:29,813 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 214 treesize of output 216 [2022-09-16 11:33:29,817 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 246 treesize of output 230 [2022-09-16 11:33:29,824 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 254 treesize of output 246 [2022-09-16 11:33:29,833 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 11:33:29,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:29,951 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 52 treesize of output 52 [2022-09-16 11:33:30,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:30,369 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 11:33:30,431 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 11:33:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207822212] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:33:30,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:33:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2022-09-16 11:33:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670580781] [2022-09-16 11:33:30,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:33:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 11:33:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:33:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 11:33:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2472, Unknown=61, NotChecked=312, Total=3080 [2022-09-16 11:33:30,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 253 [2022-09-16 11:33:30,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 618 transitions, 5980 flow. Second operand has 56 states, 56 states have (on average 171.07142857142858) internal successors, (9580), 56 states have internal predecessors, (9580), 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 11:33:30,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:33:30,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 253 [2022-09-16 11:33:30,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:33:43,933 INFO L130 PetriNetUnfolder]: 2393/14512 cut-off events. [2022-09-16 11:33:43,933 INFO L131 PetriNetUnfolder]: For 105103/105153 co-relation queries the response was YES. [2022-09-16 11:33:44,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47545 conditions, 14512 events. 2393/14512 cut-off events. For 105103/105153 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 161372 event pairs, 207 based on Foata normal form. 45/13893 useless extension candidates. Maximal degree in co-relation 47277. Up to 3039 conditions per place. [2022-09-16 11:33:44,394 INFO L137 encePairwiseOnDemand]: 219/253 looper letters, 437 selfloop transitions, 319 changer transitions 0/949 dead transitions. [2022-09-16 11:33:44,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 949 transitions, 12585 flow [2022-09-16 11:33:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-16 11:33:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-09-16 11:33:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 9744 transitions. [2022-09-16 11:33:44,400 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6877470355731226 [2022-09-16 11:33:44,400 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 9744 transitions. [2022-09-16 11:33:44,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 9744 transitions. [2022-09-16 11:33:44,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:33:44,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 9744 transitions. [2022-09-16 11:33:44,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 174.0) internal successors, (9744), 56 states have internal predecessors, (9744), 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 11:33:44,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 253.0) internal successors, (14421), 57 states have internal predecessors, (14421), 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 11:33:44,416 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 253.0) internal successors, (14421), 57 states have internal predecessors, (14421), 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 11:33:44,416 INFO L175 Difference]: Start difference. First operand has 607 places, 618 transitions, 5980 flow. Second operand 56 states and 9744 transitions. [2022-09-16 11:33:44,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 949 transitions, 12585 flow [2022-09-16 11:33:44,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 949 transitions, 12237 flow, removed 158 selfloop flow, removed 15 redundant places. [2022-09-16 11:33:44,725 INFO L231 Difference]: Finished difference. Result has 680 places, 777 transitions, 9035 flow [2022-09-16 11:33:44,725 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=5702, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=9035, PETRI_PLACES=680, PETRI_TRANSITIONS=777} [2022-09-16 11:33:44,726 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 445 predicate places. [2022-09-16 11:33:44,726 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 777 transitions, 9035 flow [2022-09-16 11:33:44,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 171.07142857142858) internal successors, (9580), 56 states have internal predecessors, (9580), 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 11:33:44,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:33:44,727 INFO L208 CegarLoopForPetriNet]: 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 11:33:44,746 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 11:33:44,945 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 11:33:44,946 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 11:33:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:33:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1542185036, now seen corresponding path program 4 times [2022-09-16 11:33:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:33:44,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817568581] [2022-09-16 11:33:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:33:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:33:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:33:46,146 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 11:33:46,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:33:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817568581] [2022-09-16 11:33:46,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817568581] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:33:46,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589326390] [2022-09-16 11:33:46,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 11:33:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:33:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:33:46,148 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 11:33:46,149 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 11:33:46,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 11:33:46,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:33:46,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 72 conjunts are in the unsatisfiable core [2022-09-16 11:33:46,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:33:46,346 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:33:46,346 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 11:33:46,383 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 11:33:46,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:33:46,521 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 11:33:46,566 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 11:33:46,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:33:47,109 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 11:33:47,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:33:47,287 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:33:47,287 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 11:33:47,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:33:47,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:33:47,464 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 11:33:47,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:47,719 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 11:33:47,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:33:47,808 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 11:33:48,017 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:33:48,017 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 11:33:48,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:48,029 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 11:33:48,033 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 11:33:48,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:34:13,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_849) |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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:34:13,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 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_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_847 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:34:13,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 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_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_847) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:34:13,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 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_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_847) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:34:13,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 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_845) .cse2 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_845 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_847))))) is different from false [2022-09-16 11:34:13,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 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_845) .cse2 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_845) (< (+ (select .cse1 .cse2) 1) v_ArrVal_847))))) is different from false [2022-09-16 11:34:13,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 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_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_845) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_847))))) is different from false [2022-09-16 11:34:13,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 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_844)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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 .cse3 v_ArrVal_845) .cse2 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_847) (< (+ (select .cse1 .cse3) 1) v_ArrVal_845))))) is different from false [2022-09-16 11:34:13,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse0 (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_844)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:34:13,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_845) .cse1 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_847) (< (+ (select .cse0 .cse2) 1) v_ArrVal_845) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse3 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-09-16 11:34:13,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_845) .cse2 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_845) (< (+ (select .cse3 .cse2) 1) v_ArrVal_847))))))) is different from false [2022-09-16 11:34:13,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_847) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse3))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_845))))))) is different from false [2022-09-16 11:34:13,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_845) .cse1 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 .cse1))))))))) is different from false [2022-09-16 11:34:14,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_839 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse5 (store (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_839)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_845) .cse4 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse3 .cse4))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_847) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse4))) (not (<= v_ArrVal_839 0)))))))) is different from false [2022-09-16 11:34:14,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:34:14,458 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 270 treesize of output 185 [2022-09-16 11:34:14,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:34:14,470 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 644 treesize of output 640 [2022-09-16 11:34:14,485 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 524 treesize of output 500 [2022-09-16 11:34:14,514 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 11:34:14,525 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 375 treesize of output 343 [2022-09-16 11:34:14,595 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 11:34:15,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:34:15,197 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 97 treesize of output 109 [2022-09-16 11:34:15,312 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-09-16 11:34:15,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:34:15,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 114 [2022-09-16 11:34:16,035 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 11:34:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589326390] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:34:16,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:34:16,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 11:34:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283030864] [2022-09-16 11:34:16,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:34:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 11:34:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:34:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 11:34:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=4365, Unknown=41, NotChecked=2086, Total=6972 [2022-09-16 11:34:16,041 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:34:16,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 777 transitions, 9035 flow. Second operand has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:34:16,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:34:16,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:34:16,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:34:17,815 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_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_845) .cse1 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 .cse1))))))))) (= |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 .cse6 3208) 0) (= 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)) (= (select .cse6 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:34:18,562 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (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) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_845) .cse1 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 .cse1))))))))) (= |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 .cse6 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 .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 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|) (= (select .cse6 3208) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:34:19,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204)) (.cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (.cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))) (.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse9 (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse2 .cse1) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_845) .cse4 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_847) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse6) 2147483647) (< (+ (select .cse3 .cse6) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse7 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse5 .cse4))))))))) (or .cse9 (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) .cse10)) .cse10 (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0) (= 7 |c_~#queue~0.base|) (<= (select .cse11 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse11 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse2 3208) 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 .cse9 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208))))) is different from false [2022-09-16 11:34:19,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse12 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (let ((.cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse7 (not .cse12)) (.cse8 (not .cse10)) (.cse9 (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|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_845) .cse1 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 .cse1))))))))) .cse6 (= 7 |c_~#queue~0.base|) (or (and .cse7 .cse8 (= (select .cse9 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse6 .cse10 (= (select .cse11 3208) 0)) (and .cse12 .cse6 (= (select .cse13 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208)))) (<= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse9 (+ 3208 |c_~#queue~0.offset|)) 0) (or (and .cse12 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= 0 (select .cse13 3204))) (and (= (select .cse11 3204) 0) .cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) (and .cse7 .cse8 (= (select .cse9 3204) 0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-16 11:34:20,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (let ((.cse6 (not .cse8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse7 (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_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_847) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse4 .cse3))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_845))))))) (or (and .cse6 (= (select .cse7 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse8 (= (select .cse9 3208) 0))) (or (and .cse6 (= (select .cse7 3204) 0)) (and (= (select .cse9 3204) 0) .cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 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 11:34:21,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (not .cse1))) (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|) (or (and (= (select .cse0 3204) 0) .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) (and (= (select .cse2 3204) 0) .cse3)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse4 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse4 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (= (select .cse0 3208) 0) .cse1) (and (= (select .cse2 3208) 0) .cse3)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_842))) (let ((.cse6 (select .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select (store (store .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_845) .cse7 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse5 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse6 .cse7))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_845) (< (+ (select .cse8 .cse7) 1) v_ArrVal_847)))))))))) is different from false [2022-09-16 11:34:23,148 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (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|) (= (select .cse0 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse0 3208) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_844)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 .cse4 v_ArrVal_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_847) (< (+ (select .cse2 .cse4) 1) v_ArrVal_845) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse5 (+ |c_~#queue~0.offset| 3204))))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:34:25,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_844 Int)) (let ((.cse0 (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_844)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_845) .cse3 v_ArrVal_847)) |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_845) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_847) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (= |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 .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (<= (select .cse5 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse5 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:34:27,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| 7)) (.cse4 (+ 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|) (<= (* (select .cse3 .cse4) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse3 .cse1) 1) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| (select .cse5 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (select .cse0 .cse4) 1) (<= (* (select .cse2 3204) 4) 4) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 0))) is different from false [2022-09-16 11:34:28,161 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|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_849) |c_~#queue~0.base|))) (or (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_851) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (* (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 11:34:35,726 INFO L130 PetriNetUnfolder]: 2783/15978 cut-off events. [2022-09-16 11:34:35,726 INFO L131 PetriNetUnfolder]: For 227344/227486 co-relation queries the response was YES. [2022-09-16 11:34:36,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63855 conditions, 15978 events. 2783/15978 cut-off events. For 227344/227486 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 180205 event pairs, 1559 based on Foata normal form. 29/15280 useless extension candidates. Maximal degree in co-relation 63557. Up to 4985 conditions per place. [2022-09-16 11:34:36,447 INFO L137 encePairwiseOnDemand]: 216/253 looper letters, 603 selfloop transitions, 147 changer transitions 0/938 dead transitions. [2022-09-16 11:34:36,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 938 transitions, 13523 flow [2022-09-16 11:34:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 11:34:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-09-16 11:34:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6956 transitions. [2022-09-16 11:34:36,452 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6546207415772634 [2022-09-16 11:34:36,452 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6956 transitions. [2022-09-16 11:34:36,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6956 transitions. [2022-09-16 11:34:36,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:34:36,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6956 transitions. [2022-09-16 11:34:36,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 165.61904761904762) internal successors, (6956), 42 states have internal predecessors, (6956), 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 11:34:36,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 253.0) internal successors, (10879), 43 states have internal predecessors, (10879), 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 11:34:36,464 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 253.0) internal successors, (10879), 43 states have internal predecessors, (10879), 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 11:34:36,464 INFO L175 Difference]: Start difference. First operand has 680 places, 777 transitions, 9035 flow. Second operand 42 states and 6956 transitions. [2022-09-16 11:34:36,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 938 transitions, 13523 flow [2022-09-16 11:34:37,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 938 transitions, 12565 flow, removed 417 selfloop flow, removed 11 redundant places. [2022-09-16 11:34:37,232 INFO L231 Difference]: Finished difference. Result has 733 places, 830 transitions, 9873 flow [2022-09-16 11:34:37,233 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=8392, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=9873, PETRI_PLACES=733, PETRI_TRANSITIONS=830} [2022-09-16 11:34:37,235 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 498 predicate places. [2022-09-16 11:34:37,235 INFO L495 AbstractCegarLoop]: Abstraction has has 733 places, 830 transitions, 9873 flow [2022-09-16 11:34:37,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:34:37,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:34:37,237 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1] [2022-09-16 11:34:37,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-16 11:34:37,455 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 11:34:37,455 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:34:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:34:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1249541965, now seen corresponding path program 3 times [2022-09-16 11:34:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:34:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877715983] [2022-09-16 11:34:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:34:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:34:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:34:37,965 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 11:34:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:34:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877715983] [2022-09-16 11:34:37,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877715983] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:34:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448385020] [2022-09-16 11:34:37,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:34:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:34:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:34:37,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:34:37,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 11:34:38,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 11:34:38,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:34:38,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 11:34:38,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:34:38,173 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:34:38,174 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 11:34:38,181 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:34:38,181 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 11:34:38,499 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 11:34:38,683 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 11:34:38,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:34:38,775 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 11:34:38,918 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 11:34:39,081 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:34:39,082 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 11:34:39,136 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 11:34:39,140 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 11:34:39,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:35:01,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_918) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_920) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< v_ArrVal_920 |c_t1Thread1of1ForFork0_#t~nondet51#1|))) is different from false [2022-09-16 11:35:01,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int)) (or (< (+ v_ArrVal_920 2147483648) 0) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_918) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_920) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:35:01,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int)) (or (< (+ v_ArrVal_920 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_918) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_920) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 11:35:01,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_915 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int)) (or (< 0 (+ (select (store (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_915)) |c_~#stored_elements~0.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_918) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_920) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_920 2147483648) 0))) is different from false [2022-09-16 11:35:02,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:02,046 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 39 treesize of output 45 [2022-09-16 11:35:02,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:02,054 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 108 treesize of output 112 [2022-09-16 11:35:02,058 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 118 treesize of output 110 [2022-09-16 11:35:02,064 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 66 treesize of output 62 [2022-09-16 11:35:02,080 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 11:35:02,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:02,091 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 82 treesize of output 82 [2022-09-16 11:35:02,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:02,530 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 11:35:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-09-16 11:35:02,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448385020] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:35:02,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:35:02,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2022-09-16 11:35:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455118539] [2022-09-16 11:35:02,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:35:02,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 11:35:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:35:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 11:35:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2408, Unknown=43, NotChecked=412, Total=3080 [2022-09-16 11:35:02,592 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 253 [2022-09-16 11:35:02,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 830 transitions, 9873 flow. Second operand has 56 states, 56 states have (on average 171.07142857142858) internal successors, (9580), 56 states have internal predecessors, (9580), 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 11:35:02,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:35:02,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 253 [2022-09-16 11:35:02,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:35:27,672 WARN L233 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 52 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 11:35:36,007 INFO L130 PetriNetUnfolder]: 3215/20085 cut-off events. [2022-09-16 11:35:36,008 INFO L131 PetriNetUnfolder]: For 297262/297416 co-relation queries the response was YES. [2022-09-16 11:35:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76862 conditions, 20085 events. 3215/20085 cut-off events. For 297262/297416 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 244375 event pairs, 1192 based on Foata normal form. 75/19270 useless extension candidates. Maximal degree in co-relation 76536. Up to 3943 conditions per place. [2022-09-16 11:35:37,117 INFO L137 encePairwiseOnDemand]: 227/253 looper letters, 529 selfloop transitions, 358 changer transitions 0/1082 dead transitions. [2022-09-16 11:35:37,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 1082 transitions, 16409 flow [2022-09-16 11:35:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 11:35:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-09-16 11:35:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6449 transitions. [2022-09-16 11:35:37,121 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6889221237047324 [2022-09-16 11:35:37,121 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6449 transitions. [2022-09-16 11:35:37,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6449 transitions. [2022-09-16 11:35:37,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:35:37,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6449 transitions. [2022-09-16 11:35:37,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 174.2972972972973) internal successors, (6449), 37 states have internal predecessors, (6449), 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 11:35:37,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 253.0) internal successors, (9614), 38 states have internal predecessors, (9614), 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 11:35:37,134 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 253.0) internal successors, (9614), 38 states have internal predecessors, (9614), 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 11:35:37,134 INFO L175 Difference]: Start difference. First operand has 733 places, 830 transitions, 9873 flow. Second operand 37 states and 6449 transitions. [2022-09-16 11:35:37,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 1082 transitions, 16409 flow [2022-09-16 11:35:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 755 places, 1082 transitions, 15862 flow, removed 259 selfloop flow, removed 14 redundant places. [2022-09-16 11:35:37,949 INFO L231 Difference]: Finished difference. Result has 770 places, 959 transitions, 12854 flow [2022-09-16 11:35:37,950 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=9508, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=12854, PETRI_PLACES=770, PETRI_TRANSITIONS=959} [2022-09-16 11:35:37,950 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 535 predicate places. [2022-09-16 11:35:37,950 INFO L495 AbstractCegarLoop]: Abstraction has has 770 places, 959 transitions, 12854 flow [2022-09-16 11:35:37,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 171.07142857142858) internal successors, (9580), 56 states have internal predecessors, (9580), 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 11:35:37,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:35:37,952 INFO L208 CegarLoopForPetriNet]: 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 11:35:37,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-16 11:35:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:35:38,169 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:35:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:35:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -406483632, now seen corresponding path program 5 times [2022-09-16 11:35:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:35:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163326040] [2022-09-16 11:35:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:35:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:35:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:35:39,818 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 11:35:39,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:35:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163326040] [2022-09-16 11:35:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163326040] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:35:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357944232] [2022-09-16 11:35:39,818 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-16 11:35:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:35:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:35:39,820 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:35:39,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 11:35:39,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:35:39,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:35:39,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 62 conjunts are in the unsatisfiable core [2022-09-16 11:35:39,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:35:40,065 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:35:40,065 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 11:35:40,099 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:35:40,099 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 11:35:40,246 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 11:35:40,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:35:40,646 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 11:35:41,141 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 11:35:41,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:35:41,313 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:35:41,314 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 11:35:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:35:41,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:35:41,558 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 11:35:41,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:41,863 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 11:35:41,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:35:41,974 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 11:35:42,248 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:35:42,249 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 11:35:42,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:35:42,264 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 11:35:42,269 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 11:35:42,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:36:14,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:36:14,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_993 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:36:14,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_993) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:36:14,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_993))))) is different from false [2022-09-16 11:36:14,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_990) .cse2 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_990 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_993))))) is different from false [2022-09-16 11:36:14,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_990) .cse2 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_990) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_993))))) is different from false [2022-09-16 11:36:14,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int 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_990) .cse3 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_990) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_993))))) is different from false [2022-09-16 11:36:14,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int 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_988)) (.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_990) .cse3 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_990) (< (+ (select .cse1 .cse3) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:36:14,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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 .cse3 v_ArrVal_990) .cse2 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_993) (< (+ (select .cse1 .cse3) 1) v_ArrVal_990))))))) is different from false [2022-09-16 11:36:14,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse4 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_990) .cse2 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_990) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse4 .cse2))))))))) is different from false [2022-09-16 11:36:14,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_988)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_990) (< (+ (select .cse3 .cse1) 1) v_ArrVal_993))))))) is different from false [2022-09-16 11:36:15,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_990) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse4 .cse1))))))))) is different from false [2022-09-16 11:36:15,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse4 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_990))))))) is different from false [2022-09-16 11:36:16,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store (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_984)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_993) (not (<= v_ArrVal_984 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_990) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse4) 2147483647))))))) is different from false [2022-09-16 11:36:16,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:16,058 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 270 treesize of output 185 [2022-09-16 11:36:16,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:16,075 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 1320 treesize of output 1308 [2022-09-16 11:36:16,092 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 1090 treesize of output 1042 [2022-09-16 11:36:16,113 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 792 treesize of output 728 [2022-09-16 11:36:16,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:16,138 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 1116 treesize of output 1092 [2022-09-16 11:36:16,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:16,178 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 11:36:16,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:16,860 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 450 treesize of output 462 [2022-09-16 11:36:18,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:36:18,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 11:36:18,915 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 11:36:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357944232] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:36:18,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:36:18,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 29] total 82 [2022-09-16 11:36:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031270889] [2022-09-16 11:36:18,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:36:18,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-16 11:36:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:36:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-16 11:36:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=4234, Unknown=43, NotChecked=2058, Total=6806 [2022-09-16 11:36:18,924 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:36:18,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 959 transitions, 12854 flow. Second operand has 83 states, 83 states have (on average 163.04819277108433) internal successors, (13533), 83 states have internal predecessors, (13533), 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 11:36:18,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:36:18,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:36:18,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:36:21,634 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (not .cse2))) (and (or (and .cse0 (= (select .cse1 3208) 0)) (and (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_~#id2~0#1.base|) 3208) 0))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_990) .cse4 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse5 .cse4))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse7 .cse4))) (< (+ (select .cse3 .cse6) 1) v_ArrVal_990))))))) (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) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse1 3204) 0) (<= |c_~#stored_elements~0.base| 6) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse2) (and (not .cse9) .cse0) (and .cse9 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0))))))) is different from false [2022-09-16 11:36:22,347 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.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_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse4 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_990))))))) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse6 3208) 0) (= (select .cse7 3204) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (let ((.cse9 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse10 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse8 .cse9 (= .cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (not .cse10) (not .cse9) (= .cse6 .cse7)) (and .cse10 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse8))) (<= (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)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:36:23,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse4 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (let ((.cse2 (select .cse7 .cse1)) (.cse5 (not .cse4)) (.cse6 (not .cse0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (or (and .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) (= .cse2 (select .cse3 .cse1))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1)) .cse4 (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and .cse5 .cse6 (= .cse7 .cse8))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= .cse2 0) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 3204))) (let ((.cse11 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_990) .cse10 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse10) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse11 .cse10))) (< (select (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse12) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse13 .cse10))) (< (+ (select .cse9 .cse12) 1) v_ArrVal_990))))))) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (let ((.cse15 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (and .cse5 .cse6 (= (select .cse8 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse15 .cse0 (= (select .cse3 3208) 0)) (and .cse4 .cse15 (= (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))))) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select .cse8 (+ 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 11:36:23,652 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse12 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse6 (not .cse12)) (.cse7 (not .cse10)) (.cse8 (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_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse4 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_990))))))) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (let ((.cse9 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (and .cse6 .cse7 (= (select .cse8 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse9 .cse10 (= (select .cse11 3208) 0)) (and .cse12 .cse9 (= (select .cse13 3208) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3208))))) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse8 (+ 3208 |c_~#queue~0.offset|)) 0) (or (and .cse12 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= 0 (select .cse13 3204))) (and (= (select .cse11 3204) 0) .cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) (and .cse6 .cse7 (= (select .cse8 3204) 0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-16 11:36:24,312 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (let ((.cse6 (not .cse8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_990) .cse1 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_990) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse4 .cse1))))))))) (= |c_~#queue~0.offset| 0) (or (and .cse6 (= (select .cse7 3208) 0)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse8 (= (select .cse9 3208) 0))) (or (and .cse6 (= (select .cse7 3204) 0)) (and (= (select .cse9 3204) 0) .cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 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 11:36:25,043 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (not .cse1))) (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|) (or (and (= (select .cse0 3204) 0) .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) (and (= (select .cse2 3204) 0) .cse3)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse4 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse4 (+ 3208 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) (= (select .cse0 3208) 0) .cse1) (and (= (select .cse2 3208) 0) .cse3)) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse5 (select .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_988)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (select (store (store .cse10 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_990) .cse6 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse7 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse8 .cse9) 1) v_ArrVal_990) (< (+ (select .cse8 .cse6) 1) v_ArrVal_993)))))))))) is different from false [2022-09-16 11:36:25,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse2 (not .cse3)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.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 ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (and (= 0 (select .cse0 .cse1)) .cse2) (and .cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) (= (select .cse4 .cse1) 0)))) (= 7 |c_~#queue~0.base|) (<= (select .cse5 (+ |c_~#queue~0.offset| 3204)) 0) (let ((.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (and (= (select .cse4 .cse6) 0) .cse3 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse6))) (and .cse2 (= (select .cse0 .cse6) 0)))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_987))) (let ((.cse11 (select .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse8 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select (store (store .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse10 v_ArrVal_990) .cse9 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse8 .cse9) 1) v_ArrVal_993) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse7 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse8 .cse10) 1) v_ArrVal_990) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse11 .cse9))))))))) (<= (select .cse5 (+ 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 11:36:27,719 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (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|) (= 0 (select .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_990 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_988 Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse5 v_ArrVal_990) .cse4 v_ArrVal_993)) |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_993) (< (+ (select .cse3 .cse5) 1) v_ArrVal_990))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:36:30,498 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_995 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (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) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (* (select .cse4 .cse5) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse4 .cse2) 1) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (= 7 |c_~#queue~0.base|) (<= (select .cse1 .cse5) 1) (<= (* (select .cse3 3204) 4) 4) (<= (select .cse3 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 0))) is different from false [2022-09-16 11:36:30,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_995 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_994) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_995) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse1 3208) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse1 3204) 4) 4) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:36:43,931 INFO L130 PetriNetUnfolder]: 3803/22984 cut-off events. [2022-09-16 11:36:43,931 INFO L131 PetriNetUnfolder]: For 408768/408973 co-relation queries the response was YES. [2022-09-16 11:36:44,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93461 conditions, 22984 events. 3803/22984 cut-off events. For 408768/408973 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 285613 event pairs, 2241 based on Foata normal form. 43/21949 useless extension candidates. Maximal degree in co-relation 93125. Up to 6909 conditions per place. [2022-09-16 11:36:44,505 INFO L137 encePairwiseOnDemand]: 217/253 looper letters, 771 selfloop transitions, 192 changer transitions 0/1159 dead transitions. [2022-09-16 11:36:44,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 1159 transitions, 18715 flow [2022-09-16 11:36:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-09-16 11:36:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-09-16 11:36:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 7773 transitions. [2022-09-16 11:36:44,511 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6536876629383568 [2022-09-16 11:36:44,511 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 7773 transitions. [2022-09-16 11:36:44,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 7773 transitions. [2022-09-16 11:36:44,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:36:44,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 7773 transitions. [2022-09-16 11:36:44,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 165.38297872340425) internal successors, (7773), 47 states have internal predecessors, (7773), 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 11:36:44,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:36:44,530 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:36:44,530 INFO L175 Difference]: Start difference. First operand has 770 places, 959 transitions, 12854 flow. Second operand 47 states and 7773 transitions. [2022-09-16 11:36:44,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 1159 transitions, 18715 flow [2022-09-16 11:36:46,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 804 places, 1159 transitions, 18212 flow, removed 149 selfloop flow, removed 12 redundant places. [2022-09-16 11:36:46,225 INFO L231 Difference]: Finished difference. Result has 822 places, 1034 transitions, 14789 flow [2022-09-16 11:36:46,226 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=12497, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=14789, PETRI_PLACES=822, PETRI_TRANSITIONS=1034} [2022-09-16 11:36:46,226 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 587 predicate places. [2022-09-16 11:36:46,226 INFO L495 AbstractCegarLoop]: Abstraction has has 822 places, 1034 transitions, 14789 flow [2022-09-16 11:36:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 163.04819277108433) internal successors, (13533), 83 states have internal predecessors, (13533), 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 11:36:46,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:36:46,229 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1] [2022-09-16 11:36:46,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-09-16 11:36:46,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-09-16 11:36:46,456 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:36:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:36:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 82644719, now seen corresponding path program 4 times [2022-09-16 11:36:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:36:46,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424149255] [2022-09-16 11:36:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:36:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:36:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:36:47,014 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 11:36:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:36:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424149255] [2022-09-16 11:36:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424149255] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:36:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332080818] [2022-09-16 11:36:47,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 11:36:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:36:47,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:36:47,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:36:47,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 11:36:47,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 11:36:47,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:36:47,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:36:47,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:36:47,668 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 11:36:47,801 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 24 [2022-09-16 11:36:47,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:36:47,881 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 11:36:48,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:36:48,038 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 11:36:48,193 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:36:48,193 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 11:36:48,247 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 11:36:48,251 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 11:36:48,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:37:02,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< v_ArrVal_1064 |c_t1Thread1of1ForFork0_~value~0#1|) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:37:04,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< v_ArrVal_1064 |c_t1Thread1of1ForFork0_#t~nondet51#1|) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:37:06,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< (+ v_ArrVal_1064 2147483648) 0) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:37:06,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1061 (Array Int Int))) (or (< 0 (+ (select (store (select (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1061))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1062))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_1064 2147483648) 0))) is different from false [2022-09-16 11:37:06,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (v_ArrVal_1059 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1061 (Array Int Int))) (or (< (+ v_ArrVal_1064 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (let ((.cse0 (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_1059)) |c_~#stored_elements~0.base| v_ArrVal_1061))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1062))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 11:37:06,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:06,604 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 62 treesize of output 53 [2022-09-16 11:37:06,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:06,620 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 346 treesize of output 354 [2022-09-16 11:37:06,626 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 610 treesize of output 582 [2022-09-16 11:37:06,636 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 11:37:06,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:06,725 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 754 treesize of output 726 [2022-09-16 11:37:07,208 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 734 treesize of output 702 [2022-09-16 11:37:07,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:07,261 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 626 treesize of output 610 [2022-09-16 11:37:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-09-16 11:37:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332080818] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:37:07,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:37:07,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 11:37:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52281757] [2022-09-16 11:37:07,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:37:07,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:37:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:37:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:37:07,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2133, Unknown=21, NotChecked=490, Total=2862 [2022-09-16 11:37:07,899 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 253 [2022-09-16 11:37:07,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 1034 transitions, 14789 flow. Second operand has 54 states, 54 states have (on average 180.92592592592592) internal successors, (9770), 54 states have internal predecessors, (9770), 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 11:37:07,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:37:07,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 253 [2022-09-16 11:37:07,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:37:08,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= 0 (+ 2147483649 |c_t1Thread1of1ForFork0_enqueue_#t~post38#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|)) (<= 0 |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (v_ArrVal_1059 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1061 (Array Int Int))) (or (< (+ v_ArrVal_1064 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (let ((.cse0 (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_1059)) |c_~#stored_elements~0.base| v_ArrVal_1061))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1062))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:37:08,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.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|)) (<= 0 |c_~#queue~0.offset|) (= |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|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (v_ArrVal_1059 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1061 (Array Int Int))) (or (< (+ v_ArrVal_1064 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (let ((.cse0 (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_1059)) |c_~#stored_elements~0.base| v_ArrVal_1061))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1062))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)))))) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:37:08,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not .cse0) (<= 0 (+ (select .cse1 3208) 2147483648))))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1061 (Array Int Int))) (or (< 0 (+ (select (store (select (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1061))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1062))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_1064 2147483648) 0))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:37:10,075 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0) (and (not .cse0) (<= 0 (+ (select .cse1 3208) 2147483648))))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< (+ v_ArrVal_1064 2147483648) 0) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) (<= 0 (+ (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|))) is different from false [2022-09-16 11:37:10,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (<= 0 (+ |c_t1Thread1of1ForFork0_#t~nondet51#1| 2147483648)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (not .cse0) .cse1 (<= 0 (+ (select .cse2 3208) 2147483648))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 .cse1))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< v_ArrVal_1064 |c_t1Thread1of1ForFork0_#t~nondet51#1|) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) (= 7 |c_~#queue~0.base|) .cse1)) is different from false [2022-09-16 11:37:11,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (<= 0 (+ |c_t1Thread1of1ForFork0_~value~0#1| 2147483648)))) (and (let ((.cse1 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse0 (not .cse1) (<= 0 (+ (select .cse2 3208) 2147483648))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 .cse1))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) .cse0 (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1062 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1064 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< v_ArrVal_1064 |c_t1Thread1of1ForFork0_~value~0#1|) (< 0 (+ (select (store (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_1062)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1064) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-09-16 11:37:23,661 INFO L130 PetriNetUnfolder]: 3627/22863 cut-off events. [2022-09-16 11:37:23,661 INFO L131 PetriNetUnfolder]: For 485486/485711 co-relation queries the response was YES. [2022-09-16 11:37:24,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96129 conditions, 22863 events. 3627/22863 cut-off events. For 485486/485711 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 286203 event pairs, 1605 based on Foata normal form. 113/21916 useless extension candidates. Maximal degree in co-relation 95777. Up to 6916 conditions per place. [2022-09-16 11:37:24,653 INFO L137 encePairwiseOnDemand]: 230/253 looper letters, 756 selfloop transitions, 174 changer transitions 0/1136 dead transitions. [2022-09-16 11:37:24,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 1136 transitions, 19298 flow [2022-09-16 11:37:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 11:37:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-09-16 11:37:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5889 transitions. [2022-09-16 11:37:24,657 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7273962450592886 [2022-09-16 11:37:24,657 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5889 transitions. [2022-09-16 11:37:24,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5889 transitions. [2022-09-16 11:37:24,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:37:24,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5889 transitions. [2022-09-16 11:37:24,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 184.03125) internal successors, (5889), 32 states have internal predecessors, (5889), 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 11:37:24,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 253.0) internal successors, (8349), 33 states have internal predecessors, (8349), 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 11:37:24,666 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 253.0) internal successors, (8349), 33 states have internal predecessors, (8349), 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 11:37:24,666 INFO L175 Difference]: Start difference. First operand has 822 places, 1034 transitions, 14789 flow. Second operand 32 states and 5889 transitions. [2022-09-16 11:37:24,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 1136 transitions, 19298 flow [2022-09-16 11:37:25,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 837 places, 1136 transitions, 18640 flow, removed 311 selfloop flow, removed 16 redundant places. [2022-09-16 11:37:25,886 INFO L231 Difference]: Finished difference. Result has 845 places, 1062 transitions, 15263 flow [2022-09-16 11:37:25,887 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=14137, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=15263, PETRI_PLACES=845, PETRI_TRANSITIONS=1062} [2022-09-16 11:37:25,887 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 610 predicate places. [2022-09-16 11:37:25,888 INFO L495 AbstractCegarLoop]: Abstraction has has 845 places, 1062 transitions, 15263 flow [2022-09-16 11:37:25,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 180.92592592592592) internal successors, (9770), 54 states have internal predecessors, (9770), 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 11:37:25,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:37:25,889 INFO L208 CegarLoopForPetriNet]: 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 11:37:25,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-09-16 11:37:26,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-09-16 11:37:26,098 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:37:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:37:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1234427108, now seen corresponding path program 6 times [2022-09-16 11:37:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:37:26,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237038464] [2022-09-16 11:37:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:37:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:37:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:37:45,265 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 11:37:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:37:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237038464] [2022-09-16 11:37:45,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237038464] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:37:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844068614] [2022-09-16 11:37:45,268 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-09-16 11:37:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:37:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:37:45,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:37:45,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 11:37:45,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-09-16 11:37:45,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:37:45,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 11:37:45,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:37:45,490 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:37:45,491 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 11:37:45,525 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:37:45,526 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 11:37:45,614 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 11:37:45,646 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 11:37:45,837 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 11:37:46,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:37:46,193 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:37:46,194 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 11:37:46,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:37:46,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:37:46,346 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 11:37:46,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:46,567 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 11:37:46,641 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 11:37:46,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:37:46,714 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 11:37:46,912 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:37:46,913 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 11:37:46,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:37:46,923 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 11:37:46,926 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 11:37:46,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:38:17,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:38:17,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 11:38:18,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1137 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_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1137 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 11:38:18,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1137 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_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1137)))) is different from false [2022-09-16 11:38:18,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1137 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 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:38:18,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 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_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1135 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-09-16 11:38:18,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 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_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_1135))))) is different from false [2022-09-16 11:38:18,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 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_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 11:38:18,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 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_1133)) (.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_1135) .cse3 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1135) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1137))))) is different from false [2022-09-16 11:38:18,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:38:18,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse4 v_ArrVal_1135) .cse2 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse3 .cse2))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1135)))))) is different from false [2022-09-16 11:38:18,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1135) .cse3 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse4 .cse3))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1137)))))) is different from false [2022-09-16 11:38:18,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1135) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse4 .cse1))))))))) is different from false [2022-09-16 11:38:18,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| 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_1130)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (not (<= v_ArrVal_1130 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse3) 2147483647))))))) is different from false [2022-09-16 11:38:18,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:38:18,955 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 11:38:18,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:38:18,966 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 842 treesize of output 836 [2022-09-16 11:38:18,974 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 744 treesize of output 712 [2022-09-16 11:38:18,982 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 792 treesize of output 728 [2022-09-16 11:38:18,994 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 325 treesize of output 313 [2022-09-16 11:38:19,025 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 11:38:19,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:38:19,392 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 169 treesize of output 165 [2022-09-16 11:38:19,454 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-09-16 11:38:19,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:38:19,709 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 11:38:19,774 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 11:38:19,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844068614] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:38:19,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:38:19,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 11:38:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177878647] [2022-09-16 11:38:19,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:38:19,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 11:38:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:38:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 11:38:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4322, Unknown=46, NotChecked=2086, Total=6972 [2022-09-16 11:38:19,780 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:38:19,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 1062 transitions, 15263 flow. Second operand has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:38:19,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:38:19,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:38:19,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:38:21,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (<= (select .cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1135) .cse2 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1135) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse5 .cse2))))))))) (= |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|)) (= .cse7 .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|) (= .cse7 .cse8) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse8 (+ 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 11:38:21,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse9 .cse0))) (let ((.cse1 (store .cse9 .cse10 0))) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse11 (store .cse1 .cse2 0))) (let ((.cse12 (@diff .cse11 .cse0)) (.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|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (= .cse0 .cse1) (<= .cse2 3200)) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1135) .cse4 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse3 .cse4))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1135) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse7 .cse4))))))))) (or (= .cse0 .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) (= .cse0 (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) (= .cse0 .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 11:38:22,951 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) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1135) .cse2 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1135) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse5 .cse2))))))))) (= |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 11:38:23,868 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|)) (= |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|))) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1131))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1135) .cse4 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse3 .cse4))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1135) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse7 .cse4))))))))) (= |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 11:38:25,061 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 (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1135) .cse3 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse4 .cse3))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1137)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (or .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 11:38:27,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse11 (store .cse12 .cse13 0))) (let ((.cse18 (@diff .cse11 .cse0))) (let ((.cse16 (store .cse11 .cse18 0))) (let ((.cse17 (@diff .cse16 .cse0))) (let ((.cse1 (store .cse16 .cse17 0))) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (@diff .cse1 .cse0)) (.cse9 (= .cse0 .cse1))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= .cse0 (store .cse1 .cse2 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|) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse7 v_ArrVal_1135) .cse5 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1137) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select .cse6 .cse5))) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1135)))))) (<= (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 (= .cse0 .cse11)) (or (= (select .cse12 .cse13) 0) .cse14) (or .cse15 (= .cse0 .cse16))) (and .cse10 .cse15 (<= .cse2 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 11:38:29,160 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (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|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_1133 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1133)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1135) .cse1 v_ArrVal_1137)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1137) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) (= 0 (select .cse4 .cse5)) (= 7 |c_~#queue~0.base|) (or .cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse5))) (<= (select .cse7 (+ |c_~#queue~0.offset| 3204)) 0) (<= (select .cse7 (+ 3208 |c_~#queue~0.offset|)) 0) (= (select .cse4 .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 11:38:36,323 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)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.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))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse6 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (let ((.cse8 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (<= (select .cse7 3208) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse8 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)) (let ((.cse9 (select .cse7 3204))) (or (<= 803 .cse9) (<= .cse9 801))))) (and (<= (select .cse2 3208) 1) (not .cse8) (let ((.cse10 (select .cse2 3204))) (or (<= .cse10 801) (<= 803 .cse10)))))) (<= (select .cse4 .cse1) 1) (= 7 |c_~#queue~0.base|) (or .cse11 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (<= (select .cse0 .cse5) 1) (<= (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse5)) .cse11) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:38:37,577 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_1141 Int) (v_ArrVal_1139 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1139) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_1141) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 3208 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (let ((.cse2 (select .cse0 3204))) (or (<= .cse2 801) (<= 803 .cse2))))) is different from false [2022-09-16 11:39:00,912 INFO L130 PetriNetUnfolder]: 4645/28630 cut-off events. [2022-09-16 11:39:00,912 INFO L131 PetriNetUnfolder]: For 711563/711788 co-relation queries the response was YES. [2022-09-16 11:39:02,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121892 conditions, 28630 events. 4645/28630 cut-off events. For 711563/711788 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 374300 event pairs, 2818 based on Foata normal form. 57/27252 useless extension candidates. Maximal degree in co-relation 121529. Up to 8366 conditions per place. [2022-09-16 11:39:02,889 INFO L137 encePairwiseOnDemand]: 218/253 looper letters, 886 selfloop transitions, 162 changer transitions 0/1250 dead transitions. [2022-09-16 11:39:02,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 1250 transitions, 20598 flow [2022-09-16 11:39:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-09-16 11:39:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-09-16 11:39:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 7824 transitions. [2022-09-16 11:39:02,910 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6579766209738458 [2022-09-16 11:39:02,911 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 7824 transitions. [2022-09-16 11:39:02,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 7824 transitions. [2022-09-16 11:39:02,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:39:02,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 7824 transitions. [2022-09-16 11:39:02,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 166.46808510638297) internal successors, (7824), 47 states have internal predecessors, (7824), 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 11:39:02,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:39:02,924 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 253.0) internal successors, (12144), 48 states have internal predecessors, (12144), 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 11:39:02,924 INFO L175 Difference]: Start difference. First operand has 845 places, 1062 transitions, 15263 flow. Second operand 47 states and 7824 transitions. [2022-09-16 11:39:02,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 1250 transitions, 20598 flow [2022-09-16 11:39:04,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 1250 transitions, 19999 flow, removed 228 selfloop flow, removed 10 redundant places. [2022-09-16 11:39:04,886 INFO L231 Difference]: Finished difference. Result has 895 places, 1128 transitions, 16192 flow [2022-09-16 11:39:04,887 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=14628, PETRI_DIFFERENCE_MINUEND_PLACES=835, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=16192, PETRI_PLACES=895, PETRI_TRANSITIONS=1128} [2022-09-16 11:39:04,901 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 660 predicate places. [2022-09-16 11:39:04,902 INFO L495 AbstractCegarLoop]: Abstraction has has 895 places, 1128 transitions, 16192 flow [2022-09-16 11:39:04,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 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 11:39:04,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:39:04,904 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1] [2022-09-16 11:39:04,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-09-16 11:39:05,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-09-16 11:39:05,104 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:39:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:39:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash -677413069, now seen corresponding path program 5 times [2022-09-16 11:39:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:39:05,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407746382] [2022-09-16 11:39:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:39:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:39:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:39:05,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 11:39:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:39:05,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407746382] [2022-09-16 11:39:05,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407746382] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:39:05,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738731454] [2022-09-16 11:39:05,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-16 11:39:05,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:39:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:39:05,829 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:39:05,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-09-16 11:39:05,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:39:05,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:39:05,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:39:05,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:39:06,592 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 11:39:06,733 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 24 [2022-09-16 11:39:06,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:39:06,818 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 11:39:07,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:39:07,036 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 11:39:07,144 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:39:07,145 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 11:39:07,185 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 11:39:07,190 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 11:39:07,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:39:16,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< 0 (+ 2147483650 (select (store (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_1207)) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)))) (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))) is different from false [2022-09-16 11:39:17,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_~value~0#1|))) is different from false [2022-09-16 11:39:19,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_#t~nondet51#1|) (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:39:21,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:39:21,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1206))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1207))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-09-16 11:39:21,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1204 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ (select (store (select (let ((.cse0 (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_1204)) |c_~#stored_elements~0.base| v_ArrVal_1206))) (store .cse0 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1207))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:39:21,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:39:21,965 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 62 treesize of output 53 [2022-09-16 11:39:21,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:39:21,983 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 230 treesize of output 244 [2022-09-16 11:39:21,989 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 488 treesize of output 464 [2022-09-16 11:39:22,009 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 11:39:22,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:39:22,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 366 [2022-09-16 11:39:22,271 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 362 treesize of output 346 [2022-09-16 11:39:22,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:39:22,308 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 671 treesize of output 651 [2022-09-16 11:39:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:39:23,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738731454] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:39:23,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:39:23,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 11:39:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992230050] [2022-09-16 11:39:23,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:39:23,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:39:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:39:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:39:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2047, Unknown=17, NotChecked=582, Total=2862 [2022-09-16 11:39:23,089 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 253 [2022-09-16 11:39:23,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 1128 transitions, 16192 flow. Second operand has 54 states, 54 states have (on average 180.92592592592592) internal successors, (9770), 54 states have internal predecessors, (9770), 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 11:39:23,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:39:23,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 253 [2022-09-16 11:39:23,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:39:23,632 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= 0 (+ 2147483649 |c_t1Thread1of1ForFork0_enqueue_#t~post38#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|)) (<= 0 |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse0))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1204 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ (select (store (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_1204)) |c_~#stored_elements~0.base| v_ArrVal_1206))) (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_1207))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:39:23,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 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|)) (<= 0 |c_~#queue~0.offset|) (= |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|) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse0))) (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1204 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ (select (store (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_1204)) |c_~#stored_elements~0.base| v_ArrVal_1206))) (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_1207))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:39:24,074 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not .cse0) (<= 0 (+ (select .cse1 3208) 2147483648))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1206))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1207))) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)))))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:39:24,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0) (and (not .cse0) (<= 0 (+ (select .cse1 3208) 2147483648))))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< (+ v_ArrVal_1209 2147483648) 0) (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) (= 7 |c_~#queue~0.base|))) is different from false [2022-09-16 11:39:25,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (<= 0 (+ |c_t1Thread1of1ForFork0_#t~nondet51#1| 2147483648)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (not .cse0) .cse1 (<= 0 (+ (select .cse2 3208) 2147483648))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 .cse1))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) .cse1 (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_#t~nondet51#1|) (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-09-16 11:39:26,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (<= 0 (+ |c_t1Thread1of1ForFork0_~value~0#1| 2147483648)))) (and (let ((.cse1 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse0 (not .cse1) (<= 0 (+ (select .cse2 3208) 2147483648))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse0 .cse1))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= 0 (+ (select .cse2 (+ 3208 |c_~#queue~0.offset|)) 2147483648)) .cse0 (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< 0 (+ (select (store (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_1207)) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_~value~0#1|))))) is different from false [2022-09-16 11:39:27,122 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~x#1| 2147483648))) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and .cse0 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (let ((.cse1 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (or (and .cse0 (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 3208) 2147483648)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3208)) .cse1) (and .cse0 (<= 0 (+ 2147483648 (select .cse2 3208))) (not .cse1)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 7) (<= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (<= 0 (+ (select .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) 2147483648)) (<= 0 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_1207 Int)) (or (< 0 (+ 2147483650 (select (store (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_1207)) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1209) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)))) (< v_ArrVal_1209 |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))))) is different from false