./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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_longer.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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 12:34:21,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 12:34:21,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 12:34:21,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 12:34:21,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 12:34:21,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 12:34:21,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 12:34:21,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 12:34:21,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 12:34:21,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 12:34:21,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 12:34:21,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 12:34:21,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 12:34:21,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 12:34:21,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 12:34:21,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 12:34:21,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 12:34:21,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 12:34:21,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 12:34:21,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 12:34:21,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 12:34:21,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 12:34:21,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 12:34:21,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 12:34:21,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 12:34:21,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 12:34:21,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 12:34:21,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 12:34:21,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 12:34:21,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 12:34:21,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 12:34:21,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 12:34:21,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 12:34:21,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 12:34:21,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 12:34:21,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 12:34:21,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 12:34:21,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 12:34:21,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 12:34:21,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 12:34:21,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 12:34:21,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 12:34:21,390 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 12:34:21,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 12:34:21,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 12:34:21,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 12:34:21,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 12:34:21,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 12:34:21,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 12:34:21,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 12:34:21,393 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 12:34:21,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 12:34:21,393 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 12:34:21,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 12:34:21,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 12:34:21,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 12:34:21,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:21,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 12:34:21,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 12:34:21,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 12:34:21,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 12:34:21,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 12:34:21,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 12:34:21,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 12:34:21,397 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 12:34:21,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 12:34:21,397 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 12:34:21,397 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a 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 -> TOGETHER [2023-08-30 12:34:21,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 12:34:21,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 12:34:21,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 12:34:21,686 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 12:34:21,687 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 12:34:21,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 12:34:22,775 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 12:34:23,014 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 12:34:23,014 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 12:34:23,031 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3210a0059/5e819df769354c1181aede73d9f61d53/FLAG09eb9cad3 [2023-08-30 12:34:23,047 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3210a0059/5e819df769354c1181aede73d9f61d53 [2023-08-30 12:34:23,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 12:34:23,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 12:34:23,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:23,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 12:34:23,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 12:34:23,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63974555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23, skipping insertion in model container [2023-08-30 12:34:23,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 12:34:23,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 12:34:23,360 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_longer.i[43272,43285] [2023-08-30 12:34:23,362 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_longer.i[43545,43558] [2023-08-30 12:34:23,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:23,371 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 12:34:23,403 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_longer.i[43272,43285] [2023-08-30 12:34:23,405 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_longer.i[43545,43558] [2023-08-30 12:34:23,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:23,459 INFO L208 MainTranslator]: Completed translation [2023-08-30 12:34:23,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23 WrapperNode [2023-08-30 12:34:23,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:23,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:23,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 12:34:23,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 12:34:23,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,502 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-08-30 12:34:23,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:23,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 12:34:23,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 12:34:23,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 12:34:23,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,524 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 12:34:23,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 12:34:23,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 12:34:23,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 12:34:23,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:23,555 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-08-30 12:34:23,558 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-08-30 12:34:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 12:34:23,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 12:34:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 12:34:23,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 12:34:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 12:34:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 12:34:23,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 12:34:23,591 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 12:34:23,686 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 12:34:23,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 12:34:23,940 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 12:34:23,946 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 12:34:23,946 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 12:34:23,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:23 BoogieIcfgContainer [2023-08-30 12:34:23,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 12:34:23,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 12:34:23,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 12:34:23,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 12:34:23,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 12:34:23" (1/3) ... [2023-08-30 12:34:23,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b49d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:23, skipping insertion in model container [2023-08-30 12:34:23,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23" (2/3) ... [2023-08-30 12:34:23,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b49d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:23, skipping insertion in model container [2023-08-30 12:34:23,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:23" (3/3) ... [2023-08-30 12:34:23,953 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-30 12:34:23,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 12:34:23,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 12:34:23,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 12:34:23,963 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 12:34:24,031 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 12:34:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:24,169 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-08-30 12:34:24,170 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 12:34:24,175 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-08-30 12:34:24,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:24,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:24,185 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 12:34:24,199 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:24,204 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:24,248 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-08-30 12:34:24,248 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:24,252 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-08-30 12:34:24,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-08-30 12:34:30,828 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-08-30 12:34:30,828 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-08-30 12:34:30,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 12:34:30,853 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;@15c2e0e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 12:34:30,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 12:34:30,861 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 12:34:30,861 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:30,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:30,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:30,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:30,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-08-30 12:34:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594130317] [2023-08-30 12:34:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594130317] [2023-08-30 12:34:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594130317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143463927] [2023-08-30 12:34:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:31,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 12:34:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:31,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 12:34:31,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 12:34:32,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:32,173 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-08-30 12:34:32,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:32,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:32,498 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-08-30 12:34:32,498 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 12:34:32,500 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-08-30 12:34:32,507 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-30 12:34:32,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-30 12:34:32,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-08-30 12:34:32,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-30 12:34:32,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-30 12:34:32,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:32,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-30 12:34:32,527 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-08-30 12:34:32,532 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-08-30 12:34:32,533 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-08-30 12:34:32,534 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-08-30 12:34:32,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:32,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 12:34:32,538 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:32,539 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-08-30 12:34:32,542 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-30 12:34:32,542 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:32,542 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-08-30 12:34:32,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:32,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:32,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 12:34:32,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:32,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-08-30 12:34:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801299288] [2023-08-30 12:34:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801299288] [2023-08-30 12:34:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801299288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551531989] [2023-08-30 12:34:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:33,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:33,774 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-08-30 12:34:33,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:33,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:34,196 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-08-30 12:34:34,196 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-30 12:34:34,199 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-08-30 12:34:34,207 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-08-30 12:34:34,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-08-30 12:34:34,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-08-30 12:34:34,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-08-30 12:34:34,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-08-30 12:34:34,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:34,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-08-30 12:34:34,213 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-08-30 12:34:34,216 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-08-30 12:34:34,217 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-08-30 12:34:34,217 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-08-30 12:34:34,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:34,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:34,222 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:34,222 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-08-30 12:34:34,222 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-08-30 12:34:34,223 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:34,223 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-08-30 12:34:34,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:34,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:34,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 12:34:34,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:34,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-08-30 12:34:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029362474] [2023-08-30 12:34:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029362474] [2023-08-30 12:34:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029362474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176783045] [2023-08-30 12:34:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:34,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:34,690 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-08-30 12:34:34,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:34,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:34,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:35,033 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-08-30 12:34:35,034 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 12:34:35,038 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-08-30 12:34:35,046 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 12:34:35,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 12:34:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 12:34:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-30 12:34:35,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-08-30 12:34:35,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-30 12:34:35,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-30 12:34:35,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:35,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-30 12:34:35,051 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-08-30 12:34:35,077 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-08-30 12:34:35,078 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-08-30 12:34:35,079 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-08-30 12:34:35,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:35,086 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:35,086 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-08-30 12:34:35,087 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-30 12:34:35,087 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:35,088 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-08-30 12:34:35,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:35,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:35,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 12:34:35,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:35,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-08-30 12:34:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:35,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8170332] [2023-08-30 12:34:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8170332] [2023-08-30 12:34:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8170332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253555531] [2023-08-30 12:34:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:35,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 12:34:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 12:34:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 12:34:35,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-08-30 12:34:35,136 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-08-30 12:34:35,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:35,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-08-30 12:34:35,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:35,573 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-08-30 12:34:35,573 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-08-30 12:34:35,581 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-08-30 12:34:35,600 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-08-30 12:34:35,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 12:34:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 12:34:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 12:34:35,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-08-30 12:34:35,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 12:34:35,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 12:34:35,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:35,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 12:34:35,608 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-08-30 12:34:35,612 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-08-30 12:34:35,612 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-08-30 12:34:35,612 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-08-30 12:34:35,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:35,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:35,620 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:35,620 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-08-30 12:34:35,622 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-30 12:34:35,622 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:35,623 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-08-30 12:34:35,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:35,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 12:34:35,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:35,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-08-30 12:34:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925815727] [2023-08-30 12:34:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925815727] [2023-08-30 12:34:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925815727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:36,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99709721] [2023-08-30 12:34:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 12:34:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 12:34:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 12:34:36,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:36,321 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-08-30 12:34:36,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:36,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:36,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:36,895 INFO L130 PetriNetUnfolder]: 3404/5688 cut-off events. [2023-08-30 12:34:36,895 INFO L131 PetriNetUnfolder]: For 2514/2522 co-relation queries the response was YES. [2023-08-30 12:34:36,906 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-08-30 12:34:36,926 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-08-30 12:34:36,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 554 flow [2023-08-30 12:34:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-08-30 12:34:36,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974016332590943 [2023-08-30 12:34:36,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-08-30 12:34:36,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-08-30 12:34:36,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:36,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-08-30 12:34:36,931 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-08-30 12:34:36,934 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-08-30 12:34:36,935 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-08-30 12:34:36,935 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 6 states and 1340 transitions. [2023-08-30 12:34:36,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 554 flow [2023-08-30 12:34:36,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:34:36,941 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 404 flow [2023-08-30 12:34:36,942 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-08-30 12:34:36,942 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-08-30 12:34:36,942 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 404 flow [2023-08-30 12:34:36,943 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-08-30 12:34:36,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:36,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:36,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 12:34:36,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:36,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-08-30 12:34:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282213233] [2023-08-30 12:34:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282213233] [2023-08-30 12:34:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282213233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106258661] [2023-08-30 12:34:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:37,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:38,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:38,307 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-08-30 12:34:38,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:38,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:39,345 INFO L130 PetriNetUnfolder]: 3697/6100 cut-off events. [2023-08-30 12:34:39,345 INFO L131 PetriNetUnfolder]: For 1866/1896 co-relation queries the response was YES. [2023-08-30 12:34:39,363 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-08-30 12:34:39,386 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 141 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2023-08-30 12:34:39,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 168 transitions, 969 flow [2023-08-30 12:34:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1393 transitions. [2023-08-30 12:34:39,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170749814402376 [2023-08-30 12:34:39,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1393 transitions. [2023-08-30 12:34:39,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1393 transitions. [2023-08-30 12:34:39,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:39,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1393 transitions. [2023-08-30 12:34:39,392 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-08-30 12:34:39,395 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-08-30 12:34:39,396 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-08-30 12:34:39,396 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 404 flow. Second operand 6 states and 1393 transitions. [2023-08-30 12:34:39,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 168 transitions, 969 flow [2023-08-30 12:34:39,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 12:34:39,465 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 456 flow [2023-08-30 12:34:39,465 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-08-30 12:34:39,467 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-08-30 12:34:39,468 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 456 flow [2023-08-30 12:34:39,468 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-08-30 12:34:39,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:39,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:39,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 12:34:39,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:39,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1523080992, now seen corresponding path program 1 times [2023-08-30 12:34:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956109110] [2023-08-30 12:34:39,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956109110] [2023-08-30 12:34:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956109110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:39,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863143619] [2023-08-30 12:34:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:39,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:39,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:39,940 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-08-30 12:34:39,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:39,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:39,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:40,417 INFO L130 PetriNetUnfolder]: 3933/6511 cut-off events. [2023-08-30 12:34:40,417 INFO L131 PetriNetUnfolder]: For 3371/3393 co-relation queries the response was YES. [2023-08-30 12:34:40,427 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-08-30 12:34:40,441 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 126 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2023-08-30 12:34:40,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 939 flow [2023-08-30 12:34:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 12:34:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 12:34:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1170 transitions. [2023-08-30 12:34:40,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211581291759465 [2023-08-30 12:34:40,445 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1170 transitions. [2023-08-30 12:34:40,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1170 transitions. [2023-08-30 12:34:40,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:40,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1170 transitions. [2023-08-30 12:34:40,447 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-08-30 12:34:40,449 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-08-30 12:34:40,450 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-08-30 12:34:40,450 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 456 flow. Second operand 5 states and 1170 transitions. [2023-08-30 12:34:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 939 flow [2023-08-30 12:34:40,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 907 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 12:34:40,468 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 497 flow [2023-08-30 12:34:40,469 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-08-30 12:34:40,471 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-08-30 12:34:40,471 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 497 flow [2023-08-30 12:34:40,472 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-08-30 12:34:40,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:40,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:40,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 12:34:40,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:40,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-08-30 12:34:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689772587] [2023-08-30 12:34:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689772587] [2023-08-30 12:34:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689772587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37806018] [2023-08-30 12:34:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:40,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:34:40,519 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-08-30 12:34:40,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:40,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:34:40,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:40,624 INFO L130 PetriNetUnfolder]: 716/1428 cut-off events. [2023-08-30 12:34:40,624 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-08-30 12:34:40,626 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-08-30 12:34:40,629 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-08-30 12:34:40,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 595 flow [2023-08-30 12:34:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-08-30 12:34:40,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-08-30 12:34:40,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-08-30 12:34:40,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-08-30 12:34:40,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:40,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-08-30 12:34:40,632 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-08-30 12:34:40,634 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-08-30 12:34:40,634 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-08-30 12:34:40,634 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 497 flow. Second operand 3 states and 725 transitions. [2023-08-30 12:34:40,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 595 flow [2023-08-30 12:34:40,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 573 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:40,637 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:40,638 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-08-30 12:34:40,639 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 12:34:40,639 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:40,640 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-08-30 12:34:40,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:40,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:40,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 12:34:40,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:40,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -240537722, now seen corresponding path program 1 times [2023-08-30 12:34:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:40,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21062977] [2023-08-30 12:34:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21062977] [2023-08-30 12:34:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21062977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702208685] [2023-08-30 12:34:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:40,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:34:40,684 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-08-30 12:34:40,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:40,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:34:40,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:40,827 INFO L130 PetriNetUnfolder]: 528/1058 cut-off events. [2023-08-30 12:34:40,828 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-08-30 12:34:40,829 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-08-30 12:34:40,831 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 75 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 12:34:40,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 560 flow [2023-08-30 12:34:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-08-30 12:34:40,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-08-30 12:34:40,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-08-30 12:34:40,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-08-30 12:34:40,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:40,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-08-30 12:34:40,835 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-08-30 12:34:40,837 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-08-30 12:34:40,837 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-08-30 12:34:40,837 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 3 states and 732 transitions. [2023-08-30 12:34:40,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 560 flow [2023-08-30 12:34:40,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 552 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:40,849 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:40,850 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-08-30 12:34:40,850 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 12:34:40,850 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:40,851 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-08-30 12:34:40,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:40,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:40,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 12:34:40,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:40,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-08-30 12:34:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:40,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925501367] [2023-08-30 12:34:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:40,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925501367] [2023-08-30 12:34:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925501367] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:34:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074748098] [2023-08-30 12:34:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:34:41,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:41,289 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-08-30 12:34:41,310 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-08-30 12:34:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:41,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 12:34:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:34:41,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:41,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:41,474 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:34:41,475 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-08-30 12:34:41,483 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 12:34:41,483 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-08-30 12:34:41,585 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-08-30 12:34:41,699 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-08-30 12:34:41,858 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-08-30 12:34:41,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:41,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:34:42,025 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-08-30 12:34:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:42,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:34:42,238 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_373)))) is different from false [2023-08-30 12:34:42,257 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 |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 12:34:42,290 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< v_ArrVal_372 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2023-08-30 12:34:42,311 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< 0 (+ (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2023-08-30 12:34:42,338 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)) (v_ArrVal_369 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_369)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |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 (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373))))) is different from false [2023-08-30 12:34:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:34:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074748098] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:34:42,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:34:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 12:34:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648935687] [2023-08-30 12:34:42,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:34:42,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 12:34:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 12:34:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=446, Unknown=15, NotChecked=250, Total=870 [2023-08-30 12:34:42,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-08-30 12:34:42,537 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-08-30 12:34:42,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:42,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-08-30 12:34:42,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:35:20,086 INFO L130 PetriNetUnfolder]: 1537/3020 cut-off events. [2023-08-30 12:35:20,086 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2023-08-30 12:35:20,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 3020 events. 1537/3020 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 19151 event pairs, 606 based on Foata normal form. 1/2698 useless extension candidates. Maximal degree in co-relation 5493. Up to 801 conditions per place. [2023-08-30 12:35:20,102 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 189 selfloop transitions, 105 changer transitions 4/304 dead transitions. [2023-08-30 12:35:20,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 304 transitions, 1740 flow [2023-08-30 12:35:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-30 12:35:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-30 12:35:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6574 transitions. [2023-08-30 12:35:20,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3957141997231084 [2023-08-30 12:35:20,114 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6574 transitions. [2023-08-30 12:35:20,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6574 transitions. [2023-08-30 12:35:20,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:35:20,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6574 transitions. [2023-08-30 12:35:20,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 177.67567567567568) internal successors, (6574), 37 states have internal predecessors, (6574), 0 states have call successors, (0), 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-08-30 12:35:20,140 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-08-30 12:35:20,143 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-08-30 12:35:20,144 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 37 states and 6574 transitions. [2023-08-30 12:35:20,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 304 transitions, 1740 flow [2023-08-30 12:35:20,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 304 transitions, 1735 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:35:20,152 INFO L231 Difference]: Finished difference. Result has 139 places, 165 transitions, 1129 flow [2023-08-30 12:35:20,153 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=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1129, PETRI_PLACES=139, PETRI_TRANSITIONS=165} [2023-08-30 12:35:20,153 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 82 predicate places. [2023-08-30 12:35:20,153 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 165 transitions, 1129 flow [2023-08-30 12:35:20,154 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-08-30 12:35:20,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:35:20,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:35:20,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 12:35:20,360 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-08-30 12:35:20,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:35:20,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:35:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 1 times [2023-08-30 12:35:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:35:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452261903] [2023-08-30 12:35:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:35:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:35:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452261903] [2023-08-30 12:35:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452261903] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:35:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644265796] [2023-08-30 12:35:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:35:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:35:21,108 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-08-30 12:35:21,110 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-08-30 12:35:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:21,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 12:35:21,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:35:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:21,243 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:35:21,244 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-08-30 12:35:21,261 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:35:21,261 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-08-30 12:35:21,357 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-08-30 12:35:21,462 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-08-30 12:35:21,599 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-08-30 12:35:21,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:21,653 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-08-30 12:35:21,704 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-08-30 12:35:21,801 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-08-30 12:35:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:22,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:35:22,170 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 12:35:22,179 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) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 12:35:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644265796] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:35:34,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:35:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 12:35:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063849109] [2023-08-30 12:35:34,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:35:34,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 12:35:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:35:34,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 12:35:34,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=789, Unknown=28, NotChecked=126, Total=1190 [2023-08-30 12:35:34,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:35:34,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 165 transitions, 1129 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-08-30 12:35:34,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:35:34,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:35:34,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:35:46,005 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-08-30 12:35:52,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-08-30 12:35:54,468 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse4 .cse5) 1)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (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 ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_474) .cse5 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 (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_474) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< .cse2 v_ArrVal_476) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse3) 2147483647)))) (forall ((v_ArrVal_476 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 ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 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 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse3) 2147483647) (< .cse2 v_ArrVal_476) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|))))))) is different from false [2023-08-30 12:35:58,635 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-08-30 12:36:00,667 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-08-30 12:36:02,762 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-08-30 12:36:02,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_476 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 ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 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 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_476) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) (forall ((v_ArrVal_476 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 ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 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 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_476) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))))) is different from false [2023-08-30 12:36:05,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:07,760 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-08-30 12:36:10,720 INFO L130 PetriNetUnfolder]: 2239/4396 cut-off events. [2023-08-30 12:36:10,721 INFO L131 PetriNetUnfolder]: For 19079/19089 co-relation queries the response was YES. [2023-08-30 12:36:10,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18218 conditions, 4396 events. 2239/4396 cut-off events. For 19079/19089 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 30211 event pairs, 789 based on Foata normal form. 0/3985 useless extension candidates. Maximal degree in co-relation 16876. Up to 2482 conditions per place. [2023-08-30 12:36:10,740 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 230 selfloop transitions, 98 changer transitions 3/337 dead transitions. [2023-08-30 12:36:10,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 337 transitions, 3372 flow [2023-08-30 12:36:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 12:36:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 12:36:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4577 transitions. [2023-08-30 12:36:10,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39206784307007025 [2023-08-30 12:36:10,749 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4577 transitions. [2023-08-30 12:36:10,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4577 transitions. [2023-08-30 12:36:10,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:10,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4577 transitions. [2023-08-30 12:36:10,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 176.03846153846155) internal successors, (4577), 26 states have internal predecessors, (4577), 0 states have call successors, (0), 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-08-30 12:36:10,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 449.0) internal successors, (12123), 27 states have internal predecessors, (12123), 0 states have call successors, (0), 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-08-30 12:36:10,765 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 449.0) internal successors, (12123), 27 states have internal predecessors, (12123), 0 states have call successors, (0), 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-08-30 12:36:10,765 INFO L175 Difference]: Start difference. First operand has 139 places, 165 transitions, 1129 flow. Second operand 26 states and 4577 transitions. [2023-08-30 12:36:10,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 337 transitions, 3372 flow [2023-08-30 12:36:10,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 337 transitions, 3151 flow, removed 92 selfloop flow, removed 11 redundant places. [2023-08-30 12:36:10,787 INFO L231 Difference]: Finished difference. Result has 164 places, 222 transitions, 1779 flow [2023-08-30 12:36:10,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1779, PETRI_PLACES=164, PETRI_TRANSITIONS=222} [2023-08-30 12:36:10,788 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 107 predicate places. [2023-08-30 12:36:10,788 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 222 transitions, 1779 flow [2023-08-30 12:36:10,789 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-08-30 12:36:10,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:10,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:10,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 12:36:10,994 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-08-30 12:36:10,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:10,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2112210513, now seen corresponding path program 1 times [2023-08-30 12:36:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699731147] [2023-08-30 12:36:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699731147] [2023-08-30 12:36:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699731147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446323262] [2023-08-30 12:36:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:11,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:11,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:11,417 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-08-30 12:36:11,418 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-08-30 12:36:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 12:36:11,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:11,551 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:11,552 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-08-30 12:36:11,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 12:36:11,739 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 16 treesize of output 18 [2023-08-30 12:36:11,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 12:36:11,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:11,797 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 16 treesize of output 18 [2023-08-30 12:36:11,860 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 12:36:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-30 12:36:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:11,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:12,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:12,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-08-30 12:36:12,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:12,190 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 1337 treesize of output 1315 [2023-08-30 12:36:12,224 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 490 treesize of output 458 [2023-08-30 12:36:12,253 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 460 treesize of output 444 [2023-08-30 12:36:12,762 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 12:36:12,764 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 9 treesize of output 5 [2023-08-30 12:36:12,771 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 24 treesize of output 20 [2023-08-30 12:36:12,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:12,783 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 450 treesize of output 426 [2023-08-30 12:36:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446323262] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:12,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:12,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-30 12:36:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853331752] [2023-08-30 12:36:12,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:12,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 12:36:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 12:36:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=664, Unknown=10, NotChecked=0, Total=812 [2023-08-30 12:36:13,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 449 [2023-08-30 12:36:13,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 222 transitions, 1779 flow. Second operand has 29 states, 29 states have (on average 169.6551724137931) internal successors, (4920), 29 states have internal predecessors, (4920), 0 states have call successors, (0), 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-08-30 12:36:13,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:13,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 449 [2023-08-30 12:36:13,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:14,632 INFO L130 PetriNetUnfolder]: 2326/4521 cut-off events. [2023-08-30 12:36:14,632 INFO L131 PetriNetUnfolder]: For 60644/61307 co-relation queries the response was YES. [2023-08-30 12:36:14,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25239 conditions, 4521 events. 2326/4521 cut-off events. For 60644/61307 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 30945 event pairs, 1131 based on Foata normal form. 35/4121 useless extension candidates. Maximal degree in co-relation 24972. Up to 3568 conditions per place. [2023-08-30 12:36:14,659 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 207 selfloop transitions, 38 changer transitions 3/254 dead transitions. [2023-08-30 12:36:14,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 254 transitions, 2502 flow [2023-08-30 12:36:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:36:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:36:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2023-08-30 12:36:14,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4060876020786934 [2023-08-30 12:36:14,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2023-08-30 12:36:14,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2023-08-30 12:36:14,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:14,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2023-08-30 12:36:14,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 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-08-30 12:36:14,665 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-08-30 12:36:14,665 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-08-30 12:36:14,665 INFO L175 Difference]: Start difference. First operand has 164 places, 222 transitions, 1779 flow. Second operand 6 states and 1094 transitions. [2023-08-30 12:36:14,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 254 transitions, 2502 flow [2023-08-30 12:36:14,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 254 transitions, 2199 flow, removed 132 selfloop flow, removed 8 redundant places. [2023-08-30 12:36:14,694 INFO L231 Difference]: Finished difference. Result has 161 places, 219 transitions, 1542 flow [2023-08-30 12:36:14,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1542, PETRI_PLACES=161, PETRI_TRANSITIONS=219} [2023-08-30 12:36:14,695 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 104 predicate places. [2023-08-30 12:36:14,695 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 219 transitions, 1542 flow [2023-08-30 12:36:14,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 169.6551724137931) internal successors, (4920), 29 states have internal predecessors, (4920), 0 states have call successors, (0), 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-08-30 12:36:14,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:14,696 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:14,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 12:36:14,900 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-08-30 12:36:14,901 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:14,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 2 times [2023-08-30 12:36:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030473140] [2023-08-30 12:36:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:15,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030473140] [2023-08-30 12:36:15,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030473140] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813146011] [2023-08-30 12:36:15,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 12:36:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:15,713 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-08-30 12:36:15,788 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-08-30 12:36:15,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 12:36:15,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:36:15,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 12:36:15,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:15,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:15,951 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:36:15,952 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-08-30 12:36:15,968 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:15,968 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-08-30 12:36:16,092 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-08-30 12:36:16,214 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-08-30 12:36:16,390 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-08-30 12:36:16,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:16,462 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-08-30 12:36:16,599 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-08-30 12:36:16,684 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 38 treesize of output 40 [2023-08-30 12:36:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:16,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:16,776 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 12:36:16,886 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int)) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 12:36:16,904 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_666) (< (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_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))) is different from false [2023-08-30 12:36:17,033 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_665) .cse3 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_665) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_666)))))) is different from false [2023-08-30 12:36:17,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_665) .cse4 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_665) (< (+ (select .cse2 .cse4) 1) v_ArrVal_666)))))) is different from false [2023-08-30 12:36:17,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_663 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 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_663)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_665) .cse4 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (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_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_665) (< (+ (select .cse2 .cse4) 1) v_ArrVal_666)))))) is different from false [2023-08-30 12:36:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:36:19,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813146011] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:19,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 12:36:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703777972] [2023-08-30 12:36:19,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:19,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 12:36:19,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 12:36:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=638, Unknown=20, NotChecked=354, Total=1190 [2023-08-30 12:36:19,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:36:19,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 219 transitions, 1542 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-08-30 12:36:19,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:19,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:36:19,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:40,992 WARN L222 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 155 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:36:46,261 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-08-30 12:36:48,269 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-08-30 12:36:51,611 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (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_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_666))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_666) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))))) is different from false [2023-08-30 12:36:54,675 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-08-30 12:36:54,921 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 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_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_671 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2023-08-30 12:36:55,973 INFO L130 PetriNetUnfolder]: 3070/5949 cut-off events. [2023-08-30 12:36:55,974 INFO L131 PetriNetUnfolder]: For 76868/77810 co-relation queries the response was YES. [2023-08-30 12:36:55,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32766 conditions, 5949 events. 3070/5949 cut-off events. For 76868/77810 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 42770 event pairs, 1086 based on Foata normal form. 33/5417 useless extension candidates. Maximal degree in co-relation 32383. Up to 2956 conditions per place. [2023-08-30 12:36:56,029 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 286 selfloop transitions, 142 changer transitions 3/437 dead transitions. [2023-08-30 12:36:56,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 437 transitions, 5328 flow [2023-08-30 12:36:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-30 12:36:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-30 12:36:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5106 transitions. [2023-08-30 12:36:56,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39213578066200755 [2023-08-30 12:36:56,049 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5106 transitions. [2023-08-30 12:36:56,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5106 transitions. [2023-08-30 12:36:56,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:56,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5106 transitions. [2023-08-30 12:36:56,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 176.06896551724137) internal successors, (5106), 29 states have internal predecessors, (5106), 0 states have call successors, (0), 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-08-30 12:36:56,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 449.0) internal successors, (13470), 30 states have internal predecessors, (13470), 0 states have call successors, (0), 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-08-30 12:36:56,094 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 449.0) internal successors, (13470), 30 states have internal predecessors, (13470), 0 states have call successors, (0), 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-08-30 12:36:56,094 INFO L175 Difference]: Start difference. First operand has 161 places, 219 transitions, 1542 flow. Second operand 29 states and 5106 transitions. [2023-08-30 12:36:56,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 437 transitions, 5328 flow [2023-08-30 12:36:56,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 437 transitions, 5277 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 12:36:56,192 INFO L231 Difference]: Finished difference. Result has 200 places, 297 transitions, 3111 flow [2023-08-30 12:36:56,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3111, PETRI_PLACES=200, PETRI_TRANSITIONS=297} [2023-08-30 12:36:56,194 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 143 predicate places. [2023-08-30 12:36:56,194 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 297 transitions, 3111 flow [2023-08-30 12:36:56,195 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-08-30 12:36:56,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:56,195 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:56,214 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-08-30 12:36:56,400 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-08-30 12:36:56,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:56,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -682370779, now seen corresponding path program 1 times [2023-08-30 12:36:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361704456] [2023-08-30 12:36:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:56,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361704456] [2023-08-30 12:36:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361704456] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909043400] [2023-08-30 12:36:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:56,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:56,829 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-08-30 12:36:56,836 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-08-30 12:36:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:56,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-30 12:36:56,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:56,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:56,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:56,962 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:36:56,965 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-08-30 12:36:56,972 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 12:36:56,972 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-08-30 12:36:57,035 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-08-30 12:36:57,092 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-08-30 12:36:57,193 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-08-30 12:36:57,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:57,231 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-08-30 12:36:57,298 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-08-30 12:36:57,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2023-08-30 12:36:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:57,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:57,510 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) is different from false [2023-08-30 12:36:57,520 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1) 2147483650)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) is different from false [2023-08-30 12:36:57,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_765 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_764)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_765) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1)))))) is different from false [2023-08-30 12:36:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 12:36:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909043400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:57,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2023-08-30 12:36:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858169270] [2023-08-30 12:36:57,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:57,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 12:36:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 12:36:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=387, Unknown=10, NotChecked=132, Total=650 [2023-08-30 12:36:57,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 449 [2023-08-30 12:36:57,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 297 transitions, 3111 flow. Second operand has 26 states, 26 states have (on average 178.07692307692307) internal successors, (4630), 26 states have internal predecessors, (4630), 0 states have call successors, (0), 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-08-30 12:36:57,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:57,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 449 [2023-08-30 12:36:57,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:01,603 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-08-30 12:37:04,530 INFO L130 PetriNetUnfolder]: 4784/9239 cut-off events. [2023-08-30 12:37:04,530 INFO L131 PetriNetUnfolder]: For 368637/370109 co-relation queries the response was YES. [2023-08-30 12:37:04,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71533 conditions, 9239 events. 4784/9239 cut-off events. For 368637/370109 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 71548 event pairs, 1938 based on Foata normal form. 85/8419 useless extension candidates. Maximal degree in co-relation 70708. Up to 2871 conditions per place. [2023-08-30 12:37:04,601 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 451 selfloop transitions, 120 changer transitions 4/581 dead transitions. [2023-08-30 12:37:04,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 581 transitions, 7663 flow [2023-08-30 12:37:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 12:37:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 12:37:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4674 transitions. [2023-08-30 12:37:04,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163919821826281 [2023-08-30 12:37:04,607 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4674 transitions. [2023-08-30 12:37:04,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4674 transitions. [2023-08-30 12:37:04,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:04,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4674 transitions. [2023-08-30 12:37:04,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 186.96) internal successors, (4674), 25 states have internal predecessors, (4674), 0 states have call successors, (0), 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-08-30 12:37:04,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 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-08-30 12:37:04,618 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 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-08-30 12:37:04,618 INFO L175 Difference]: Start difference. First operand has 200 places, 297 transitions, 3111 flow. Second operand 25 states and 4674 transitions. [2023-08-30 12:37:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 581 transitions, 7663 flow [2023-08-30 12:37:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 581 transitions, 6593 flow, removed 508 selfloop flow, removed 8 redundant places. [2023-08-30 12:37:04,725 INFO L231 Difference]: Finished difference. Result has 223 places, 337 transitions, 3425 flow [2023-08-30 12:37:04,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3425, PETRI_PLACES=223, PETRI_TRANSITIONS=337} [2023-08-30 12:37:04,726 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places. [2023-08-30 12:37:04,726 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 337 transitions, 3425 flow [2023-08-30 12:37:04,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 178.07692307692307) internal successors, (4630), 26 states have internal predecessors, (4630), 0 states have call successors, (0), 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-08-30 12:37:04,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:04,727 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:04,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 12:37:04,929 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-08-30 12:37:04,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:04,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 45335056, now seen corresponding path program 1 times [2023-08-30 12:37:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:04,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855522198] [2023-08-30 12:37:04,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:04,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:05,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855522198] [2023-08-30 12:37:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855522198] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774748063] [2023-08-30 12:37:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:05,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:05,861 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-08-30 12:37:05,862 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-08-30 12:37:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:05,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-30 12:37:05,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:05,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-30 12:37:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:05,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:06,001 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:37:06,001 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 12 treesize of output 20 [2023-08-30 12:37:06,018 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:37:06,019 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-08-30 12:37:06,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 12:37:06,164 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 12:37:06,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-30 12:37:06,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 12:37:06,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-30 12:37:06,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:06,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 12:37:06,351 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 12:37:06,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-30 12:37:06,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 12:37:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:06,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:06,467 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))) is different from false [2023-08-30 12:37:06,514 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_873 Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_873)) |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_873) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse3) 2147483647))))) is different from false [2023-08-30 12:37:06,559 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_873 Int) (v_ArrVal_871 Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_871) .cse3 v_ArrVal_873)) |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_873))))) is different from false [2023-08-30 12:37:06,601 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_873 Int) (v_ArrVal_871 Int) (v_ArrVal_869 Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 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_869)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_871) .cse3 v_ArrVal_873)) |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_873))))) is different from false [2023-08-30 12:37:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 12:37:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774748063] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:07,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-08-30 12:37:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700587285] [2023-08-30 12:37:07,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 12:37:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 12:37:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=498, Unknown=13, NotChecked=204, Total=870 [2023-08-30 12:37:07,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 12:37:07,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 337 transitions, 3425 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-08-30 12:37:07,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:07,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 12:37:07,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:08,533 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_875 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))))) is different from false [2023-08-30 12:37:10,777 INFO L130 PetriNetUnfolder]: 5945/11475 cut-off events. [2023-08-30 12:37:10,778 INFO L131 PetriNetUnfolder]: For 503313/505232 co-relation queries the response was YES. [2023-08-30 12:37:10,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90245 conditions, 11475 events. 5945/11475 cut-off events. For 503313/505232 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 92209 event pairs, 2541 based on Foata normal form. 115/10468 useless extension candidates. Maximal degree in co-relation 89377. Up to 7044 conditions per place. [2023-08-30 12:37:10,949 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 406 selfloop transitions, 137 changer transitions 3/552 dead transitions. [2023-08-30 12:37:10,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 552 transitions, 8229 flow [2023-08-30 12:37:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 12:37:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 12:37:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3492 transitions. [2023-08-30 12:37:10,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4093306763568163 [2023-08-30 12:37:10,963 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3492 transitions. [2023-08-30 12:37:10,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3492 transitions. [2023-08-30 12:37:10,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:10,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3492 transitions. [2023-08-30 12:37:10,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 183.78947368421052) internal successors, (3492), 19 states have internal predecessors, (3492), 0 states have call successors, (0), 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-08-30 12:37:10,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 449.0) internal successors, (8980), 20 states have internal predecessors, (8980), 0 states have call successors, (0), 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-08-30 12:37:10,972 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 449.0) internal successors, (8980), 20 states have internal predecessors, (8980), 0 states have call successors, (0), 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-08-30 12:37:10,972 INFO L175 Difference]: Start difference. First operand has 223 places, 337 transitions, 3425 flow. Second operand 19 states and 3492 transitions. [2023-08-30 12:37:10,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 552 transitions, 8229 flow [2023-08-30 12:37:11,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 552 transitions, 7860 flow, removed 167 selfloop flow, removed 12 redundant places. [2023-08-30 12:37:11,186 INFO L231 Difference]: Finished difference. Result has 241 places, 409 transitions, 4768 flow [2023-08-30 12:37:11,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3119, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4768, PETRI_PLACES=241, PETRI_TRANSITIONS=409} [2023-08-30 12:37:11,187 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 184 predicate places. [2023-08-30 12:37:11,187 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 409 transitions, 4768 flow [2023-08-30 12:37:11,188 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-08-30 12:37:11,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:11,188 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:11,222 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-08-30 12:37:11,392 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-08-30 12:37:11,393 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:11,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1223401707, now seen corresponding path program 1 times [2023-08-30 12:37:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117504438] [2023-08-30 12:37:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117504438] [2023-08-30 12:37:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117504438] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966696365] [2023-08-30 12:37:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:11,806 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-08-30 12:37:11,832 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-08-30 12:37:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:11,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-30 12:37:11,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:11,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:11,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:11,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:37:11,959 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-08-30 12:37:11,971 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:37:11,971 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-08-30 12:37:12,060 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-08-30 12:37:12,121 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-08-30 12:37:12,229 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-08-30 12:37:12,266 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-08-30 12:37:12,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:12,300 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-08-30 12:37:12,367 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-08-30 12:37:12,422 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 62 treesize of output 57 [2023-08-30 12:37:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:12,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:12,532 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_984) .cse1) 2147483650)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)))) is different from false [2023-08-30 12:37:12,541 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_984) .cse1)))))) is different from false [2023-08-30 12:37:12,551 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_984) .cse1)))))) is different from false [2023-08-30 12:37:12,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_984) .cse1) 2147483650))))) is different from false [2023-08-30 12:37:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:37:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966696365] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:12,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-30 12:37:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801701873] [2023-08-30 12:37:12,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:12,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 12:37:12,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:12,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 12:37:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=464, Unknown=15, NotChecked=196, Total=812 [2023-08-30 12:37:12,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 449 [2023-08-30 12:37:12,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 409 transitions, 4768 flow. Second operand has 29 states, 29 states have (on average 173.9655172413793) internal successors, (5045), 29 states have internal predecessors, (5045), 0 states have call successors, (0), 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-08-30 12:37:12,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:12,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 449 [2023-08-30 12:37:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:25,212 INFO L130 PetriNetUnfolder]: 7016/13757 cut-off events. [2023-08-30 12:37:25,213 INFO L131 PetriNetUnfolder]: For 665419/665683 co-relation queries the response was YES. [2023-08-30 12:37:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113443 conditions, 13757 events. 7016/13757 cut-off events. For 665419/665683 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 112277 event pairs, 2524 based on Foata normal form. 280/12753 useless extension candidates. Maximal degree in co-relation 113068. Up to 6553 conditions per place. [2023-08-30 12:37:25,358 INFO L137 encePairwiseOnDemand]: 425/449 looper letters, 420 selfloop transitions, 229 changer transitions 3/658 dead transitions. [2023-08-30 12:37:25,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 658 transitions, 10630 flow [2023-08-30 12:37:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 12:37:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 12:37:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4932 transitions. [2023-08-30 12:37:25,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40682999257609503 [2023-08-30 12:37:25,394 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4932 transitions. [2023-08-30 12:37:25,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4932 transitions. [2023-08-30 12:37:25,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:25,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4932 transitions. [2023-08-30 12:37:25,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 182.66666666666666) internal successors, (4932), 27 states have internal predecessors, (4932), 0 states have call successors, (0), 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-08-30 12:37:25,407 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-08-30 12:37:25,408 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-08-30 12:37:25,420 INFO L175 Difference]: Start difference. First operand has 241 places, 409 transitions, 4768 flow. Second operand 27 states and 4932 transitions. [2023-08-30 12:37:25,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 658 transitions, 10630 flow [2023-08-30 12:37:25,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 658 transitions, 10222 flow, removed 173 selfloop flow, removed 8 redundant places. [2023-08-30 12:37:25,679 INFO L231 Difference]: Finished difference. Result has 269 places, 489 transitions, 6673 flow [2023-08-30 12:37:25,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=6673, PETRI_PLACES=269, PETRI_TRANSITIONS=489} [2023-08-30 12:37:25,680 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 212 predicate places. [2023-08-30 12:37:25,680 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 489 transitions, 6673 flow [2023-08-30 12:37:25,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 173.9655172413793) internal successors, (5045), 29 states have internal predecessors, (5045), 0 states have call successors, (0), 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-08-30 12:37:25,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:25,681 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:25,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-30 12:37:25,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:25,885 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:25,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -661451598, now seen corresponding path program 1 times [2023-08-30 12:37:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124513634] [2023-08-30 12:37:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124513634] [2023-08-30 12:37:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124513634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:37:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:37:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:37:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363326541] [2023-08-30 12:37:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:37:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:37:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:37:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:37:25,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:37:25,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 489 transitions, 6673 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-08-30 12:37:25,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:25,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:37:25,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:28,612 INFO L130 PetriNetUnfolder]: 6709/13329 cut-off events. [2023-08-30 12:37:28,612 INFO L131 PetriNetUnfolder]: For 818940/819166 co-relation queries the response was YES. [2023-08-30 12:37:28,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119715 conditions, 13329 events. 6709/13329 cut-off events. For 818940/819166 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 109616 event pairs, 3863 based on Foata normal form. 61/12302 useless extension candidates. Maximal degree in co-relation 119289. Up to 12257 conditions per place. [2023-08-30 12:37:28,739 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 446 selfloop transitions, 1 changer transitions 3/482 dead transitions. [2023-08-30 12:37:28,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 482 transitions, 7602 flow [2023-08-30 12:37:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:37:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:37:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-08-30 12:37:28,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-08-30 12:37:28,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-08-30 12:37:28,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-08-30 12:37:28,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:28,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-08-30 12:37:28,742 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-08-30 12:37:28,742 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-08-30 12:37:28,743 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-08-30 12:37:28,744 INFO L175 Difference]: Start difference. First operand has 269 places, 489 transitions, 6673 flow. Second operand 3 states and 723 transitions. [2023-08-30 12:37:28,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 482 transitions, 7602 flow [2023-08-30 12:37:29,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 482 transitions, 6875 flow, removed 332 selfloop flow, removed 10 redundant places. [2023-08-30 12:37:29,064 INFO L231 Difference]: Finished difference. Result has 259 places, 474 transitions, 5772 flow [2023-08-30 12:37:29,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5770, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5772, PETRI_PLACES=259, PETRI_TRANSITIONS=474} [2023-08-30 12:37:29,065 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 202 predicate places. [2023-08-30 12:37:29,065 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 474 transitions, 5772 flow [2023-08-30 12:37:29,065 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-08-30 12:37:29,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:29,065 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:29,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 12:37:29,066 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:29,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:29,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1804361209, now seen corresponding path program 1 times [2023-08-30 12:37:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737470699] [2023-08-30 12:37:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 12:37:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737470699] [2023-08-30 12:37:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737470699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:37:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:37:29,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:37:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054832857] [2023-08-30 12:37:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:37:29,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:37:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:37:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:37:29,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:37:29,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 474 transitions, 5772 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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-08-30 12:37:29,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:29,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:37:29,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:31,699 INFO L130 PetriNetUnfolder]: 6496/13014 cut-off events. [2023-08-30 12:37:31,699 INFO L131 PetriNetUnfolder]: For 768104/768554 co-relation queries the response was YES. [2023-08-30 12:37:31,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113305 conditions, 13014 events. 6496/13014 cut-off events. For 768104/768554 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 107724 event pairs, 3929 based on Foata normal form. 145/12147 useless extension candidates. Maximal degree in co-relation 112881. Up to 8694 conditions per place. [2023-08-30 12:37:31,952 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 378 selfloop transitions, 55 changer transitions 0/465 dead transitions. [2023-08-30 12:37:31,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 465 transitions, 6667 flow [2023-08-30 12:37:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:37:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:37:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-08-30 12:37:31,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-08-30 12:37:31,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-08-30 12:37:31,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-08-30 12:37:31,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:31,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-08-30 12:37:31,955 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-08-30 12:37:31,956 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-08-30 12:37:31,956 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-08-30 12:37:31,956 INFO L175 Difference]: Start difference. First operand has 259 places, 474 transitions, 5772 flow. Second operand 3 states and 717 transitions. [2023-08-30 12:37:31,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 465 transitions, 6667 flow [2023-08-30 12:37:32,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 465 transitions, 6666 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:37:32,232 INFO L231 Difference]: Finished difference. Result has 259 places, 458 transitions, 5696 flow [2023-08-30 12:37:32,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5586, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5696, PETRI_PLACES=259, PETRI_TRANSITIONS=458} [2023-08-30 12:37:32,233 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 202 predicate places. [2023-08-30 12:37:32,233 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 458 transitions, 5696 flow [2023-08-30 12:37:32,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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-08-30 12:37:32,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:32,234 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-08-30 12:37:32,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 12:37:32,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:32,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -967172951, now seen corresponding path program 1 times [2023-08-30 12:37:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005867862] [2023-08-30 12:37:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005867862] [2023-08-30 12:37:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005867862] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739964778] [2023-08-30 12:37:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:32,296 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-08-30 12:37:32,303 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-08-30 12:37:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:32,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 12:37:32,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:32,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739964778] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:32,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:32,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 12:37:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62128499] [2023-08-30 12:37:32,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:32,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:37:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:32,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:37:32,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:37:32,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:37:32,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 458 transitions, 5696 flow. Second operand has 7 states, 7 states have (on average 227.42857142857142) internal successors, (1592), 7 states have internal predecessors, (1592), 0 states have call successors, (0), 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-08-30 12:37:32,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:32,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:37:32,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:34,483 INFO L130 PetriNetUnfolder]: 4583/9221 cut-off events. [2023-08-30 12:37:34,483 INFO L131 PetriNetUnfolder]: For 647669/647947 co-relation queries the response was YES. [2023-08-30 12:37:34,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95455 conditions, 9221 events. 4583/9221 cut-off events. For 647669/647947 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 66699 event pairs, 2144 based on Foata normal form. 243/8926 useless extension candidates. Maximal degree in co-relation 94996. Up to 4038 conditions per place. [2023-08-30 12:37:34,572 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 446 selfloop transitions, 33 changer transitions 0/511 dead transitions. [2023-08-30 12:37:34,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 511 transitions, 8006 flow [2023-08-30 12:37:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:37:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:37:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-30 12:37:34,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289532293986637 [2023-08-30 12:37:34,581 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-30 12:37:34,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-30 12:37:34,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:34,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-30 12:37:34,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 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-08-30 12:37:34,597 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-08-30 12:37:34,597 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-08-30 12:37:34,597 INFO L175 Difference]: Start difference. First operand has 259 places, 458 transitions, 5696 flow. Second operand 6 states and 1425 transitions. [2023-08-30 12:37:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 511 transitions, 8006 flow [2023-08-30 12:37:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 511 transitions, 7922 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-30 12:37:34,855 INFO L231 Difference]: Finished difference. Result has 267 places, 457 transitions, 5807 flow [2023-08-30 12:37:34,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5807, PETRI_PLACES=267, PETRI_TRANSITIONS=457} [2023-08-30 12:37:34,857 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 210 predicate places. [2023-08-30 12:37:34,857 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 457 transitions, 5807 flow [2023-08-30 12:37:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.42857142857142) internal successors, (1592), 7 states have internal predecessors, (1592), 0 states have call successors, (0), 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-08-30 12:37:34,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:34,858 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:34,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 12:37:35,062 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-08-30 12:37:35,062 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:35,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -66120868, now seen corresponding path program 3 times [2023-08-30 12:37:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687211457] [2023-08-30 12:37:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687211457] [2023-08-30 12:37:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687211457] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797229154] [2023-08-30 12:37:36,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 12:37:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:36,349 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-08-30 12:37:36,351 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-08-30 12:37:36,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 12:37:36,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:37:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 87 conjunts are in the unsatisfiable core [2023-08-30 12:37:36,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:36,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-30 12:37:36,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:36,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:36,674 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:37:36,674 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 12 treesize of output 20 [2023-08-30 12:37:36,694 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-30 12:37:36,694 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-08-30 12:37:36,852 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-30 12:37:36,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-30 12:37:36,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-30 12:37:37,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-30 12:37:37,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:37,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 12:37:37,191 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-30 12:37:37,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-30 12:37:37,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-30 12:37:37,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 12:37:37,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-30 12:37:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:37,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 12:37:37,489 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-30 12:37:37,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-30 12:37:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:37,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:37,673 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1273 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1271)))) is different from false [2023-08-30 12:37:37,687 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1271) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 12:37:37,710 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1271)))))) is different from false [2023-08-30 12:37:37,732 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int 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|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1268) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1271)))))) is different from false [2023-08-30 12:37:37,757 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1268) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1271))))))) is different from false [2023-08-30 12:37:37,783 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (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_1267)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1271) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_1268))))))) is different from false [2023-08-30 12:37:37,808 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1271) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1268) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse3) 2147483647)))))))) is different from false [2023-08-30 12:37:37,829 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1271) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1268) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|))))))))) is different from false [2023-08-30 12:37:37,857 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1268) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1271) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1263))))))))) is different from false [2023-08-30 12:37:37,888 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1268) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1271) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1263) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse1) 2147483647)))))))))) is different from false [2023-08-30 12:37:38,155 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse6 .cse11))) (or (= 400 .cse0) (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1261) .cse11 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse8 .cse5 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse9 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1271) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ .cse0 1) v_ArrVal_1263) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1261) (< (+ (select .cse8 .cse5) 1) v_ArrVal_1268))))))))))))) is different from false [2023-08-30 12:37:38,216 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (v_ArrVal_1260 Int) (v_ArrVal_1271 Int) (v_ArrVal_1261 Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1267 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_1260)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1261) .cse9 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse6 (select .cse7 .cse9))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1271) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1268) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ .cse6 1) v_ArrVal_1263) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse3) 2147483647) (= 400 .cse6) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1261)))))))))) is different from false [2023-08-30 12:37:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-30 12:37:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797229154] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:43,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 54 [2023-08-30 12:37:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264091331] [2023-08-30 12:37:43,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:43,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-30 12:37:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-30 12:37:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1434, Unknown=27, NotChecked=1140, Total=3080 [2023-08-30 12:37:43,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 449 [2023-08-30 12:37:43,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 457 transitions, 5807 flow. Second operand has 56 states, 56 states have (on average 167.28571428571428) internal successors, (9368), 56 states have internal predecessors, (9368), 0 states have call successors, (0), 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-08-30 12:37:43,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:43,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 449 [2023-08-30 12:37:43,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:54,886 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 149 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:37:56,925 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-08-30 12:37:59,140 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-08-30 12:38:01,151 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-08-30 12:38:03,158 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-08-30 12:38:05,165 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-08-30 12:38:07,174 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-08-30 12:38:09,181 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-08-30 12:38:11,188 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-08-30 12:38:13,194 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-08-30 12:38:15,200 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-08-30 12:38:17,211 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-08-30 12:38:31,124 WARN L222 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 123 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:38:45,295 WARN L222 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 187 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:38:47,329 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-08-30 12:38:57,952 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-08-30 12:38:59,966 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-08-30 12:39:02,096 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-08-30 12:39:04,105 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-08-30 12:39:06,116 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-08-30 12:39:08,127 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-08-30 12:39:10,134 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-08-30 12:39:12,143 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-08-30 12:39:14,151 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-08-30 12:39:16,162 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-08-30 12:39:18,174 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-08-30 12:39:20,182 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-08-30 12:39:22,190 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-08-30 12:39:24,200 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-08-30 12:39:26,238 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-08-30 12:39:53,449 WARN L222 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 165 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:40:08,078 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 125 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:40:10,082 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-08-30 12:40:34,736 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-08-30 12:40:36,747 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-08-30 12:40:38,804 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-08-30 12:40:40,818 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-08-30 12:40:42,824 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-08-30 12:40:44,829 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-08-30 12:40:46,837 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-08-30 12:40:48,850 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-08-30 12:40:59,346 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-08-30 12:41:04,281 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-08-30 12:41:32,635 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-08-30 12:41:34,646 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-08-30 12:41:36,655 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-08-30 12:41:59,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:42:01,073 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-08-30 12:42:03,093 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-08-30 12:42:05,120 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-08-30 12:42:05,137 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse21 (select .cse9 .cse10))) (let ((.cse4 (+ .cse21 1)) (.cse11 (= 400 .cse21)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1261) .cse10 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1271) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< .cse4 v_ArrVal_1263) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1261) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1268))))))))) .cse11) (or (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse12 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store .cse12 .cse5 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse13 (select .cse16 |c_~#queue~0.base|))) (let ((.cse15 (select (store (store .cse16 |c_~#queue~0.base| (store .cse13 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse12 .cse5) 1) v_ArrVal_1268) (< (+ (select .cse13 .cse1) 1) v_ArrVal_1271) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< .cse4 v_ArrVal_1263) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647))))))))) .cse11) (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse19 (select .cse20 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse18 (select (store (store .cse20 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse10 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse18 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse18 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647) (< (+ (select .cse19 .cse10) 1) v_ArrVal_1271)))))))))) is different from false [2023-08-30 12:42:07,189 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-08-30 12:42:09,219 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-08-30 12:42:11,229 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-08-30 12:42:13,240 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-08-30 12:42: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 [1] [2023-08-30 12:42:17,265 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-08-30 12:42:19,275 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-08-30 12:42:21,285 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-08-30 12:42:23,295 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-08-30 12:42:25,304 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-08-30 12:42:27,319 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-08-30 12:42:29,407 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-08-30 12:42:31,434 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-08-30 12:42:47,670 WARN L222 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 157 DAG size of output: 109 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:42:49,701 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-08-30 12:42:51,724 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-08-30 12:42:53,767 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-08-30 12:42:55,777 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-08-30 12:43:18,580 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-08-30 12:43:20,614 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-08-30 12:43:22,619 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-08-30 12:43:24,633 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-08-30 12:43:26,667 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-08-30 12:43:28,687 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-08-30 12:43:30,707 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-08-30 12:43:32,724 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-08-30 12:43:34,730 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-08-30 12:43:36,744 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-08-30 12:43:38,754 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-08-30 12:43:40,766 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-08-30 12:43:40,839 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse18 (select .cse9 .cse10))) (let ((.cse4 (+ .cse18 1)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (= 400 .cse18))) (and (or (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1261 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1261) .cse10 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1271) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< .cse4 v_ArrVal_1263) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1261) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1268))))))))) .cse11) (or (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse12 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store .cse12 .cse5 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse13 (select .cse16 |c_~#queue~0.base|))) (let ((.cse15 (select (store (store .cse16 |c_~#queue~0.base| (store .cse13 .cse1 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse12 .cse5) 1) v_ArrVal_1268) (< (+ (select .cse13 .cse1) 1) v_ArrVal_1271) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< .cse4 v_ArrVal_1263) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse5) 2147483647))))))))) .cse11))))) is different from false [2023-08-30 12:43:40,940 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse10 .cse11))) (let ((.cse0 (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1275 Int) (v_ArrVal_1263 Int) (v_ArrVal_1268 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_1263)) |c_~#stored_elements~0.base| v_ArrVal_1265))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1267)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_1268) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1271) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ .cse1 1) v_ArrVal_1263) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse3) 2147483647))))))))))) (and .cse0 (or .cse0 (= 400 .cse1)))))) is different from false [2023-08-30 12:43:42,983 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-08-30 12:43:43,553 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1268)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1270))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1271)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1268) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1271)))))))) is different from false [2023-08-30 12:43:43,647 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1275 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1275) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)))))) is different from false [2023-08-30 12:43:45,362 INFO L130 PetriNetUnfolder]: 5481/10912 cut-off events. [2023-08-30 12:43:45,362 INFO L131 PetriNetUnfolder]: For 808849/809189 co-relation queries the response was YES. [2023-08-30 12:43:45,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119887 conditions, 10912 events. 5481/10912 cut-off events. For 808849/809189 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 80421 event pairs, 2151 based on Foata normal form. 204/10573 useless extension candidates. Maximal degree in co-relation 118612. Up to 6214 conditions per place. [2023-08-30 12:43:45,480 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 404 selfloop transitions, 373 changer transitions 3/786 dead transitions. [2023-08-30 12:43:45,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 786 transitions, 17976 flow [2023-08-30 12:43:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-30 12:43:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-30 12:43:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 8976 transitions. [2023-08-30 12:43:45,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38444406373136886 [2023-08-30 12:43:45,486 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 8976 transitions. [2023-08-30 12:43:45,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 8976 transitions. [2023-08-30 12:43:45,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:43:45,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 8976 transitions. [2023-08-30 12:43:45,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 172.6153846153846) internal successors, (8976), 52 states have internal predecessors, (8976), 0 states have call successors, (0), 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-08-30 12:43:45,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 449.0) internal successors, (23797), 53 states have internal predecessors, (23797), 0 states have call successors, (0), 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-08-30 12:43:45,506 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 449.0) internal successors, (23797), 53 states have internal predecessors, (23797), 0 states have call successors, (0), 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-08-30 12:43:45,506 INFO L175 Difference]: Start difference. First operand has 267 places, 457 transitions, 5807 flow. Second operand 52 states and 8976 transitions. [2023-08-30 12:43:45,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 786 transitions, 17976 flow [2023-08-30 12:43:45,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 786 transitions, 17937 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-30 12:43:45,847 INFO L231 Difference]: Finished difference. Result has 345 places, 649 transitions, 12384 flow [2023-08-30 12:43:45,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5746, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=12384, PETRI_PLACES=345, PETRI_TRANSITIONS=649} [2023-08-30 12:43:45,850 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places. [2023-08-30 12:43:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 649 transitions, 12384 flow [2023-08-30 12:43:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 167.28571428571428) internal successors, (9368), 56 states have internal predecessors, (9368), 0 states have call successors, (0), 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-08-30 12:43:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:43:45,851 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:43:45,857 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-08-30 12:43:46,057 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-08-30 12:43:46,058 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:43:46,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:43:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash -228871586, now seen corresponding path program 4 times [2023-08-30 12:43:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:43:46,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254018563] [2023-08-30 12:43:46,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:43:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:43:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:43:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:43:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:43:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254018563] [2023-08-30 12:43:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254018563] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:43:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043893630] [2023-08-30 12:43:47,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 12:43:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:43:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:43:47,212 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-08-30 12:43:47,214 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-08-30 12:43:47,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 12:43:47,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:43:47,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 101 conjunts are in the unsatisfiable core [2023-08-30 12:43:47,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:43:47,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:43:47,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:43:47,384 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:43:47,384 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-08-30 12:43:47,396 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:43:47,397 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-08-30 12:43:47,481 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-08-30 12:43:47,566 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-08-30 12:43:47,698 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-08-30 12:43:47,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:43:47,842 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-08-30 12:43:47,934 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-08-30 12:43:48,137 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-08-30 12:43:48,598 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-08-30 12:43:52,725 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-08-30 12:43:53,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:43:53,799 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-08-30 12:43:54,298 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-08-30 12:43:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:43:59,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:44:00,180 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1401 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|)))) is different from false [2023-08-30 12:44:04,292 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (v_ArrVal_1396 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1401 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1396)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1396) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|))))) is different from false [2023-08-30 12:44:15,697 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1394 Int) (v_ArrVal_1393 Int) (v_ArrVal_1396 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1401 Int) (v_ArrVal_1391 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1391))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1393)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1394) .cse1 v_ArrVal_1396)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (= 400 .cse2) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1394) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) (< (+ .cse2 1) v_ArrVal_1396))))))) is different from false [2023-08-30 12:44:17,453 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1394 Int) (v_ArrVal_1393 Int) (v_ArrVal_1396 Int) (v_ArrVal_1387 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1389 Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1401 Int) (v_ArrVal_1391 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse6 v_ArrVal_1389)) |c_~#stored_elements~0.base| v_ArrVal_1391))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1393)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1394) .cse1 v_ArrVal_1396)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) .cse2) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1387) (= 400 .cse3) (< (+ .cse3 1) v_ArrVal_1396) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1394) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1389) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))))) is different from false [2023-08-30 12:44:17,514 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1394 Int) (v_ArrVal_1393 Int) (v_ArrVal_1396 Int) (v_ArrVal_1387 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1389 Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1401 Int) (v_ArrVal_1391 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1387) .cse7 v_ArrVal_1389)) |c_~#stored_elements~0.base| v_ArrVal_1391))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1393)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1394) .cse1 v_ArrVal_1396)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1387) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) .cse4) 2147483647) (= 400 .cse5) (< (+ .cse5 1) v_ArrVal_1396) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1394) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1389) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))))) is different from false [2023-08-30 12:44:17,586 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1391 (Array Int Int)) (v_ArrVal_1394 Int) (v_ArrVal_1393 Int) (v_ArrVal_1385 Int) (v_ArrVal_1396 Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 Int) (v_ArrVal_1401 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_1385)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1387) .cse8 v_ArrVal_1389)) |c_~#stored_elements~0.base| v_ArrVal_1391))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1393)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse2 .cse5)) (.cse4 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1394) .cse5 v_ArrVal_1396)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1398) |c_~#stored_elements~0.base| v_ArrVal_1399) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1387) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1394) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) (= .cse6 400) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ .cse6 1) v_ArrVal_1396) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_83|) |c_~#queue~0.offset|) v_ArrVal_1401) .cse3) 2147483647) (< (+ (select .cse0 .cse8) 1) v_ArrVal_1389)))))))) is different from false [2023-08-30 12:44:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-30 12:44:25,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043893630] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:44:25,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:44:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 19] total 53 [2023-08-30 12:44:25,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348530563] [2023-08-30 12:44:25,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:44:25,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 12:44:25,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:44:25,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 12:44:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1747, Unknown=76, NotChecked=594, Total=2970 [2023-08-30 12:44:25,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:44:25,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 649 transitions, 12384 flow. Second operand has 55 states, 55 states have (on average 168.3090909090909) internal successors, (9257), 55 states have internal predecessors, (9257), 0 states have call successors, (0), 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-08-30 12:44:25,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:44:25,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:44:25,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:44:33,080 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-08-30 12:44:35,167 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-08-30 12:44:39,881 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-08-30 12:44:44,344 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-08-30 12:44:48,832 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-08-30 12:44:53,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] [2023-08-30 12:44:55,776 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-08-30 12:45:01,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:45:03,256 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-08-30 12:45:11,741 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-08-30 12:45:19,182 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-08-30 12:45:21,233 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-08-30 12:45:23,257 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-08-30 12:45:27,715 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-08-30 12:45:29,721 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-08-30 12:45:31,728 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-08-30 12:45:33,756 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-08-30 12:45:35,775 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-08-30 12:45:37,807 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-08-30 12:45:52,499 WARN L222 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:45:54,505 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-08-30 12:46:01,377 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-08-30 12:46:43,952 WARN L222 SmtUtils]: Spent 10.32s on a formula simplification. DAG size of input: 106 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:46:57,294 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-08-30 12:46:58,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:03,373 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-08-30 12:47:05,379 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-08-30 12:47:07,385 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-08-30 12:47:09,396 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-08-30 12:47:33,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, 1] [2023-08-30 12:47:35,356 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-08-30 12:47:37,364 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-08-30 12:47:39,370 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-08-30 12:47:41,376 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-08-30 12:47:43,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-08-30 12:47:45,388 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-08-30 12:47:47,395 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-08-30 12:47:49,400 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-08-30 12:47:51,406 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-08-30 12:47:53,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 [0, 1] [2023-08-30 12:47:55,419 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-08-30 12:47:57,426 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-08-30 12:47:59,561 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-08-30 12:48:01,567 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-08-30 12:48:03,573 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-08-30 12:48:05,580 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-08-30 12:48:21,499 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-08-30 12:48:23,505 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-08-30 12:48:25,511 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-08-30 12:48:27,519 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-08-30 12:48:29,525 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-08-30 12:48:31,532 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-08-30 12:48:33,537 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-08-30 12:48:35,543 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-08-30 12:48:37,553 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-08-30 12:48:39,559 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-08-30 12:48:41,564 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-08-30 12:48:43,570 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-08-30 12:48:45,576 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-08-30 12:48:47,586 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] Killed by 15