./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 04:42:18,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:42:18,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:42:18,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:42:18,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:42:18,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:42:18,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:42:18,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:42:18,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:42:18,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:42:18,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:42:18,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:42:18,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:42:18,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:42:18,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:42:18,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:42:18,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:42:18,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:42:18,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:42:18,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:42:18,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:42:18,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:42:18,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:42:18,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:42:18,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:42:18,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:42:18,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:42:18,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:42:18,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:42:18,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:42:18,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:42:18,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:42:18,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:42:18,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:42:18,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:42:18,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:42:18,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:42:18,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:42:18,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:42:18,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:42:18,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:42:18,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-09-01 04:42:18,411 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:42:18,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:42:18,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:42:18,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:42:18,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:42:18,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:42:18,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:42:18,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:42:18,416 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:42:18,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:42:18,417 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:42:18,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:42:18,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:42:18,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:42:18,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 04:42:18,419 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:42:18,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 04:42:18,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:42:18,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:42:18,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:42:18,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:18,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:42:18,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 04:42:18,421 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:42:18,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:42:18,421 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:42:18,421 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 04:42:18,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:42:18,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:42:18,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:42:18,714 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:42:18,714 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:42:18,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-09-01 04:42:19,685 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:42:19,926 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:42:19,927 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-01 04:42:19,954 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d591ebd46/ec7bfcf3e0174dc79adc85b688c1f4f8/FLAG92308ed4e [2023-09-01 04:42:19,977 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d591ebd46/ec7bfcf3e0174dc79adc85b688c1f4f8 [2023-09-01 04:42:19,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:42:19,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:42:19,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:19,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:42:19,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:42:19,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:19" (1/1) ... [2023-09-01 04:42:19,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6249f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:19, skipping insertion in model container [2023-09-01 04:42:19,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:19" (1/1) ... [2023-09-01 04:42:19,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:42:20,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:42:20,334 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-01 04:42:20,336 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-01 04:42:20,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:20,346 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:42:20,388 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-01 04:42:20,390 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-01 04:42:20,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:20,481 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:42:20,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20 WrapperNode [2023-09-01 04:42:20,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:20,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:20,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:42:20,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:42:20,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,517 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-09-01 04:42:20,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:20,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:42:20,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:42:20,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:42:20,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,560 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:42:20,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:42:20,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:42:20,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:42:20,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:20,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:20,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 04:42:20,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 04:42:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 04:42:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 04:42:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 04:42:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 04:42:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:42:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 04:42:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:42:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:42:20,622 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 04:42:20,752 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:42:20,753 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:42:21,066 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:42:21,073 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:42:21,075 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 04:42:21,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:21 BoogieIcfgContainer [2023-09-01 04:42:21,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:42:21,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:42:21,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:42:21,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:42:21,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:42:19" (1/3) ... [2023-09-01 04:42:21,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b516ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:21, skipping insertion in model container [2023-09-01 04:42:21,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20" (2/3) ... [2023-09-01 04:42:21,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b516ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:21, skipping insertion in model container [2023-09-01 04:42:21,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:21" (3/3) ... [2023-09-01 04:42:21,091 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-01 04:42:21,097 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 04:42:21,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:42:21,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-09-01 04:42:21,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:42:21,200 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:42:21,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:21,320 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-09-01 04:42:21,320 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:42:21,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 236 events. 13/236 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:21,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:21,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:21,340 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:42:21,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:21,350 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:21,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:21,393 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-09-01 04:42:21,393 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:21,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 227 events. 13/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:21,403 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-09-01 04:42:28,019 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-09-01 04:42:28,019 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-09-01 04:42:28,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:42:28,033 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@3e6f9d22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:42:28,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-09-01 04:42:28,037 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-09-01 04:42:28,037 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:28,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:28,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:28,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:28,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-09-01 04:42:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690868735] [2023-09-01 04:42:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:29,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:29,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690868735] [2023-09-01 04:42:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690868735] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669315416] [2023-09-01 04:42:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:29,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:29,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:29,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:29,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:29,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:29,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:29,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:30,117 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-09-01 04:42:30,117 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-09-01 04:42:30,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2384 events. 1447/2384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11890 event pairs, 1050 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 4563. Up to 2313 conditions per place. [2023-09-01 04:42:30,127 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-09-01 04:42:30,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-09-01 04:42:30,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-09-01 04:42:30,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-09-01 04:42:30,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-09-01 04:42:30,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:30,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-09-01 04:42:30,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:30,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:30,163 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:30,164 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-09-01 04:42:30,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:30,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:30,170 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:30,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-09-01 04:42:30,174 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-09-01 04:42:30,174 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:30,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:30,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:30,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 04:42:30,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:30,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-09-01 04:42:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406097889] [2023-09-01 04:42:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406097889] [2023-09-01 04:42:30,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406097889] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:30,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:30,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272371358] [2023-09-01 04:42:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:30,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:31,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:31,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:31,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:31,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:31,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:32,093 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-09-01 04:42:32,094 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-09-01 04:42:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3185 events. 1909/3185 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17548 event pairs, 356 based on Foata normal form. 0/2452 useless extension candidates. Maximal degree in co-relation 4972. Up to 2371 conditions per place. [2023-09-01 04:42:32,105 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-09-01 04:42:32,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-09-01 04:42:32,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-09-01 04:42:32,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-09-01 04:42:32,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-09-01 04:42:32,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:32,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-09-01 04:42:32,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,115 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,116 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-09-01 04:42:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:32,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:32,121 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:32,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-09-01 04:42:32,121 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-09-01 04:42:32,122 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:32,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:32,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 04:42:32,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:32,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-09-01 04:42:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056141258] [2023-09-01 04:42:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056141258] [2023-09-01 04:42:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056141258] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963225342] [2023-09-01 04:42:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:32,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:32,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:32,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:32,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:33,217 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-09-01 04:42:33,217 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-09-01 04:42:33,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 3425 events. 2048/3425 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19054 event pairs, 410 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6211. Up to 2404 conditions per place. [2023-09-01 04:42:33,232 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-09-01 04:42:33,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-09-01 04:42:33,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-09-01 04:42:33,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-09-01 04:42:33,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-09-01 04:42:33,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:33,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-09-01 04:42:33,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,242 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-09-01 04:42:33,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:33,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:33,250 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:33,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-09-01 04:42:33,251 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-09-01 04:42:33,251 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:33,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:33,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:33,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 04:42:33,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:33,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-09-01 04:42:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622709965] [2023-09-01 04:42:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622709965] [2023-09-01 04:42:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622709965] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:33,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160603637] [2023-09-01 04:42:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:33,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:42:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:33,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:42:33,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 04:42:33,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-09-01 04:42:33,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:33,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-09-01 04:42:33,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:33,903 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-09-01 04:42:33,904 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-09-01 04:42:33,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5521 events. 3360/5521 cut-off events. For 2431/2471 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33384 event pairs, 1505 based on Foata normal form. 40/4211 useless extension candidates. Maximal degree in co-relation 10283. Up to 3250 conditions per place. [2023-09-01 04:42:33,929 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-09-01 04:42:33,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 04:42:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 04:42:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-09-01 04:42:33,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-09-01 04:42:33,931 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-09-01 04:42:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-09-01 04:42:33,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:33,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-09-01 04:42:33,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,936 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,937 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-09-01 04:42:33,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:33,942 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:33,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-09-01 04:42:33,943 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-09-01 04:42:33,943 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:33,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:33,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:33,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 04:42:33,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:33,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-09-01 04:42:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148039784] [2023-09-01 04:42:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148039784] [2023-09-01 04:42:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148039784] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:34,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908125696] [2023-09-01 04:42:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:34,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:34,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:34,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:34,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:34,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:34,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:35,315 INFO L130 PetriNetUnfolder]: 3404/5688 cut-off events. [2023-09-01 04:42:35,316 INFO L131 PetriNetUnfolder]: For 2514/2522 co-relation queries the response was YES. [2023-09-01 04:42:35,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13911 conditions, 5688 events. 3404/5688 cut-off events. For 2514/2522 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34241 event pairs, 2258 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 9525. Up to 5474 conditions per place. [2023-09-01 04:42:35,343 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-09-01 04:42:35,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 554 flow [2023-09-01 04:42:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-09-01 04:42:35,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974016332590943 [2023-09-01 04:42:35,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-09-01 04:42:35,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-09-01 04:42:35,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:35,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-09-01 04:42:35,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,352 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,352 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 6 states and 1340 transitions. [2023-09-01 04:42:35,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 554 flow [2023-09-01 04:42:35,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:35,359 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 404 flow [2023-09-01 04:42:35,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-09-01 04:42:35,361 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-09-01 04:42:35,361 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 404 flow [2023-09-01 04:42:35,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:35,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:35,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 04:42:35,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:35,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-09-01 04:42:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967449818] [2023-09-01 04:42:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967449818] [2023-09-01 04:42:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967449818] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233867078] [2023-09-01 04:42:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:35,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:35,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:36,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:36,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 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) [2023-09-01 04:42:36,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:36,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:36,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:37,642 INFO L130 PetriNetUnfolder]: 3697/6100 cut-off events. [2023-09-01 04:42:37,643 INFO L131 PetriNetUnfolder]: For 1866/1896 co-relation queries the response was YES. [2023-09-01 04:42:37,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 6100 events. 3697/6100 cut-off events. For 1866/1896 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37242 event pairs, 626 based on Foata normal form. 94/5216 useless extension candidates. Maximal degree in co-relation 11952. Up to 4451 conditions per place. [2023-09-01 04:42:37,687 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 141 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2023-09-01 04:42:37,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 168 transitions, 969 flow [2023-09-01 04:42:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1393 transitions. [2023-09-01 04:42:37,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170749814402376 [2023-09-01 04:42:37,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1393 transitions. [2023-09-01 04:42:37,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1393 transitions. [2023-09-01 04:42:37,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:37,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1393 transitions. [2023-09-01 04:42:37,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.16666666666666) internal successors, (1393), 6 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,705 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 404 flow. Second operand 6 states and 1393 transitions. [2023-09-01 04:42:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 168 transitions, 969 flow [2023-09-01 04:42:37,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:37,734 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 456 flow [2023-09-01 04:42:37,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-09-01 04:42:37,736 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-09-01 04:42:37,736 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 456 flow [2023-09-01 04:42:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 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) [2023-09-01 04:42:37,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:37,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:37,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 04:42:37,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:37,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1523080992, now seen corresponding path program 1 times [2023-09-01 04:42:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168878290] [2023-09-01 04:42:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:37,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:37,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:37,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168878290] [2023-09-01 04:42:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168878290] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019889156] [2023-09-01 04:42:37,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:37,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:38,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:38,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:38,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:38,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:38,629 INFO L130 PetriNetUnfolder]: 3933/6511 cut-off events. [2023-09-01 04:42:38,630 INFO L131 PetriNetUnfolder]: For 3371/3393 co-relation queries the response was YES. [2023-09-01 04:42:38,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 6511 events. 3933/6511 cut-off events. For 3371/3393 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 39424 event pairs, 722 based on Foata normal form. 94/5591 useless extension candidates. Maximal degree in co-relation 12673. Up to 4119 conditions per place. [2023-09-01 04:42:38,663 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 126 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2023-09-01 04:42:38,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 939 flow [2023-09-01 04:42:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1170 transitions. [2023-09-01 04:42:38,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211581291759465 [2023-09-01 04:42:38,667 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1170 transitions. [2023-09-01 04:42:38,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1170 transitions. [2023-09-01 04:42:38,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:38,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1170 transitions. [2023-09-01 04:42:38,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,673 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 456 flow. Second operand 5 states and 1170 transitions. [2023-09-01 04:42:38,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 939 flow [2023-09-01 04:42:38,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 907 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:38,698 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 497 flow [2023-09-01 04:42:38,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=497, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-09-01 04:42:38,699 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-09-01 04:42:38,699 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 497 flow [2023-09-01 04:42:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:38,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:38,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 04:42:38,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:38,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-09-01 04:42:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350389440] [2023-09-01 04:42:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350389440] [2023-09-01 04:42:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350389440] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:38,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:38,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694987026] [2023-09-01 04:42:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:38,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:38,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:42:38,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:38,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:42:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:38,883 INFO L130 PetriNetUnfolder]: 716/1428 cut-off events. [2023-09-01 04:42:38,884 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-09-01 04:42:38,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1428 events. 716/1428 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8101 event pairs, 457 based on Foata normal form. 64/1344 useless extension candidates. Maximal degree in co-relation 2930. Up to 761 conditions per place. [2023-09-01 04:42:38,888 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-09-01 04:42:38,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 595 flow [2023-09-01 04:42:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-09-01 04:42:38,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-09-01 04:42:38,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-09-01 04:42:38,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-09-01 04:42:38,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:38,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-09-01 04:42:38,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,894 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 497 flow. Second operand 3 states and 725 transitions. [2023-09-01 04:42:38,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 595 flow [2023-09-01 04:42:38,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 573 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:38,897 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:38,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-09-01 04:42:38,899 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-09-01 04:42:38,899 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:38,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:38,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 04:42:38,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:38,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -240537722, now seen corresponding path program 1 times [2023-09-01 04:42:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175437967] [2023-09-01 04:42:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175437967] [2023-09-01 04:42:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175437967] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:38,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:38,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314739659] [2023-09-01 04:42:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:38,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:38,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:38,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:42:38,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:38,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:42:38,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:39,045 INFO L130 PetriNetUnfolder]: 528/1058 cut-off events. [2023-09-01 04:42:39,046 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-09-01 04:42:39,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1058 events. 528/1058 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5246 event pairs, 390 based on Foata normal form. 8/948 useless extension candidates. Maximal degree in co-relation 2085. Up to 780 conditions per place. [2023-09-01 04:42:39,050 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 75 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-09-01 04:42:39,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 560 flow [2023-09-01 04:42:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-09-01 04:42:39,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-09-01 04:42:39,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-09-01 04:42:39,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-09-01 04:42:39,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:39,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-09-01 04:42:39,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,056 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 3 states and 732 transitions. [2023-09-01 04:42:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 560 flow [2023-09-01 04:42:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 552 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:39,060 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:39,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-09-01 04:42:39,062 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-09-01 04:42:39,062 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:39,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:39,062 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:39,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 04:42:39,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:39,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-09-01 04:42:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302700287] [2023-09-01 04:42:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:39,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302700287] [2023-09-01 04:42:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302700287] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:42:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945580012] [2023-09-01 04:42:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:39,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:42:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:39,336 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) [2023-09-01 04:42:39,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 04:42:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:39,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-09-01 04:42:39,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:42:39,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:39,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:39,542 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:42:39,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:42:39,555 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:42:39,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-01 04:42:39,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:42:39,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:42:39,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:42:39,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:39,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:42:40,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:42:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:40,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:42:40,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_373) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-09-01 04:42:40,280 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2023-09-01 04:42:40,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373))))) is different from false [2023-09-01 04:42:42,450 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_369 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_35|)) v_ArrVal_369)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_372) .cse3 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) .cse1) 2147483650)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_373) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ v_ArrVal_372 2147483648) 0)))))) is different from false [2023-09-01 04:42:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:42:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945580012] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:42:42,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:42:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-09-01 04:42:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379060736] [2023-09-01 04:42:42,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:42:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 04:42:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 04:42:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=487, Unknown=14, NotChecked=204, Total=870 [2023-09-01 04:42:42,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-09-01 04:42:42,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:42,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:42,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-09-01 04:42:42,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:52,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:42:54,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:42:55,525 INFO L130 PetriNetUnfolder]: 1225/2416 cut-off events. [2023-09-01 04:42:55,525 INFO L131 PetriNetUnfolder]: For 770/770 co-relation queries the response was YES. [2023-09-01 04:42:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2416 events. 1225/2416 cut-off events. For 770/770 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14582 event pairs, 542 based on Foata normal form. 1/2130 useless extension candidates. Maximal degree in co-relation 4415. Up to 808 conditions per place. [2023-09-01 04:42:55,534 INFO L137 encePairwiseOnDemand]: 424/449 looper letters, 145 selfloop transitions, 74 changer transitions 4/229 dead transitions. [2023-09-01 04:42:55,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 229 transitions, 1355 flow [2023-09-01 04:42:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-01 04:42:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-09-01 04:42:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4798 transitions. [2023-09-01 04:42:55,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39577662294811516 [2023-09-01 04:42:55,544 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4798 transitions. [2023-09-01 04:42:55,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4798 transitions. [2023-09-01 04:42:55,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:55,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4798 transitions. [2023-09-01 04:42:55,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 177.7037037037037) internal successors, (4798), 27 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,566 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,566 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 27 states and 4798 transitions. [2023-09-01 04:42:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 229 transitions, 1355 flow [2023-09-01 04:42:55,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 229 transitions, 1350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:55,572 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 877 flow [2023-09-01 04:42:55,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=877, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2023-09-01 04:42:55,573 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2023-09-01 04:42:55,573 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 877 flow [2023-09-01 04:42:55,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:55,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:55,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 04:42:55,779 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,SelfDestructingSolverStorable9 [2023-09-01 04:42:55,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:55,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 1 times [2023-09-01 04:42:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487421766] [2023-09-01 04:42:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487421766] [2023-09-01 04:42:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487421766] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:42:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779851348] [2023-09-01 04:42:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:56,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:42:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:56,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:42:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 04:42:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:56,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-09-01 04:42:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:42:56,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:56,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:56,669 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:42:56,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:42:56,686 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:42:56,686 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:42:56,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:42:56,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:42:57,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:42:57,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:57,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:42:57,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:42:57,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:42:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:57,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:42:57,590 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-09-01 04:43:02,894 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_474) .cse2 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_474) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_476))))) is different from false [2023-09-01 04:43:02,918 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_474) .cse3 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_474) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_476))))) is different from false [2023-09-01 04:43:02,964 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_474 Int) (v_ArrVal_471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 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_471)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_474) .cse2 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_476) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_474))))) is different from false [2023-09-01 04:43:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:43:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779851348] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:09,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-09-01 04:43:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312368392] [2023-09-01 04:43:09,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:09,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 04:43:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 04:43:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=684, Unknown=17, NotChecked=244, Total=1190 [2023-09-01 04:43:09,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:43:09,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 877 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:09,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:09,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:43:09,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:17,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:43:19,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:43:21,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:24,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:26,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:28,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:30,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:32,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:40,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:45,915 INFO L130 PetriNetUnfolder]: 2610/5171 cut-off events. [2023-09-01 04:43:45,915 INFO L131 PetriNetUnfolder]: For 3473/3513 co-relation queries the response was YES. [2023-09-01 04:43:45,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14926 conditions, 5171 events. 2610/5171 cut-off events. For 3473/3513 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 37292 event pairs, 863 based on Foata normal form. 0/4672 useless extension candidates. Maximal degree in co-relation 14079. Up to 1997 conditions per place. [2023-09-01 04:43:45,944 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 278 selfloop transitions, 105 changer transitions 4/393 dead transitions. [2023-09-01 04:43:45,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 393 transitions, 2861 flow [2023-09-01 04:43:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-01 04:43:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-09-01 04:43:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5487 transitions. [2023-09-01 04:43:45,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39420935412026725 [2023-09-01 04:43:45,970 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5487 transitions. [2023-09-01 04:43:45,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5487 transitions. [2023-09-01 04:43:45,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:45,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5487 transitions. [2023-09-01 04:43:45,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 177.0) internal successors, (5487), 31 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:46,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:46,008 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:46,008 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 877 flow. Second operand 31 states and 5487 transitions. [2023-09-01 04:43:46,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 393 transitions, 2861 flow [2023-09-01 04:43:46,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 393 transitions, 2674 flow, removed 75 selfloop flow, removed 11 redundant places. [2023-09-01 04:43:46,037 INFO L231 Difference]: Finished difference. Result has 159 places, 199 transitions, 1531 flow [2023-09-01 04:43:46,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1531, PETRI_PLACES=159, PETRI_TRANSITIONS=199} [2023-09-01 04:43:46,038 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 102 predicate places. [2023-09-01 04:43:46,038 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 199 transitions, 1531 flow [2023-09-01 04:43:46,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:46,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:46,040 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:46,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 04:43:46,246 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,SelfDestructingSolverStorable10 [2023-09-01 04:43:46,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:43:46,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 444195113, now seen corresponding path program 1 times [2023-09-01 04:43:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278070085] [2023-09-01 04:43:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278070085] [2023-09-01 04:43:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278070085] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:43:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917531027] [2023-09-01 04:43:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:43:46,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:43:46,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 04:43:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:46,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 74 conjunts are in the unsatisfiable core [2023-09-01 04:43:46,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:43:46,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:46,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:46,761 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:43:46,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:43:46,777 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:43:46,778 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:43:46,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:43:46,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:43:47,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-09-01 04:43:47,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:43:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:47,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:43:47,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:43:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:47,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:43:47,467 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))) is different from false [2023-09-01 04:43:47,482 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_579)))) is different from false [2023-09-01 04:43:47,546 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_579)))))) is different from false [2023-09-01 04:43:47,580 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< v_ArrVal_576 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2023-09-01 04:43:47,606 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ v_ArrVal_576 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|))))))))) is different from false [2023-09-01 04:43:47,632 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_575) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_576 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))) is different from false [2023-09-01 04:43:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:43:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917531027] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:47,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-09-01 04:43:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11317876] [2023-09-01 04:43:47,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:47,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 04:43:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:47,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 04:43:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=518, Unknown=20, NotChecked=330, Total=1056 [2023-09-01 04:43:47,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 449 [2023-09-01 04:43:47,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 199 transitions, 1531 flow. Second operand has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:47,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:47,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 449 [2023-09-01 04:43:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:59,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:44:17,477 INFO L130 PetriNetUnfolder]: 3765/7370 cut-off events. [2023-09-01 04:44:17,477 INFO L131 PetriNetUnfolder]: For 29677/30105 co-relation queries the response was YES. [2023-09-01 04:44:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30636 conditions, 7370 events. 3765/7370 cut-off events. For 29677/30105 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 56060 event pairs, 1204 based on Foata normal form. 84/6769 useless extension candidates. Maximal degree in co-relation 30226. Up to 2344 conditions per place. [2023-09-01 04:44:17,524 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 285 selfloop transitions, 149 changer transitions 3/443 dead transitions. [2023-09-01 04:44:17,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 443 transitions, 4457 flow [2023-09-01 04:44:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-01 04:44:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-09-01 04:44:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5449 transitions. [2023-09-01 04:44:17,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39147927293627416 [2023-09-01 04:44:17,530 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5449 transitions. [2023-09-01 04:44:17,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5449 transitions. [2023-09-01 04:44:17,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:17,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5449 transitions. [2023-09-01 04:44:17,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 175.7741935483871) internal successors, (5449), 31 states have internal predecessors, (5449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:17,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:17,549 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:17,549 INFO L175 Difference]: Start difference. First operand has 159 places, 199 transitions, 1531 flow. Second operand 31 states and 5449 transitions. [2023-09-01 04:44:17,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 443 transitions, 4457 flow [2023-09-01 04:44:17,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 443 transitions, 4204 flow, removed 102 selfloop flow, removed 8 redundant places. [2023-09-01 04:44:17,598 INFO L231 Difference]: Finished difference. Result has 191 places, 260 transitions, 2407 flow [2023-09-01 04:44:17,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2407, PETRI_PLACES=191, PETRI_TRANSITIONS=260} [2023-09-01 04:44:17,598 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 134 predicate places. [2023-09-01 04:44:17,598 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 260 transitions, 2407 flow [2023-09-01 04:44:17,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:17,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:17,600 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:17,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:17,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:17,805 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:17,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 2 times [2023-09-01 04:44:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620135840] [2023-09-01 04:44:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620135840] [2023-09-01 04:44:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620135840] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183021573] [2023-09-01 04:44:18,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:44:18,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:18,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:18,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:18,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 04:44:18,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:44:18,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:44:18,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 76 conjunts are in the unsatisfiable core [2023-09-01 04:44:18,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:18,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:18,747 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:44:18,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:44:18,772 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:44:18,772 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:44:18,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-09-01 04:44:18,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-09-01 04:44:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-09-01 04:44:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:19,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-09-01 04:44:19,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-09-01 04:44:19,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-09-01 04:44:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:19,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:19,326 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-09-01 04:44:19,460 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_681))))) is different from false [2023-09-01 04:44:19,476 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_681)))))) is different from false [2023-09-01 04:44:19,509 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse3 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_681) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_679)))))) is different from false [2023-09-01 04:44:19,531 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_679) .cse4 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_679) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_681) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-09-01 04:44:19,555 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_679) .cse1 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_681) (< (+ (select .cse0 .cse2) 1) v_ArrVal_679) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-09-01 04:44:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:44:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183021573] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:23,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-09-01 04:44:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010766008] [2023-09-01 04:44:23,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 04:44:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 04:44:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=589, Unknown=17, NotChecked=354, Total=1190 [2023-09-01 04:44:23,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:44:23,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 260 transitions, 2407 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:23,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:23,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:44:23,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:34,948 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:44:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:44:39,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:44:39,030 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_681)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-09-01 04:44:39,536 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_685 Int) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))) is different from false [2023-09-01 04:44:41,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:42,896 INFO L130 PetriNetUnfolder]: 4240/8272 cut-off events. [2023-09-01 04:44:42,896 INFO L131 PetriNetUnfolder]: For 124155/125045 co-relation queries the response was YES. [2023-09-01 04:44:42,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47814 conditions, 8272 events. 4240/8272 cut-off events. For 124155/125045 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 64307 event pairs, 1584 based on Foata normal form. 20/7519 useless extension candidates. Maximal degree in co-relation 47278. Up to 4590 conditions per place. [2023-09-01 04:44:42,949 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 266 selfloop transitions, 130 changer transitions 3/405 dead transitions. [2023-09-01 04:44:42,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 405 transitions, 5440 flow [2023-09-01 04:44:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-09-01 04:44:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-09-01 04:44:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3885 transitions. [2023-09-01 04:44:42,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932982385098198 [2023-09-01 04:44:42,956 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3885 transitions. [2023-09-01 04:44:42,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3885 transitions. [2023-09-01 04:44:42,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:42,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3885 transitions. [2023-09-01 04:44:42,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 176.5909090909091) internal successors, (3885), 22 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:42,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 449.0) internal successors, (10327), 23 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:42,970 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 449.0) internal successors, (10327), 23 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:42,970 INFO L175 Difference]: Start difference. First operand has 191 places, 260 transitions, 2407 flow. Second operand 22 states and 3885 transitions. [2023-09-01 04:44:42,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 405 transitions, 5440 flow [2023-09-01 04:44:43,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 405 transitions, 4962 flow, removed 189 selfloop flow, removed 15 redundant places. [2023-09-01 04:44:43,054 INFO L231 Difference]: Finished difference. Result has 206 places, 307 transitions, 3150 flow [2023-09-01 04:44:43,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3150, PETRI_PLACES=206, PETRI_TRANSITIONS=307} [2023-09-01 04:44:43,055 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 149 predicate places. [2023-09-01 04:44:43,056 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 307 transitions, 3150 flow [2023-09-01 04:44:43,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:43,057 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:43,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:43,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:43,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:43,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -682370779, now seen corresponding path program 1 times [2023-09-01 04:44:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900460963] [2023-09-01 04:44:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900460963] [2023-09-01 04:44:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900460963] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:43,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986565494] [2023-09-01 04:44:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:43,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:43,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:43,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 04:44:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:43,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2023-09-01 04:44:43,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:43,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-09-01 04:44:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:43,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-09-01 04:44:43,934 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:44:43,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-09-01 04:44:43,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-09-01 04:44:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:43,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:44,037 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_768 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_768)) .cse1))))) is different from false [2023-09-01 04:44:44,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:44,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-09-01 04:44:44,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:44,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2023-09-01 04:44:44,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-09-01 04:44:44,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-09-01 04:44:44,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:44,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-09-01 04:44:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986565494] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:44,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-09-01 04:44:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418136476] [2023-09-01 04:44:44,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:44,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-09-01 04:44:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-09-01 04:44:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=1, NotChecked=42, Total=552 [2023-09-01 04:44:44,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 449 [2023-09-01 04:44:44,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 307 transitions, 3150 flow. Second operand has 24 states, 24 states have (on average 178.25) internal successors, (4278), 24 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:44,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:44,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 449 [2023-09-01 04:44:44,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:47,072 INFO L130 PetriNetUnfolder]: 6496/12849 cut-off events. [2023-09-01 04:44:47,072 INFO L131 PetriNetUnfolder]: For 349791/349991 co-relation queries the response was YES. [2023-09-01 04:44:47,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87273 conditions, 12849 events. 6496/12849 cut-off events. For 349791/349991 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 108184 event pairs, 2334 based on Foata normal form. 104/11821 useless extension candidates. Maximal degree in co-relation 85517. Up to 4278 conditions per place. [2023-09-01 04:44:47,182 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 418 selfloop transitions, 192 changer transitions 4/620 dead transitions. [2023-09-01 04:44:47,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 620 transitions, 8585 flow [2023-09-01 04:44:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:44:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:44:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3381 transitions. [2023-09-01 04:44:47,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41833704528582033 [2023-09-01 04:44:47,186 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3381 transitions. [2023-09-01 04:44:47,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3381 transitions. [2023-09-01 04:44:47,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:47,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3381 transitions. [2023-09-01 04:44:47,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 187.83333333333334) internal successors, (3381), 18 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:47,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 449.0) internal successors, (8531), 19 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:47,195 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 449.0) internal successors, (8531), 19 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:47,195 INFO L175 Difference]: Start difference. First operand has 206 places, 307 transitions, 3150 flow. Second operand 18 states and 3381 transitions. [2023-09-01 04:44:47,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 620 transitions, 8585 flow [2023-09-01 04:44:47,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 620 transitions, 7411 flow, removed 506 selfloop flow, removed 12 redundant places. [2023-09-01 04:44:47,489 INFO L231 Difference]: Finished difference. Result has 216 places, 394 transitions, 4150 flow [2023-09-01 04:44:47,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4150, PETRI_PLACES=216, PETRI_TRANSITIONS=394} [2023-09-01 04:44:47,490 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 159 predicate places. [2023-09-01 04:44:47,490 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 394 transitions, 4150 flow [2023-09-01 04:44:47,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 178.25) internal successors, (4278), 24 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:47,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:47,491 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:47,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:47,696 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,SelfDestructingSolverStorable13 [2023-09-01 04:44:47,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:47,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash 321388709, now seen corresponding path program 1 times [2023-09-01 04:44:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207884759] [2023-09-01 04:44:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:48,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207884759] [2023-09-01 04:44:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207884759] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603065438] [2023-09-01 04:44:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:48,217 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:48,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 04:44:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:48,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 50 conjunts are in the unsatisfiable core [2023-09-01 04:44:48,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:48,335 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:44:48,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-09-01 04:44:48,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-09-01 04:44:48,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:48,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-09-01 04:44:48,654 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:44:48,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-09-01 04:44:48,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-09-01 04:44:48,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-09-01 04:44:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:48,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:48,764 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-09-01 04:44:48,768 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (v_ArrVal_863 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_861)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483650))) is different from false [2023-09-01 04:44:49,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:49,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 67 [2023-09-01 04:44:49,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:49,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 112 [2023-09-01 04:44:49,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2023-09-01 04:44:49,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2023-09-01 04:44:49,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-09-01 04:44:49,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:49,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 62 [2023-09-01 04:44:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:44:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603065438] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:49,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-09-01 04:44:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866114511] [2023-09-01 04:44:49,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 04:44:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:49,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 04:44:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=630, Unknown=9, NotChecked=106, Total=870 [2023-09-01 04:44:49,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:44:49,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 394 transitions, 4150 flow. Second operand has 30 states, 30 states have (on average 174.9) internal successors, (5247), 30 states have internal predecessors, (5247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:49,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:49,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:44:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:52,776 INFO L130 PetriNetUnfolder]: 7251/14265 cut-off events. [2023-09-01 04:44:52,777 INFO L131 PetriNetUnfolder]: For 353979/356277 co-relation queries the response was YES. [2023-09-01 04:44:52,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95346 conditions, 14265 events. 7251/14265 cut-off events. For 353979/356277 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 116817 event pairs, 2837 based on Foata normal form. 208/13134 useless extension candidates. Maximal degree in co-relation 93568. Up to 4373 conditions per place. [2023-09-01 04:44:52,890 INFO L137 encePairwiseOnDemand]: 436/449 looper letters, 358 selfloop transitions, 173 changer transitions 3/540 dead transitions. [2023-09-01 04:44:52,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 540 transitions, 7095 flow [2023-09-01 04:44:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 04:44:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 04:44:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2975 transitions. [2023-09-01 04:44:52,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4141146993318486 [2023-09-01 04:44:52,894 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2975 transitions. [2023-09-01 04:44:52,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2975 transitions. [2023-09-01 04:44:52,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:52,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2975 transitions. [2023-09-01 04:44:52,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 185.9375) internal successors, (2975), 16 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:52,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 449.0) internal successors, (7633), 17 states have internal predecessors, (7633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:52,901 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 449.0) internal successors, (7633), 17 states have internal predecessors, (7633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:52,901 INFO L175 Difference]: Start difference. First operand has 216 places, 394 transitions, 4150 flow. Second operand 16 states and 2975 transitions. [2023-09-01 04:44:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 540 transitions, 7095 flow [2023-09-01 04:44:53,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 540 transitions, 6960 flow, removed 56 selfloop flow, removed 6 redundant places. [2023-09-01 04:44:53,107 INFO L231 Difference]: Finished difference. Result has 227 places, 401 transitions, 4597 flow [2023-09-01 04:44:53,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4597, PETRI_PLACES=227, PETRI_TRANSITIONS=401} [2023-09-01 04:44:53,108 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 170 predicate places. [2023-09-01 04:44:53,108 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 401 transitions, 4597 flow [2023-09-01 04:44:53,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 174.9) internal successors, (5247), 30 states have internal predecessors, (5247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:53,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:53,109 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:53,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:53,313 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,SelfDestructingSolverStorable14 [2023-09-01 04:44:53,313 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:53,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -661451598, now seen corresponding path program 1 times [2023-09-01 04:44:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335418879] [2023-09-01 04:44:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335418879] [2023-09-01 04:44:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335418879] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:44:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074506202] [2023-09-01 04:44:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:44:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:44:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:44:53,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:44:53,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 401 transitions, 4597 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:53,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:53,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:44:53,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:55,589 INFO L130 PetriNetUnfolder]: 7018/13893 cut-off events. [2023-09-01 04:44:55,589 INFO L131 PetriNetUnfolder]: For 350002/351744 co-relation queries the response was YES. [2023-09-01 04:44:55,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92497 conditions, 13893 events. 7018/13893 cut-off events. For 350002/351744 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 114188 event pairs, 4168 based on Foata normal form. 24/12717 useless extension candidates. Maximal degree in co-relation 91690. Up to 12849 conditions per place. [2023-09-01 04:44:55,823 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 369 selfloop transitions, 1 changer transitions 3/402 dead transitions. [2023-09-01 04:44:55,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 402 transitions, 5403 flow [2023-09-01 04:44:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:44:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:44:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-09-01 04:44:55,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-09-01 04:44:55,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-09-01 04:44:55,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-09-01 04:44:55,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:55,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-09-01 04:44:55,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:55,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:55,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:55,829 INFO L175 Difference]: Start difference. First operand has 227 places, 401 transitions, 4597 flow. Second operand 3 states and 723 transitions. [2023-09-01 04:44:55,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 402 transitions, 5403 flow [2023-09-01 04:44:56,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 402 transitions, 5295 flow, removed 31 selfloop flow, removed 7 redundant places. [2023-09-01 04:44:56,043 INFO L231 Difference]: Finished difference. Result has 221 places, 394 transitions, 4418 flow [2023-09-01 04:44:56,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4418, PETRI_PLACES=221, PETRI_TRANSITIONS=394} [2023-09-01 04:44:56,043 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 164 predicate places. [2023-09-01 04:44:56,043 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 394 transitions, 4418 flow [2023-09-01 04:44:56,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:56,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:56,044 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 04:44:56,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:56,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1371567627, now seen corresponding path program 1 times [2023-09-01 04:44:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:56,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065720320] [2023-09-01 04:44:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:44:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065720320] [2023-09-01 04:44:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065720320] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:44:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819730313] [2023-09-01 04:44:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:56,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:44:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:44:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:44:56,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:44:56,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 394 transitions, 4418 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:56,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:56,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:44:56,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:58,181 INFO L130 PetriNetUnfolder]: 6870/13677 cut-off events. [2023-09-01 04:44:58,181 INFO L131 PetriNetUnfolder]: For 338705/341560 co-relation queries the response was YES. [2023-09-01 04:44:58,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89335 conditions, 13677 events. 6870/13677 cut-off events. For 338705/341560 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 112498 event pairs, 4181 based on Foata normal form. 57/12597 useless extension candidates. Maximal degree in co-relation 88086. Up to 9376 conditions per place. [2023-09-01 04:44:58,276 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 328 selfloop transitions, 38 changer transitions 0/395 dead transitions. [2023-09-01 04:44:58,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 395 transitions, 5223 flow [2023-09-01 04:44:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:44:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:44:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-09-01 04:44:58,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-09-01 04:44:58,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-09-01 04:44:58,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-09-01 04:44:58,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:58,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-09-01 04:44:58,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,280 INFO L175 Difference]: Start difference. First operand has 221 places, 394 transitions, 4418 flow. Second operand 3 states and 717 transitions. [2023-09-01 04:44:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 395 transitions, 5223 flow [2023-09-01 04:44:58,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 395 transitions, 5216 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-09-01 04:44:58,476 INFO L231 Difference]: Finished difference. Result has 221 places, 386 transitions, 4404 flow [2023-09-01 04:44:58,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4328, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4404, PETRI_PLACES=221, PETRI_TRANSITIONS=386} [2023-09-01 04:44:58,477 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 164 predicate places. [2023-09-01 04:44:58,477 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 386 transitions, 4404 flow [2023-09-01 04:44:58,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:58,478 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] [2023-09-01 04:44:58,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 04:44:58,478 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:58,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 855812906, now seen corresponding path program 1 times [2023-09-01 04:44:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556969255] [2023-09-01 04:44:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556969255] [2023-09-01 04:44:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556969255] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471635170] [2023-09-01 04:44:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:58,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:58,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:58,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 04:44:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:58,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:44:58,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:58,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471635170] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:58,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 04:44:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434239555] [2023-09-01 04:44:58,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:58,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:44:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:44:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:44:58,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:44:58,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 386 transitions, 4404 flow. Second operand has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:58,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:44:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:00,452 INFO L130 PetriNetUnfolder]: 5504/10872 cut-off events. [2023-09-01 04:45:00,453 INFO L131 PetriNetUnfolder]: For 315363/318022 co-relation queries the response was YES. [2023-09-01 04:45:00,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82403 conditions, 10872 events. 5504/10872 cut-off events. For 315363/318022 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 80759 event pairs, 2795 based on Foata normal form. 178/10315 useless extension candidates. Maximal degree in co-relation 81497. Up to 5495 conditions per place. [2023-09-01 04:45:00,547 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 402 selfloop transitions, 28 changer transitions 0/459 dead transitions. [2023-09-01 04:45:00,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 459 transitions, 6445 flow [2023-09-01 04:45:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:45:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:45:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1423 transitions. [2023-09-01 04:45:00,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282108389012621 [2023-09-01 04:45:00,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1423 transitions. [2023-09-01 04:45:00,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1423 transitions. [2023-09-01 04:45:00,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:00,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1423 transitions. [2023-09-01 04:45:00,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.16666666666666) internal successors, (1423), 6 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:00,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:00,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:00,673 INFO L175 Difference]: Start difference. First operand has 221 places, 386 transitions, 4404 flow. Second operand 6 states and 1423 transitions. [2023-09-01 04:45:00,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 459 transitions, 6445 flow [2023-09-01 04:45:00,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 459 transitions, 6370 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-09-01 04:45:00,876 INFO L231 Difference]: Finished difference. Result has 228 places, 386 transitions, 4497 flow [2023-09-01 04:45:00,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4158, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4497, PETRI_PLACES=228, PETRI_TRANSITIONS=386} [2023-09-01 04:45:00,877 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 171 predicate places. [2023-09-01 04:45:00,877 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 386 transitions, 4497 flow [2023-09-01 04:45:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:00,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:00,877 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:00,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 04:45:01,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:01,078 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:01,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash -66120868, now seen corresponding path program 3 times [2023-09-01 04:45:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064455947] [2023-09-01 04:45:01,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:01,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064455947] [2023-09-01 04:45:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064455947] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756864825] [2023-09-01 04:45:02,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 04:45:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:02,323 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:45:02,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 04:45:02,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 04:45:02,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:45:02,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 107 conjunts are in the unsatisfiable core [2023-09-01 04:45:02,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:02,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:02,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:02,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:02,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:45:02,664 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:45:02,665 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:45:02,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:45:02,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:45:03,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:45:03,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:03,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-09-01 04:45:03,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2023-09-01 04:45:03,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2023-09-01 04:45:03,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2023-09-01 04:45:03,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 86 [2023-09-01 04:45:04,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:04,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2023-09-01 04:45:04,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2023-09-01 04:45:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:04,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:05,084 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1151) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))) is different from false [2023-09-01 04:45:05,103 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1151) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))) is different from false [2023-09-01 04:45:05,331 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse3))) (or (= 20 .cse0) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1148) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_1151)))))) is different from false [2023-09-01 04:45:05,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse2 (select .cse4 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (= 20 .cse2) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse2 1) v_ArrVal_1151))))))) is different from false [2023-09-01 04:45:05,427 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1145)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse1 (select .cse4 .cse5))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (= 20 .cse1) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_1151) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1148))))))) is different from false [2023-09-01 04:45:05,819 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1145))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse3 (select .cse5 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= 20 .cse3) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ .cse3 1) v_ArrVal_1151)))))))) is different from false [2023-09-01 04:45:05,850 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse1 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse4))) v_ArrVal_1145))) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse6 .cse4)) (.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1151) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1148) (= .cse0 20) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))))) is different from false [2023-09-01 04:45:05,886 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1145))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ .cse2 1) v_ArrVal_1151) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (= 20 .cse2)))))))) is different from false [2023-09-01 04:45:05,991 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1141) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_ArrVal_1145))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select .cse6 .cse4)) (.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ .cse2 1) v_ArrVal_1151) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= .cse2 20) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1141)))))))) is different from false [2023-09-01 04:45:06,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 .cse6 v_ArrVal_1141) .cse11 (+ (select .cse5 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) v_ArrVal_1145))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (select .cse8 .cse4)) (.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ .cse2 1) v_ArrVal_1151) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= .cse2 20) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1141))))))))) is different from false [2023-09-01 04:45:06,120 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1139))) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 .cse3 v_ArrVal_1141) .cse11 (+ (select .cse2 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1145))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse6 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1141) (< (+ 1 .cse4) v_ArrVal_1151) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= 20 .cse4))))))))) is different from false [2023-09-01 04:45:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 11 not checked. [2023-09-01 04:45:12,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756864825] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:12,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 55 [2023-09-01 04:45:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943962187] [2023-09-01 04:45:12,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:12,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-09-01 04:45:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-09-01 04:45:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1556, Unknown=46, NotChecked=1078, Total=3192 [2023-09-01 04:45:12,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 449 [2023-09-01 04:45:12,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 386 transitions, 4497 flow. Second operand has 57 states, 57 states have (on average 162.26315789473685) internal successors, (9249), 57 states have internal predecessors, (9249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:12,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:12,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 449 [2023-09-01 04:45:12,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:29,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:31,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:48,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:50,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:52,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:54,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:56,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:58,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:00,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:02,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:04,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:06,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:08,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:10,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:12,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:15,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:34,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:37,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:39,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:41,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:43,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:47,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:49,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:51,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:53,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:55,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:57,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:59,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:01,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:03,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:05,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:14,989 WARN L222 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 209 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:47:17,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:38,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:40,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:42,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:44,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:46,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:48,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:50,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:52,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:54,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:59,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:01,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:08,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:32,368 WARN L222 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 151 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:48:34,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:36,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:38,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:58,173 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1145)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ .cse2 1) v_ArrVal_1151) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (= 20 .cse2)))))))) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse13 (select .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse12 (select (store (store .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse10 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse11 (select .cse13 .cse10))) (or (< (+ .cse11 1) v_ArrVal_1151) (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= .cse11 20)))))))) is different from false [2023-09-01 04:49:00,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:02,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:04,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:34,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:36,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:38,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:44,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:46,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:49,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:51,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:51,968 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1144 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1144))) (let ((.cse3 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1145)))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse2 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse4 (select .cse6 .cse2))) (or (< (+ (select .cse3 .cse1) 1) v_ArrVal_1148) (< (+ .cse4 1) v_ArrVal_1151) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (= 20 .cse4)))))))) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse14 (select .cse15 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse13 (select (store (store .cse15 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse11 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse12 (select .cse14 .cse11))) (or (< (+ .cse12 1) v_ArrVal_1151) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse1) 2147483647) (= .cse12 20)))))))) is different from false [2023-09-01 04:49:54,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:56,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:49:59,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:59,228 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1151) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))))) (forall ((v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))) is different from false [2023-09-01 04:50:00,218 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse3 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1145)))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse6 .cse4)) (.cse1 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1148) (< (+ .cse0 1) v_ArrVal_1151) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))))) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1145)) (.cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse12 (select .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select (store (store .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse9 (select .cse12 .cse13))) (or (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (= 20 .cse9) (< (select (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (+ .cse9 1) v_ArrVal_1151) (< (+ (select .cse10 .cse11) 1) v_ArrVal_1148))))))))) is different from false [2023-09-01 04:50:02,368 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1148 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse2 (select .cse4 .cse5))) (or (= 20 .cse2) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1148) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse2 1) v_ArrVal_1151)))))))) is different from false [2023-09-01 04:50:03,443 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1151) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))))) (forall ((v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1149))) (let ((.cse8 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse7 (select (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse5 v_ArrVal_1151)) |c_~#stored_elements~0.base| v_ArrVal_1152) |c_~#queue~0.base|)) (.cse6 (select .cse8 .cse5))) (or (< (+ .cse6 1) v_ArrVal_1151) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_1153) .cse2) 2147483647) (= .cse6 20)))))))) is different from false [2023-09-01 04:50:10,257 INFO L130 PetriNetUnfolder]: 6670/13115 cut-off events. [2023-09-01 04:50:10,257 INFO L131 PetriNetUnfolder]: For 399983/402222 co-relation queries the response was YES. [2023-09-01 04:50:10,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107048 conditions, 13115 events. 6670/13115 cut-off events. For 399983/402222 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 99416 event pairs, 2495 based on Foata normal form. 198/12580 useless extension candidates. Maximal degree in co-relation 106278. Up to 7895 conditions per place. [2023-09-01 04:50:10,355 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 356 selfloop transitions, 417 changer transitions 3/782 dead transitions. [2023-09-01 04:50:10,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 782 transitions, 14524 flow [2023-09-01 04:50:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-01 04:50:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-09-01 04:50:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 10053 transitions. [2023-09-01 04:50:10,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37316258351893095 [2023-09-01 04:50:10,371 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 10053 transitions. [2023-09-01 04:50:10,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 10053 transitions. [2023-09-01 04:50:10,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:50:10,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 10053 transitions. [2023-09-01 04:50:10,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 167.55) internal successors, (10053), 60 states have internal predecessors, (10053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:50:10,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 449.0) internal successors, (27389), 61 states have internal predecessors, (27389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:50:10,394 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 449.0) internal successors, (27389), 61 states have internal predecessors, (27389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:50:10,394 INFO L175 Difference]: Start difference. First operand has 228 places, 386 transitions, 4497 flow. Second operand 60 states and 10053 transitions. [2023-09-01 04:50:10,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 782 transitions, 14524 flow [2023-09-01 04:50:10,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 782 transitions, 14484 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-09-01 04:50:10,697 INFO L231 Difference]: Finished difference. Result has 319 places, 623 transitions, 10720 flow [2023-09-01 04:50:10,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4445, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=10720, PETRI_PLACES=319, PETRI_TRANSITIONS=623} [2023-09-01 04:50:10,698 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 262 predicate places. [2023-09-01 04:50:10,698 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 623 transitions, 10720 flow [2023-09-01 04:50:10,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 162.26315789473685) internal successors, (9249), 57 states have internal predecessors, (9249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:50:10,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:50:10,699 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:50:10,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-01 04:50:10,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:50:10,901 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:50:10,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:50:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -228871586, now seen corresponding path program 4 times [2023-09-01 04:50:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:50:10,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866734888] [2023-09-01 04:50:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:50:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:50:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:50:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:50:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:50:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866734888] [2023-09-01 04:50:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866734888] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:50:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758974364] [2023-09-01 04:50:11,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 04:50:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:50:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:50:11,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:50:11,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 04:50:12,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 04:50:12,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:50:12,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 96 conjunts are in the unsatisfiable core [2023-09-01 04:50:12,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:50:12,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:50:12,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:50:12,159 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:50:12,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:50:12,172 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:50:12,172 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:50:12,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:50:12,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:50:12,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:50:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:50:12,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:50:12,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:50:12,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-09-01 04:50:13,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-09-01 04:50:13,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-09-01 04:50:15,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:50:15,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-09-01 04:50:16,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:50:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:50:24,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:50:27,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1280 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1273) .cse2 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1275) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1273) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:50:38,433 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1273) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1275) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|))))))) is different from false [2023-09-01 04:50:38,474 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1268 Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1268) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1275) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1273) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse3) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|))))))) is different from false [2023-09-01 04:50:38,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1268 Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1275) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1268) (< (+ (select .cse2 .cse5) 1) v_ArrVal_1273) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse5) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|)))))))) is different from false [2023-09-01 04:50:38,596 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1266 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1268 Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1266) .cse5 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1266) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1273) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1275) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1268) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse3) 2147483647)))))))) is different from false [2023-09-01 04:50:38,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1266 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1268 Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1266) .cse6 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1273) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1275) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1266) (< (+ (select .cse4 .cse6) 1) v_ArrVal_1268) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse3) 2147483647)))))))) is different from false [2023-09-01 04:50:38,710 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int)) (v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1266 Int) (v_ArrVal_1265 Int) (v_ArrVal_1268 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse4 (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_1265)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse6 v_ArrVal_1266) .cse5 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1273) .cse1 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1275) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1268) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse4 .cse6) 1) v_ArrVal_1266) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1273)))))))) is different from false [2023-09-01 04:50:38,770 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_1280 Int) (v_ArrVal_1270 (Array Int Int)) (v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_ArrVal_1275 Int) (v_ArrVal_1266 Int) (v_ArrVal_1265 Int) (v_ArrVal_1268 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_1265)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1266) .cse3 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1272))) (let ((.cse2 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1273) .cse3 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1273) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1275) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1268) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1266) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))))))) is different from false [2023-09-01 04:50:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-09-01 04:50:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758974364] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:50:38,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:50:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-09-01 04:50:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388939946] [2023-09-01 04:50:38,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:50:38,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-09-01 04:50:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:50:38,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-09-01 04:50:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1545, Unknown=51, NotChecked=760, Total=2862 [2023-09-01 04:50:38,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:50:38,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 623 transitions, 10720 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:50:38,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:50:38,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:50:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:50:48,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:50:51,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:50:53,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:08,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:11,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:13,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:15,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:17,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:19,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:32,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:34,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:44,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:46,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:59,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:01,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:03,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:05,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:07,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:10,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:12,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:14,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:16,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:18,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:20,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:22,269 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1280 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1275) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse4) 2147483647)))) (forall ((v_ArrVal_1275 Int) (v_ArrVal_1278 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1280 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1275)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1277) |c_~#stored_elements~0.base| v_ArrVal_1278) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1275) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1280) .cse4) 2147483647)))))) is different from false [2023-09-01 04:52:26,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:29,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:31,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:35,056 INFO L130 PetriNetUnfolder]: 6824/13451 cut-off events. [2023-09-01 04:52:35,056 INFO L131 PetriNetUnfolder]: For 2176527/2182707 co-relation queries the response was YES. [2023-09-01 04:52:35,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196890 conditions, 13451 events. 6824/13451 cut-off events. For 2176527/2182707 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 102436 event pairs, 2888 based on Foata normal form. 102/12812 useless extension candidates. Maximal degree in co-relation 196029. Up to 8327 conditions per place. [2023-09-01 04:52:35,285 INFO L137 encePairwiseOnDemand]: 433/449 looper letters, 462 selfloop transitions, 325 changer transitions 3/796 dead transitions. [2023-09-01 04:52:35,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 796 transitions, 22124 flow [2023-09-01 04:52:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-01 04:52:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-09-01 04:52:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 6597 transitions. [2023-09-01 04:52:35,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3866486930019927 [2023-09-01 04:52:35,292 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 6597 transitions. [2023-09-01 04:52:35,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 6597 transitions. [2023-09-01 04:52:35,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:52:35,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 6597 transitions. [2023-09-01 04:52:35,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 173.60526315789474) internal successors, (6597), 38 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:35,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 449.0) internal successors, (17511), 39 states have internal predecessors, (17511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:35,311 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 449.0) internal successors, (17511), 39 states have internal predecessors, (17511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:35,311 INFO L175 Difference]: Start difference. First operand has 319 places, 623 transitions, 10720 flow. Second operand 38 states and 6597 transitions. [2023-09-01 04:52:35,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 796 transitions, 22124 flow [2023-09-01 04:52:36,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 796 transitions, 19524 flow, removed 1236 selfloop flow, removed 14 redundant places. [2023-09-01 04:52:36,410 INFO L231 Difference]: Finished difference. Result has 354 places, 669 transitions, 10300 flow [2023-09-01 04:52:36,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=8120, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=10300, PETRI_PLACES=354, PETRI_TRANSITIONS=669} [2023-09-01 04:52:36,410 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 297 predicate places. [2023-09-01 04:52:36,410 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 669 transitions, 10300 flow [2023-09-01 04:52:36,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:36,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:52:36,412 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:52:36,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-01 04:52:36,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:36,612 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:52:36,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:52:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1202034392, now seen corresponding path program 1 times [2023-09-01 04:52:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:52:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25898018] [2023-09-01 04:52:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:52:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:52:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:52:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25898018] [2023-09-01 04:52:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25898018] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:52:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592173313] [2023-09-01 04:52:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:52:37,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:52:37,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:52:37,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 04:52:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:38,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 92 conjunts are in the unsatisfiable core [2023-09-01 04:52:38,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:52:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:38,046 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:52:38,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:52:38,062 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:52:38,062 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-09-01 04:52:38,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:52:38,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:52:38,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:52:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:38,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:52:38,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:52:38,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-09-01 04:52:38,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-09-01 04:52:38,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:38,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-09-01 04:52:39,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-09-01 04:52:39,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2023-09-01 04:52:39,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2023-09-01 04:52:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:42,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:52:42,565 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2023-09-01 04:52:42,573 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))) is different from false [2023-09-01 04:52:42,585 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1404) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2023-09-01 04:52:42,672 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1403) .cse4 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1404)))))) is different from false [2023-09-01 04:52:42,702 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1400)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1403) .cse1 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1404) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2023-09-01 04:52:44,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1400)))) (let ((.cse3 (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse1 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1404) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647))))))) is different from false [2023-09-01 04:52:44,860 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1397 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1397)) |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_1400)))) (let ((.cse3 (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse1 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1404) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1397) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647))))))) is different from false [2023-09-01 04:52:44,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1397 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1397)) |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse0 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1400)))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse1 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1404) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1397) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647)))))))) is different from false [2023-09-01 04:52:44,924 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1395 Int) (v_ArrVal_1397 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1395) .cse1 v_ArrVal_1397)) |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse2 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1400)))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse3 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1397) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1404) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse3) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))))) is different from false [2023-09-01 04:52:44,975 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1395 Int) (v_ArrVal_1397 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse3 (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_1394)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1395) .cse4 v_ArrVal_1397)) |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse2))) v_ArrVal_1400)))) (let ((.cse0 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse2 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1397) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1404) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))))) is different from false [2023-09-01 04:52:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-09-01 04:52:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592173313] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:52:49,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:52:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 44 [2023-09-01 04:52:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163422830] [2023-09-01 04:52:49,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:52:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-09-01 04:52:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:52:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-09-01 04:52:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=920, Unknown=24, NotChecked=770, Total=2070 [2023-09-01 04:52:49,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:52:49,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 669 transitions, 10300 flow. Second operand has 46 states, 46 states have (on average 174.7608695652174) internal successors, (8039), 46 states have internal predecessors, (8039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:49,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:52:49,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:52:49,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:53:02,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:53:04,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:53:13,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:41,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:53:58,789 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 115 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:53:59,058 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (< .cse0 2147483647) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ .cse0 1) v_ArrVal_1404) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647))))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse8 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1400)))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1403) .cse2 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1404)))))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse11 |c_~#queue~0.base| (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))) (forall ((v_ArrVal_1409 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5) 2147483647)) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1399))) (let ((.cse13 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1400)))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_1403) .cse2 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (or (< (+ (select .cse13 .cse2) 1) v_ArrVal_1404) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse15 |c_~#queue~0.base| (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647)))))))))) is different from false [2023-09-01 04:53:59,215 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1409 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse5 (store .cse1 (+ (* .cse0 4) |c_~#queue~0.offset|) v_ArrVal_1400))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1403) .cse2 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1404))))))))) is different from false [2023-09-01 04:53:59,371 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1407 Int) (v_ArrVal_1409 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1400 Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse3 (store .cse0 .cse1 v_ArrVal_1400))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1403) .cse2 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_1404) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse5) 2147483647)))))))) is different from false [2023-09-01 04:53:59,500 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1403) .cse4 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1404)))))) (forall ((v_ArrVal_1409 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4) 2147483647)))) is different from false [2023-09-01 04:54:01,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:01,742 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1404) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647))))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1407 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1404 Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1404)) |c_~#stored_elements~0.base| v_ArrVal_1406))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1404) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_~#queue~0.base|) .cse1) 2147483647))))))) is different from false [2023-09-01 04:54:04,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:05,051 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1407 Int) (v_ArrVal_1409 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_1409 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1409) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2023-09-01 04:54:07,904 INFO L130 PetriNetUnfolder]: 7407/14582 cut-off events. [2023-09-01 04:54:07,904 INFO L131 PetriNetUnfolder]: For 2734056/2741038 co-relation queries the response was YES. [2023-09-01 04:54:07,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222714 conditions, 14582 events. 7407/14582 cut-off events. For 2734056/2741038 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 111794 event pairs, 2916 based on Foata normal form. 188/14014 useless extension candidates. Maximal degree in co-relation 221903. Up to 8518 conditions per place. [2023-09-01 04:54:08,102 INFO L137 encePairwiseOnDemand]: 431/449 looper letters, 493 selfloop transitions, 429 changer transitions 3/931 dead transitions. [2023-09-01 04:54:08,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 931 transitions, 23815 flow [2023-09-01 04:54:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-09-01 04:54:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-09-01 04:54:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6690 transitions. [2023-09-01 04:54:08,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40269668332029135 [2023-09-01 04:54:08,113 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6690 transitions. [2023-09-01 04:54:08,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6690 transitions. [2023-09-01 04:54:08,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:54:08,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6690 transitions. [2023-09-01 04:54:08,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 180.8108108108108) internal successors, (6690), 37 states have internal predecessors, (6690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:54:08,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 449.0) internal successors, (17062), 38 states have internal predecessors, (17062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:54:08,127 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 449.0) internal successors, (17062), 38 states have internal predecessors, (17062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:54:08,127 INFO L175 Difference]: Start difference. First operand has 354 places, 669 transitions, 10300 flow. Second operand 37 states and 6690 transitions. [2023-09-01 04:54:08,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 931 transitions, 23815 flow [2023-09-01 04:54:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 931 transitions, 22739 flow, removed 323 selfloop flow, removed 18 redundant places. [2023-09-01 04:54:09,694 INFO L231 Difference]: Finished difference. Result has 391 places, 812 transitions, 15999 flow [2023-09-01 04:54:09,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=9176, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=15999, PETRI_PLACES=391, PETRI_TRANSITIONS=812} [2023-09-01 04:54:09,695 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 334 predicate places. [2023-09-01 04:54:09,696 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 812 transitions, 15999 flow [2023-09-01 04:54:09,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 174.7608695652174) internal successors, (8039), 46 states have internal predecessors, (8039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:54:09,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:54:09,697 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-09-01 04:54:09,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-09-01 04:54:09,901 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,SelfDestructingSolverStorable20 [2023-09-01 04:54:09,902 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:54:09,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:54:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -972277364, now seen corresponding path program 5 times [2023-09-01 04:54:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:54:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859625836] [2023-09-01 04:54:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:54:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:54:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:54:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:54:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:54:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859625836] [2023-09-01 04:54:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859625836] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:54:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257408604] [2023-09-01 04:54:11,687 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 04:54:11,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:54:11,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:54:11,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:54:11,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 04:54:11,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-01 04:54:11,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:54:11,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 120 conjunts are in the unsatisfiable core [2023-09-01 04:54:11,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:54:11,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:54:11,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:54:11,979 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:54:11,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:54:11,997 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-09-01 04:54:11,997 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 34 [2023-09-01 04:54:12,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:54:12,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-09-01 04:54:12,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2023-09-01 04:54:12,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:54:12,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-09-01 04:54:12,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2023-09-01 04:54:12,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2023-09-01 04:54:13,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2023-09-01 04:54:15,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:54:15,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2023-09-01 04:54:15,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2023-09-01 04:54:16,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2023-09-01 04:54:23,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2023-09-01 04:54:37,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2023-09-01 04:54:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:54:57,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2023-09-01 04:55:16,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2023-09-01 04:55:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:55:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:55:34,985 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1555 Int) (v_ArrVal_1559 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1555) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-09-01 04:55:37,153 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1554 Int) (v_ArrVal_1555 Int) (v_ArrVal_1559 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1554) .cse2 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1554) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1555))))) is different from false [2023-09-01 04:55:47,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1555 Int) (v_ArrVal_1559 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1554) .cse1 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1555) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1554) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|))))))) is different from false [2023-09-01 04:55:47,400 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1555 Int) (v_ArrVal_1559 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1554) .cse3 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1554) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1555) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|))))))) is different from false [2023-09-01 04:55:48,253 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1544 Int) (v_ArrVal_1555 Int) (v_ArrVal_1547 Int) (v_ArrVal_1546 Int) (v_ArrVal_1559 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1544)) (.cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1546) .cse6 v_ArrVal_1547)) |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1554) .cse3 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1554) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1555) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1547) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1546)))))))) is different from false [2023-09-01 04:56:06,053 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1542 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1544 Int) (v_ArrVal_1555 Int) (v_ArrVal_1547 Int) (v_ArrVal_1546 Int) (v_ArrVal_1559 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1542))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1544)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1546) .cse1 v_ArrVal_1547)) |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1554) .cse1 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1555) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1546) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1554) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1547) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1541)))))))))) is different from false [2023-09-01 04:56:08,513 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1542 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1544 Int) (v_ArrVal_1555 Int) (v_ArrVal_1547 Int) (v_ArrVal_1546 Int) (v_ArrVal_1559 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1542))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1544)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1546) .cse4 v_ArrVal_1547)) |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1554) .cse4 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1546) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1541) (< (+ 1 (select .cse0 .cse4)) v_ArrVal_1547) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1555) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1554) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse1) 2147483647))))))))))) is different from false [2023-09-01 04:56:08,583 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1542 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1544 Int) (v_ArrVal_1555 Int) (v_ArrVal_1547 Int) (v_ArrVal_1546 Int) (v_ArrVal_1559 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (let ((.cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse4 .cse11 (+ (select .cse4 .cse11) 1))) .cse5 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1542))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1544)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1546) .cse1 v_ArrVal_1547)) |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1554) .cse1 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1555) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1546) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1541) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1547) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1554) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))))) is different from false [2023-09-01 04:56:08,661 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1542 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1544 Int) (v_ArrVal_1555 Int) (v_ArrVal_1536 Int) (v_ArrVal_1547 Int) (v_ArrVal_1546 Int) (v_ArrVal_1559 Int)) (let ((.cse7 (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_1536)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (let ((.cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse11 (+ (select .cse7 .cse11) 1))) .cse8 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1542))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1544)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1546) .cse1 v_ArrVal_1547)) |c_~#stored_elements~0.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1552))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1554) .cse1 v_ArrVal_1555)) |c_~#stored_elements~0.base| v_ArrVal_1557) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1547) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1546) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1559) .cse2) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1555) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1541) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1554))))))))))) is different from false Killed by 15