./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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_longest.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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 08:11:16,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 08:11:16,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 08:11:16,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 08:11:16,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 08:11:16,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 08:11:16,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 08:11:16,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 08:11:16,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 08:11:16,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 08:11:16,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 08:11:16,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 08:11:16,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 08:11:16,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 08:11:16,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 08:11:16,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 08:11:16,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 08:11:16,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 08:11:16,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 08:11:16,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 08:11:16,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 08:11:16,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 08:11:16,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 08:11:16,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 08:11:16,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 08:11:16,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 08:11:16,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 08:11:16,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 08:11:16,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 08:11:16,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 08:11:16,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 08:11:16,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 08:11:16,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 08:11:16,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 08:11:16,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 08:11:16,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 08:11:16,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 08:11:16,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 08:11:16,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 08:11:16,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 08:11:16,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 08:11:16,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 08:11:16,451 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 08:11:16,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 08:11:16,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 08:11:16,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 08:11:16,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 08:11:16,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 08:11:16,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 08:11:16,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 08:11:16,455 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 08:11:16,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 08:11:16,456 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 08:11:16,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 08:11:16,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 08:11:16,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 08:11:16,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 08:11:16,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 08:11:16,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 08:11:16,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 08:11:16,457 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 08:11:16,457 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 08:11:16,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 08:11:16,458 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 08:11:16,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 08:11:16,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 08:11:16,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 08:11:16,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 08:11:16,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:11:16,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 08:11:16,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 08:11:16,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 08:11:16,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 08:11:16,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 08:11:16,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 08:11:16,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 08:11:16,461 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 08:11:16,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 08:11:16,461 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 08:11:16,461 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d 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 -> AFTER [2023-08-30 08:11:16,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 08:11:16,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 08:11:16,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 08:11:16,774 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 08:11:16,774 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 08:11:16,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 08:11:17,915 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 08:11:18,176 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 08:11:18,177 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 08:11:18,193 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bba99ba/e4c904dcc2ed425f8601c9468aa7e196/FLAG3888498b5 [2023-08-30 08:11:18,489 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bba99ba/e4c904dcc2ed425f8601c9468aa7e196 [2023-08-30 08:11:18,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 08:11:18,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 08:11:18,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 08:11:18,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 08:11:18,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 08:11:18,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:11:18" (1/1) ... [2023-08-30 08:11:18,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7856c0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:18, skipping insertion in model container [2023-08-30 08:11:18,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:11:18" (1/1) ... [2023-08-30 08:11:18,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 08:11:18,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 08:11:19,024 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_longest.i[43280,43293] [2023-08-30 08:11:19,030 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_longest.i[43553,43566] [2023-08-30 08:11:19,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:11:19,049 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 08:11:19,110 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_longest.i[43280,43293] [2023-08-30 08:11:19,116 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_longest.i[43553,43566] [2023-08-30 08:11:19,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:11:19,194 INFO L208 MainTranslator]: Completed translation [2023-08-30 08:11:19,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19 WrapperNode [2023-08-30 08:11:19,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 08:11:19,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 08:11:19,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 08:11:19,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 08:11:19,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,264 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-08-30 08:11:19,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 08:11:19,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 08:11:19,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 08:11:19,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 08:11:19,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 08:11:19,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 08:11:19,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 08:11:19,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 08:11:19,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (1/1) ... [2023-08-30 08:11:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:11:19,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:11:19,362 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 08:11:19,382 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 08:11:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 08:11:19,395 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 08:11:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 08:11:19,395 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 08:11:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 08:11:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 08:11:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 08:11:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 08:11:19,398 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 08:11:19,550 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 08:11:19,551 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 08:11:19,940 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 08:11:19,948 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 08:11:19,949 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 08:11:19,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:11:19 BoogieIcfgContainer [2023-08-30 08:11:19,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 08:11:19,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 08:11:19,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 08:11:19,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 08:11:19,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:11:18" (1/3) ... [2023-08-30 08:11:19,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a13b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:11:19, skipping insertion in model container [2023-08-30 08:11:19,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:19" (2/3) ... [2023-08-30 08:11:19,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a13b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:11:19, skipping insertion in model container [2023-08-30 08:11:19,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:11:19" (3/3) ... [2023-08-30 08:11:19,958 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-30 08:11:19,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 08:11:19,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 08:11:19,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 08:11:19,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 08:11:20,083 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 08:11:20,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 08:11:20,243 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-08-30 08:11:20,244 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 08:11:20,252 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 08:11:20,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 08:11:20,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:20,264 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 08:11:20,273 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:20,278 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:20,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:20,331 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-08-30 08:11:20,333 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:11:20,338 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 08:11:20,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-08-30 08:11:27,963 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-08-30 08:11:27,963 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-08-30 08:11:27,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 08:11:27,981 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;@5c1a1eda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 08:11:27,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 08:11:27,986 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 08:11:27,986 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:11:27,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:27,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:27,987 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 08:11:27,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-08-30 08:11:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549482178] [2023-08-30 08:11:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:29,314 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 08:11:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549482178] [2023-08-30 08:11:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549482178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:11:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492212232] [2023-08-30 08:11:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:29,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:11:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:29,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:11:29,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:11:29,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 08:11:29,901 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 08:11:29,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:29,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 08:11:29,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:30,375 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-08-30 08:11:30,377 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 08:11:30,379 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 08:11:30,391 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-30 08:11:30,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-08-30 08:11:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-30 08:11:30,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-08-30 08:11:30,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-30 08:11:30,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-30 08:11:30,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:30,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-30 08:11:30,425 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 08:11:30,434 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 08:11:30,435 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 08:11:30,437 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-08-30 08:11:30,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-08-30 08:11:30,442 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 08:11:30,445 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-08-30 08:11:30,446 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 08:11:30,450 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-30 08:11:30,451 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-08-30 08:11:30,452 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 08:11:30,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:30,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:30,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 08:11:30,455 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 08:11:30,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-08-30 08:11:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845161060] [2023-08-30 08:11:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:31,304 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 08:11:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845161060] [2023-08-30 08:11:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845161060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:31,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:31,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239136658] [2023-08-30 08:11:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:31,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:31,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:31,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 08:11:31,983 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 08:11:31,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:31,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 08:11:31,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:32,595 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-08-30 08:11:32,596 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-30 08:11:32,600 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 08:11:32,613 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-08-30 08:11:32,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-08-30 08:11:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-08-30 08:11:32,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-08-30 08:11:32,617 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-08-30 08:11:32,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-08-30 08:11:32,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:32,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-08-30 08:11:32,621 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 08:11:32,625 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 08:11:32,627 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 08:11:32,627 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-08-30 08:11:32,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-08-30 08:11:32,634 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 08:11:32,637 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-08-30 08:11:32,637 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 08:11:32,638 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-08-30 08:11:32,638 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-08-30 08:11:32,639 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 08:11:32,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:32,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 08:11:32,640 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 08:11:32,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-08-30 08:11:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996467861] [2023-08-30 08:11:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:33,024 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 08:11:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996467861] [2023-08-30 08:11:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996467861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109833932] [2023-08-30 08:11:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:33,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 08:11:33,240 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 08:11:33,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:33,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 08:11:33,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:33,696 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-08-30 08:11:33,696 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 08:11:33,702 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 08:11:33,714 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 08:11:33,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-08-30 08:11:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 08:11:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 08:11:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-30 08:11:33,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-08-30 08:11:33,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-30 08:11:33,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-30 08:11:33,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:33,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-30 08:11:33,721 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 08:11:33,725 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 08:11:33,726 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 08:11:33,726 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-08-30 08:11:33,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-08-30 08:11:33,736 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 08:11:33,739 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-08-30 08:11:33,739 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 08:11:33,741 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-30 08:11:33,741 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-08-30 08:11:33,742 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 08:11:33,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:33,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:33,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 08:11:33,743 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 08:11:33,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-08-30 08:11:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352310903] [2023-08-30 08:11:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:33,811 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 08:11:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352310903] [2023-08-30 08:11:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352310903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:33,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:33,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:11:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259630918] [2023-08-30 08:11:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 08:11:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:33,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 08:11:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 08:11:33,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-08-30 08:11:33,835 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 08:11:33,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:33,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-08-30 08:11:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:34,454 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-08-30 08:11:34,455 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-08-30 08:11:34,464 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 08:11:34,487 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-08-30 08:11:34,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-08-30 08:11:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 08:11:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 08:11:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 08:11:34,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-08-30 08:11:34,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 08:11:34,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 08:11:34,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:34,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 08:11:34,498 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 08:11:34,502 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 08:11:34,503 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 08:11:34,503 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-08-30 08:11:34,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-08-30 08:11:34,509 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 08:11:34,512 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-08-30 08:11:34,512 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 08:11:34,514 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-30 08:11:34,514 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-08-30 08:11:34,514 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 08:11:34,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:34,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:34,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 08:11:34,515 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 08:11:34,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-08-30 08:11:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515060709] [2023-08-30 08:11:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:35,063 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 08:11:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515060709] [2023-08-30 08:11:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515060709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:35,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805671366] [2023-08-30 08:11:35,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:35,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:35,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 08:11:35,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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 08:11:35,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:35,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 08:11:35,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:36,379 INFO L130 PetriNetUnfolder]: 3845/6364 cut-off events. [2023-08-30 08:11:36,380 INFO L131 PetriNetUnfolder]: For 2574/2584 co-relation queries the response was YES. [2023-08-30 08:11:36,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 6364 events. 3845/6364 cut-off events. For 2574/2584 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 38002 event pairs, 2036 based on Foata normal form. 0/5037 useless extension candidates. Maximal degree in co-relation 9951. Up to 5400 conditions per place. [2023-08-30 08:11:36,429 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 99 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2023-08-30 08:11:36,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 718 flow [2023-08-30 08:11:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:11:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:11:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1582 transitions. [2023-08-30 08:11:36,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033407572383074 [2023-08-30 08:11:36,434 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1582 transitions. [2023-08-30 08:11:36,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1582 transitions. [2023-08-30 08:11:36,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:36,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1582 transitions. [2023-08-30 08:11:36,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 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 08:11:36,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:36,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:36,442 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 7 states and 1582 transitions. [2023-08-30 08:11:36,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 718 flow [2023-08-30 08:11:36,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:11:36,453 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 465 flow [2023-08-30 08:11:36,454 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2023-08-30 08:11:36,456 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-08-30 08:11:36,456 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 465 flow [2023-08-30 08:11:36,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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 08:11:36,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:36,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:36,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 08:11:36,457 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 08:11:36,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-08-30 08:11:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92337268] [2023-08-30 08:11:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:37,178 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 08:11:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92337268] [2023-08-30 08:11:37,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92337268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 08:11:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389867387] [2023-08-30 08:11:37,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:37,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:11:37,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:37,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:11:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:11:37,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 08:11:37,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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 08:11:37,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:37,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 08:11:37,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:39,180 INFO L130 PetriNetUnfolder]: 5335/8653 cut-off events. [2023-08-30 08:11:39,180 INFO L131 PetriNetUnfolder]: For 3350/3382 co-relation queries the response was YES. [2023-08-30 08:11:39,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22979 conditions, 8653 events. 5335/8653 cut-off events. For 3350/3382 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 53337 event pairs, 1036 based on Foata normal form. 195/7266 useless extension candidates. Maximal degree in co-relation 20634. Up to 5366 conditions per place. [2023-08-30 08:11:39,239 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 184 selfloop transitions, 27 changer transitions 0/218 dead transitions. [2023-08-30 08:11:39,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 218 transitions, 1296 flow [2023-08-30 08:11:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:11:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:11:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1643 transitions. [2023-08-30 08:11:39,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227489659560929 [2023-08-30 08:11:39,244 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1643 transitions. [2023-08-30 08:11:39,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1643 transitions. [2023-08-30 08:11:39,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:39,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1643 transitions. [2023-08-30 08:11:39,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 234.71428571428572) internal successors, (1643), 7 states have internal predecessors, (1643), 0 states have call successors, (0), 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 08:11:39,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:39,253 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:39,253 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 465 flow. Second operand 7 states and 1643 transitions. [2023-08-30 08:11:39,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 218 transitions, 1296 flow [2023-08-30 08:11:39,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 218 transitions, 1281 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 08:11:39,286 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 603 flow [2023-08-30 08:11:39,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2023-08-30 08:11:39,289 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-08-30 08:11:39,289 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 603 flow [2023-08-30 08:11:39,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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 08:11:39,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:39,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:39,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 08:11:39,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:39,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1524270299, now seen corresponding path program 2 times [2023-08-30 08:11:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072704688] [2023-08-30 08:11:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:39,931 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 08:11:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072704688] [2023-08-30 08:11:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072704688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 08:11:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258109593] [2023-08-30 08:11:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:11:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:11:39,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:11:40,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 08:11:40,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 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 08:11:40,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:40,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 08:11:40,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:41,353 INFO L130 PetriNetUnfolder]: 5577/9060 cut-off events. [2023-08-30 08:11:41,353 INFO L131 PetriNetUnfolder]: For 7400/7418 co-relation queries the response was YES. [2023-08-30 08:11:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26065 conditions, 9060 events. 5577/9060 cut-off events. For 7400/7418 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 56308 event pairs, 1904 based on Foata normal form. 141/7581 useless extension candidates. Maximal degree in co-relation 18924. Up to 6711 conditions per place. [2023-08-30 08:11:41,406 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 153 selfloop transitions, 23 changer transitions 0/183 dead transitions. [2023-08-30 08:11:41,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 183 transitions, 1204 flow [2023-08-30 08:11:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2023-08-30 08:11:41,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-08-30 08:11:41,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1398 transitions. [2023-08-30 08:11:41,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1398 transitions. [2023-08-30 08:11:41,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:41,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1398 transitions. [2023-08-30 08:11:41,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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 08:11:41,417 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 08:11:41,418 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 08:11:41,418 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 603 flow. Second operand 6 states and 1398 transitions. [2023-08-30 08:11:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 183 transitions, 1204 flow [2023-08-30 08:11:41,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 183 transitions, 1165 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 08:11:41,477 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 648 flow [2023-08-30 08:11:41,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=648, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2023-08-30 08:11:41,478 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-08-30 08:11:41,479 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 648 flow [2023-08-30 08:11:41,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 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 08:11:41,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:41,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:41,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 08:11:41,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:41,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1531774647, now seen corresponding path program 3 times [2023-08-30 08:11:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207440473] [2023-08-30 08:11:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:42,040 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 08:11:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:42,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207440473] [2023-08-30 08:11:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207440473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 08:11:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661966597] [2023-08-30 08:11:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:42,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:11:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:11:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:11:42,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 08:11:42,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 648 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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 08:11:42,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:42,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 08:11:42,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:43,481 INFO L130 PetriNetUnfolder]: 6471/10435 cut-off events. [2023-08-30 08:11:43,481 INFO L131 PetriNetUnfolder]: For 10856/10894 co-relation queries the response was YES. [2023-08-30 08:11:43,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31089 conditions, 10435 events. 6471/10435 cut-off events. For 10856/10894 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 63561 event pairs, 1216 based on Foata normal form. 141/8570 useless extension candidates. Maximal degree in co-relation 23328. Up to 6497 conditions per place. [2023-08-30 08:11:43,541 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 177 selfloop transitions, 38 changer transitions 0/222 dead transitions. [2023-08-30 08:11:43,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 222 transitions, 1493 flow [2023-08-30 08:11:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:11:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:11:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1631 transitions. [2023-08-30 08:11:43,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-08-30 08:11:43,547 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1631 transitions. [2023-08-30 08:11:43,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1631 transitions. [2023-08-30 08:11:43,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:43,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1631 transitions. [2023-08-30 08:11:43,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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 08:11:43,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:43,556 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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 08:11:43,556 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 648 flow. Second operand 7 states and 1631 transitions. [2023-08-30 08:11:43,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 222 transitions, 1493 flow [2023-08-30 08:11:43,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 222 transitions, 1453 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 08:11:43,654 INFO L231 Difference]: Finished difference. Result has 102 places, 116 transitions, 873 flow [2023-08-30 08:11:43,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=873, PETRI_PLACES=102, PETRI_TRANSITIONS=116} [2023-08-30 08:11:43,657 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 08:11:43,657 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 116 transitions, 873 flow [2023-08-30 08:11:43,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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 08:11:43,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:43,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:43,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 08:11:43,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:43,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-08-30 08:11:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970766471] [2023-08-30 08:11:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:43,747 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 08:11:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970766471] [2023-08-30 08:11:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970766471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:11:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319511810] [2023-08-30 08:11:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:11:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:11:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:11:43,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:11:43,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 116 transitions, 873 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 08:11:43,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:43,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:11:43,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:43,938 INFO L130 PetriNetUnfolder]: 823/1615 cut-off events. [2023-08-30 08:11:43,938 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2023-08-30 08:11:43,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1615 events. 823/1615 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9227 event pairs, 501 based on Foata normal form. 82/1510 useless extension candidates. Maximal degree in co-relation 3437. Up to 761 conditions per place. [2023-08-30 08:11:43,946 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 87 selfloop transitions, 2 changer transitions 6/104 dead transitions. [2023-08-30 08:11:43,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 850 flow [2023-08-30 08:11:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:11:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:11:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-08-30 08:11:43,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-08-30 08:11:43,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-08-30 08:11:43,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-08-30 08:11:43,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:43,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-08-30 08:11:43,951 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 08:11:43,953 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 08:11:43,954 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 08:11:43,954 INFO L175 Difference]: Start difference. First operand has 102 places, 116 transitions, 873 flow. Second operand 3 states and 725 transitions. [2023-08-30 08:11:43,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 104 transitions, 850 flow [2023-08-30 08:11:43,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 811 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 08:11:43,964 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 597 flow [2023-08-30 08:11:43,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2023-08-30 08:11:43,965 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 08:11:43,965 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 597 flow [2023-08-30 08:11:43,966 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 08:11:43,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:43,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:43,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 08:11:43,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:43,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 902890166, now seen corresponding path program 1 times [2023-08-30 08:11:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232259551] [2023-08-30 08:11:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:44,055 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 08:11:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232259551] [2023-08-30 08:11:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232259551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:44,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:11:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186049905] [2023-08-30 08:11:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:44,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:11:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:11:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:11:44,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 08:11:44,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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 08:11:44,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:44,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 08:11:44,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:44,221 INFO L130 PetriNetUnfolder]: 624/1238 cut-off events. [2023-08-30 08:11:44,221 INFO L131 PetriNetUnfolder]: For 1141/1141 co-relation queries the response was YES. [2023-08-30 08:11:44,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1238 events. 624/1238 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6313 event pairs, 434 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2950. Up to 879 conditions per place. [2023-08-30 08:11:44,228 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 85 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-30 08:11:44,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 99 transitions, 784 flow [2023-08-30 08:11:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:11:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:11:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-08-30 08:11:44,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-08-30 08:11:44,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-08-30 08:11:44,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-08-30 08:11:44,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:44,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-08-30 08:11:44,232 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 08:11:44,234 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 08:11:44,235 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 08:11:44,235 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 597 flow. Second operand 3 states and 732 transitions. [2023-08-30 08:11:44,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 99 transitions, 784 flow [2023-08-30 08:11:44,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 774 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 08:11:44,244 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 601 flow [2023-08-30 08:11:44,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-08-30 08:11:44,245 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 08:11:44,245 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 601 flow [2023-08-30 08:11:44,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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 08:11:44,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:44,246 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:44,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 08:11:44,246 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:44,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-08-30 08:11:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486055779] [2023-08-30 08:11:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:44,652 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 08:11:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486055779] [2023-08-30 08:11:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486055779] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:11:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457612239] [2023-08-30 08:11:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:44,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:11:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:11:44,661 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 08:11:44,688 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 08:11:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:44,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 08:11:44,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:11:44,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:44,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:44,943 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:11:44,944 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 08:11:44,955 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:11:44,955 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 08:11:45,054 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 08:11:45,189 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 08:11:45,361 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 08:11:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:45,429 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 08:11:45,545 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 08:11:45,680 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 08:11:45,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:11:47,975 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_408) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< v_ArrVal_406 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 08:11:48,003 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_406 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_408) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |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_411) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 08:11:48,039 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_405 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_405)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse2 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_406 2147483648) 0) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_408) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|))))) is different from false [2023-08-30 08:11:49,405 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 08:11:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457612239] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:11:49,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:11:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 08:11:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883916429] [2023-08-30 08:11:49,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:11:49,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 08:11:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 08:11:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=516, Unknown=22, NotChecked=156, Total=870 [2023-08-30 08:11:49,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-08-30 08:11:49,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 601 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 08:11:49,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:49,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-08-30 08:11:49,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:12:09,286 INFO L130 PetriNetUnfolder]: 1779/3517 cut-off events. [2023-08-30 08:12:09,287 INFO L131 PetriNetUnfolder]: For 2073/2073 co-relation queries the response was YES. [2023-08-30 08:12:09,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 3517 events. 1779/3517 cut-off events. For 2073/2073 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 22390 event pairs, 712 based on Foata normal form. 10/3152 useless extension candidates. Maximal degree in co-relation 7167. Up to 863 conditions per place. [2023-08-30 08:12:09,307 INFO L137 encePairwiseOnDemand]: 424/449 looper letters, 217 selfloop transitions, 108 changer transitions 4/335 dead transitions. [2023-08-30 08:12:09,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 335 transitions, 2183 flow [2023-08-30 08:12:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 08:12:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 08:12:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6251 transitions. [2023-08-30 08:12:09,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977728285077951 [2023-08-30 08:12:09,323 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6251 transitions. [2023-08-30 08:12:09,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6251 transitions. [2023-08-30 08:12:09,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:12:09,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6251 transitions. [2023-08-30 08:12:09,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 178.6) internal successors, (6251), 35 states have internal predecessors, (6251), 0 states have call successors, (0), 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 08:12:09,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 449.0) internal successors, (16164), 36 states have internal predecessors, (16164), 0 states have call successors, (0), 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 08:12:09,354 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 449.0) internal successors, (16164), 36 states have internal predecessors, (16164), 0 states have call successors, (0), 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 08:12:09,355 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 601 flow. Second operand 35 states and 6251 transitions. [2023-08-30 08:12:09,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 335 transitions, 2183 flow [2023-08-30 08:12:09,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 335 transitions, 2172 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 08:12:09,371 INFO L231 Difference]: Finished difference. Result has 151 places, 176 transitions, 1365 flow [2023-08-30 08:12:09,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1365, PETRI_PLACES=151, PETRI_TRANSITIONS=176} [2023-08-30 08:12:09,372 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 94 predicate places. [2023-08-30 08:12:09,372 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 176 transitions, 1365 flow [2023-08-30 08:12:09,373 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 08:12:09,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:12:09,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:12:09,382 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 08:12:09,580 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,SelfDestructingSolverStorable10 [2023-08-30 08:12:09,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:12:09,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:12:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1450758440, now seen corresponding path program 1 times [2023-08-30 08:12:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:12:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692136698] [2023-08-30 08:12:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:12:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:10,443 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 08:12:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:12:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692136698] [2023-08-30 08:12:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692136698] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:12:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787569399] [2023-08-30 08:12:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:10,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:12:10,446 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 08:12:10,448 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 08:12:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:10,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 08:12:10,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:12:10,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:10,598 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:12:10,598 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 08:12:10,614 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:12:10,615 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 08:12:10,733 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 08:12:10,852 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 08:12:10,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-30 08:12:11,123 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 08:12:11,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:11,194 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 08:12:11,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 08:12:11,410 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 08:12:11,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:12:11,507 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 08:12:11,601 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511))))) is different from false [2023-08-30 08:12:11,723 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (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|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511)))))) is different from false [2023-08-30 08:12:11,761 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ (select .cse3 .cse4) 1) v_ArrVal_508))))))) is different from false [2023-08-30 08:12:11,797 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (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_507)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|))))))) is different from false [2023-08-30 08:12:11,832 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_507)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_511) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_508) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) .cse5) 2147483647)))))))) is different from false [2023-08-30 08:12:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 08:12:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787569399] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:12:11,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:12:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 08:12:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020454836] [2023-08-30 08:12:11,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:12:11,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 08:12:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:12:11,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 08:12:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=648, Unknown=11, NotChecked=366, Total=1260 [2023-08-30 08:12:11,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:12:11,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 176 transitions, 1365 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:12:11,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:12:11,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:12:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:12:14,795 INFO L130 PetriNetUnfolder]: 2351/4666 cut-off events. [2023-08-30 08:12:14,795 INFO L131 PetriNetUnfolder]: For 11029/11029 co-relation queries the response was YES. [2023-08-30 08:12:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17333 conditions, 4666 events. 2351/4666 cut-off events. For 11029/11029 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 32077 event pairs, 811 based on Foata normal form. 7/4233 useless extension candidates. Maximal degree in co-relation 16252. Up to 2820 conditions per place. [2023-08-30 08:12:14,829 INFO L137 encePairwiseOnDemand]: 432/449 looper letters, 218 selfloop transitions, 83 changer transitions 3/310 dead transitions. [2023-08-30 08:12:14,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 310 transitions, 2892 flow [2023-08-30 08:12:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 08:12:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 08:12:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4032 transitions. [2023-08-30 08:12:14,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39043284593783284 [2023-08-30 08:12:14,838 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4032 transitions. [2023-08-30 08:12:14,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4032 transitions. [2023-08-30 08:12:14,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:12:14,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4032 transitions. [2023-08-30 08:12:14,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 175.30434782608697) internal successors, (4032), 23 states have internal predecessors, (4032), 0 states have call successors, (0), 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 08:12:14,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 449.0) internal successors, (10776), 24 states have internal predecessors, (10776), 0 states have call successors, (0), 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 08:12:14,859 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 449.0) internal successors, (10776), 24 states have internal predecessors, (10776), 0 states have call successors, (0), 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 08:12:14,859 INFO L175 Difference]: Start difference. First operand has 151 places, 176 transitions, 1365 flow. Second operand 23 states and 4032 transitions. [2023-08-30 08:12:14,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 310 transitions, 2892 flow [2023-08-30 08:12:14,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 310 transitions, 2721 flow, removed 67 selfloop flow, removed 11 redundant places. [2023-08-30 08:12:14,898 INFO L231 Difference]: Finished difference. Result has 174 places, 214 transitions, 1814 flow [2023-08-30 08:12:14,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1814, PETRI_PLACES=174, PETRI_TRANSITIONS=214} [2023-08-30 08:12:14,899 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 117 predicate places. [2023-08-30 08:12:14,899 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 214 transitions, 1814 flow [2023-08-30 08:12:14,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:12:14,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:12:14,901 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:12:14,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 08:12:15,106 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,SelfDestructingSolverStorable11 [2023-08-30 08:12:15,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:12:15,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:12:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1450758455, now seen corresponding path program 1 times [2023-08-30 08:12:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:12:15,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599364287] [2023-08-30 08:12:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:12:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:15,520 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 08:12:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:12:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599364287] [2023-08-30 08:12:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599364287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:12:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778658302] [2023-08-30 08:12:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:12:15,522 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 08:12:15,525 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 08:12:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:15,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 08:12:15,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:12:15,673 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:12:15,673 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 08:12:15,809 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 08:12:15,852 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 08:12:15,944 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 08:12:15,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:15,975 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 08:12:16,044 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 08:12:16,045 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 08:12:16,092 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 08:12:16,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:12:16,181 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_602 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_601) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_602) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_602 2147483648) 0))) is different from false [2023-08-30 08:12:16,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:12:16,311 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 08:12:16,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:12:16,326 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 889 treesize of output 879 [2023-08-30 08:12:16,359 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 516 treesize of output 500 [2023-08-30 08:12:16,404 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 498 treesize of output 466 [2023-08-30 08:12:16,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 08:12:16,981 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 08:12:16,991 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 08:12:17,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:12:17,020 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 313 treesize of output 297 [2023-08-30 08:12:17,156 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 08:12:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778658302] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:12:17,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:12:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-30 08:12:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416359739] [2023-08-30 08:12:17,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:12:17,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 08:12:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:12:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 08:12:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=609, Unknown=7, NotChecked=52, Total=812 [2023-08-30 08:12:17,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 449 [2023-08-30 08:12:17,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 214 transitions, 1814 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 08:12:17,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:12:17,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 449 [2023-08-30 08:12:17,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:12:18,401 INFO L130 PetriNetUnfolder]: 2453/4829 cut-off events. [2023-08-30 08:12:18,401 INFO L131 PetriNetUnfolder]: For 24393/24738 co-relation queries the response was YES. [2023-08-30 08:12:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21144 conditions, 4829 events. 2453/4829 cut-off events. For 24393/24738 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 33102 event pairs, 1219 based on Foata normal form. 22/4367 useless extension candidates. Maximal degree in co-relation 20243. Up to 3886 conditions per place. [2023-08-30 08:12:18,450 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 205 selfloop transitions, 34 changer transitions 3/248 dead transitions. [2023-08-30 08:12:18,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 248 transitions, 2471 flow [2023-08-30 08:12:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:12:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:12:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2023-08-30 08:12:18,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4060876020786934 [2023-08-30 08:12:18,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2023-08-30 08:12:18,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2023-08-30 08:12:18,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:12:18,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2023-08-30 08:12:18,455 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 08:12:18,458 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 08:12:18,459 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 08:12:18,459 INFO L175 Difference]: Start difference. First operand has 174 places, 214 transitions, 1814 flow. Second operand 6 states and 1094 transitions. [2023-08-30 08:12:18,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 248 transitions, 2471 flow [2023-08-30 08:12:18,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 248 transitions, 2299 flow, removed 56 selfloop flow, removed 10 redundant places. [2023-08-30 08:12:18,506 INFO L231 Difference]: Finished difference. Result has 169 places, 213 transitions, 1718 flow [2023-08-30 08:12:18,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1718, PETRI_PLACES=169, PETRI_TRANSITIONS=213} [2023-08-30 08:12:18,507 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 112 predicate places. [2023-08-30 08:12:18,507 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 213 transitions, 1718 flow [2023-08-30 08:12:18,508 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 08:12:18,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:12:18,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:12:18,517 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 08:12:18,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:18,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:12:18,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:12:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 2 times [2023-08-30 08:12:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:12:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343290874] [2023-08-30 08:12:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:12:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:19,612 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 08:12:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:12:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343290874] [2023-08-30 08:12:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343290874] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:12:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300130456] [2023-08-30 08:12:19,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:12:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:19,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:12:19,615 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 08:12:19,617 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 08:12:19,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:12:19,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:12:19,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-30 08:12:19,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:12:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:19,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:19,819 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:12:19,820 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 08:12:19,843 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-08-30 08:12:19,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2023-08-30 08:12:19,978 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 08:12:20,099 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 08:12:20,268 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 08:12:20,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:20,340 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 08:12:20,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 08:12:20,544 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 08:12:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:12:20,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:12:20,715 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 08:12:20,727 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))) is different from false [2023-08-30 08:12:20,836 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_701))))) is different from false [2023-08-30 08:12:21,350 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_699) .cse2 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_701) (< (+ (select .cse1 .cse3) 1) v_ArrVal_699) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 08:12:21,385 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_697 Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int) (v_ArrVal_699 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_697)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_699) .cse3 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_699) (< (+ (select .cse1 .cse3) 1) v_ArrVal_701))))) is different from false [2023-08-30 08:12:21,547 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 08:12:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300130456] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:12:21,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:12:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 08:12:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813046153] [2023-08-30 08:12:21,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:12:21,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 08:12:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:12:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 08:12:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=20, NotChecked=310, Total=1260 [2023-08-30 08:12:21,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:12:21,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 213 transitions, 1718 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:12:21,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:12:21,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:12:21,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:12:34,174 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 08:12:40,472 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 08:12:42,542 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 08:12:44,928 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 08:12:46,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:48,279 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 08:12:50,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:53,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:55,378 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 08:12:56,232 INFO L130 PetriNetUnfolder]: 3027/5866 cut-off events. [2023-08-30 08:12:56,233 INFO L131 PetriNetUnfolder]: For 30197/30685 co-relation queries the response was YES. [2023-08-30 08:12:56,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26002 conditions, 5866 events. 3027/5866 cut-off events. For 30197/30685 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 41478 event pairs, 1107 based on Foata normal form. 20/5283 useless extension candidates. Maximal degree in co-relation 23182. Up to 3214 conditions per place. [2023-08-30 08:12:56,271 INFO L137 encePairwiseOnDemand]: 427/449 looper letters, 259 selfloop transitions, 121 changer transitions 3/389 dead transitions. [2023-08-30 08:12:56,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 389 transitions, 4417 flow [2023-08-30 08:12:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 08:12:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 08:12:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4748 transitions. [2023-08-30 08:12:56,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39165223129588383 [2023-08-30 08:12:56,357 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4748 transitions. [2023-08-30 08:12:56,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4748 transitions. [2023-08-30 08:12:56,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:12:56,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4748 transitions. [2023-08-30 08:12:56,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 175.85185185185185) internal successors, (4748), 27 states have internal predecessors, (4748), 0 states have call successors, (0), 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 08:12:56,381 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 08:12:56,382 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 08:12:56,383 INFO L175 Difference]: Start difference. First operand has 169 places, 213 transitions, 1718 flow. Second operand 27 states and 4748 transitions. [2023-08-30 08:12:56,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 389 transitions, 4417 flow [2023-08-30 08:12:56,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 389 transitions, 4358 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 08:12:56,440 INFO L231 Difference]: Finished difference. Result has 201 places, 271 transitions, 2749 flow [2023-08-30 08:12:56,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2749, PETRI_PLACES=201, PETRI_TRANSITIONS=271} [2023-08-30 08:12:56,441 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 144 predicate places. [2023-08-30 08:12:56,441 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 271 transitions, 2749 flow [2023-08-30 08:12:56,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:12:56,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:12:56,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:12:56,453 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 08:12:56,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:56,648 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:12:56,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:12:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 3 times [2023-08-30 08:12:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:12:56,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498221599] [2023-08-30 08:12:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:12:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:57,522 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 08:12:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:12:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498221599] [2023-08-30 08:12:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498221599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:12:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25120830] [2023-08-30 08:12:57,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 08:12:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:12:57,524 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 08:12:57,526 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 08:12:57,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 08:12:57,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:12:57,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 08:12:57,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:12:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:57,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:57,750 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:12:57,753 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 08:12:57,769 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:12:57,770 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 08:12:57,886 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 08:12:57,994 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 08:12:58,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 44 treesize of output 37 [2023-08-30 08:12:58,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:58,236 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 08:12:58,338 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 08:12:58,445 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 08:12:58,518 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 08:12:58,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:12:58,552 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 08:12:58,691 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (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_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_805) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))) is different from false [2023-08-30 08:12:58,707 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (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_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_805) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))))) is different from false [2023-08-30 08:12:58,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_802 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_802) .cse3 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (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_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_802) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_805)))))) is different from false [2023-08-30 08:13:01,022 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_800 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_800)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_802) .cse1 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_805) (< (+ (select .cse0 .cse2) 1) v_ArrVal_802) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse4 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))))) is different from false [2023-08-30 08:13:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 08:13:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25120830] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:07,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:07,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 08:13:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486082319] [2023-08-30 08:13:07,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 08:13:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 08:13:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=668, Unknown=20, NotChecked=310, Total=1260 [2023-08-30 08:13:07,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:13:07,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 271 transitions, 2749 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:13:07,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:07,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:13:07,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:23,029 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:13:25,234 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 08:13:27,246 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 08:13:29,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, 1] [2023-08-30 08:13:30,360 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_807 Int) (v_ArrVal_809 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_809 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2023-08-30 08:13:31,467 INFO L130 PetriNetUnfolder]: 3813/7403 cut-off events. [2023-08-30 08:13:31,467 INFO L131 PetriNetUnfolder]: For 108113/109152 co-relation queries the response was YES. [2023-08-30 08:13:31,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44494 conditions, 7403 events. 3813/7403 cut-off events. For 108113/109152 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 54451 event pairs, 1536 based on Foata normal form. 41/6746 useless extension candidates. Maximal degree in co-relation 44040. Up to 3863 conditions per place. [2023-08-30 08:13:31,529 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 294 selfloop transitions, 163 changer transitions 3/466 dead transitions. [2023-08-30 08:13:31,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 466 transitions, 6765 flow [2023-08-30 08:13:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 08:13:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 08:13:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4746 transitions. [2023-08-30 08:13:31,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3914872556297946 [2023-08-30 08:13:31,535 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4746 transitions. [2023-08-30 08:13:31,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4746 transitions. [2023-08-30 08:13:31,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:31,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4746 transitions. [2023-08-30 08:13:31,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 175.77777777777777) internal successors, (4746), 27 states have internal predecessors, (4746), 0 states have call successors, (0), 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 08:13:31,551 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 08:13:31,551 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 08:13:31,552 INFO L175 Difference]: Start difference. First operand has 201 places, 271 transitions, 2749 flow. Second operand 27 states and 4746 transitions. [2023-08-30 08:13:31,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 466 transitions, 6765 flow [2023-08-30 08:13:31,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 466 transitions, 6112 flow, removed 273 selfloop flow, removed 10 redundant places. [2023-08-30 08:13:31,681 INFO L231 Difference]: Finished difference. Result has 231 places, 350 transitions, 4142 flow [2023-08-30 08:13:31,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4142, PETRI_PLACES=231, PETRI_TRANSITIONS=350} [2023-08-30 08:13:31,682 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 174 predicate places. [2023-08-30 08:13:31,682 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 350 transitions, 4142 flow [2023-08-30 08:13:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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 08:13:31,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:31,684 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:31,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 08:13:31,889 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,SelfDestructingSolverStorable14 [2023-08-30 08:13:31,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:31,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1298397084, now seen corresponding path program 1 times [2023-08-30 08:13:31,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259818165] [2023-08-30 08:13:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:32,931 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 08:13:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259818165] [2023-08-30 08:13:32,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259818165] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:13:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421317775] [2023-08-30 08:13:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:32,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:13:32,933 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 08:13:32,960 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 08:13:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:33,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 08:13:33,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:13:33,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:33,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:33,090 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:13:33,090 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 08:13:33,106 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:13:33,106 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 08:13:33,195 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 08:13:33,246 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 27 treesize of output 29 [2023-08-30 08:13:33,290 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 08:13:33,393 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 08:13:33,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:33,439 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 08:13:33,540 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 08:13:33,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-08-30 08:13:33,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 08:13:33,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:13:34,066 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_910) .cse3 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_916) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_912) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|))))) is different from false [2023-08-30 08:13:34,100 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_912 Int) (v_ArrVal_909 (Array Int Int)) (v_ArrVal_910 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_909))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_910) .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_912) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_916) .cse3) 2147483647)))))) is different from false [2023-08-30 08:13:34,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_908 Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_912 Int) (v_ArrVal_909 (Array Int Int)) (v_ArrVal_910 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_908)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_909))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_910) .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_912) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_916) .cse3) 2147483647)))))) is different from false [2023-08-30 08:13:38,314 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 08:13:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421317775] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:38,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 08:13:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223795309] [2023-08-30 08:13:38,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:38,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 08:13:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 08:13:38,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=592, Unknown=15, NotChecked=168, Total=992 [2023-08-30 08:13:41,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:13:41,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 08:13:41,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 350 transitions, 4142 flow. Second operand has 32 states, 32 states have (on average 174.78125) internal successors, (5593), 32 states have internal predecessors, (5593), 0 states have call successors, (0), 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 08:13:41,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:41,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 08:13:41,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:57,405 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 08:13:59,415 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 08:14:01,423 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 08:14:03,432 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 08:14:05,441 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 08:14:15,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:14:16,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:14:18,928 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 08:14:19,004 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_914) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_916) .cse1) 2147483647)))) (forall ((v_ArrVal_916 Int)) (< (select (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_916) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_916 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_916) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2023-08-30 08:14:21,106 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 08:14:23,119 INFO L130 PetriNetUnfolder]: 5231/10285 cut-off events. [2023-08-30 08:14:23,119 INFO L131 PetriNetUnfolder]: For 327167/327281 co-relation queries the response was YES. [2023-08-30 08:14:23,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77504 conditions, 10285 events. 5231/10285 cut-off events. For 327167/327281 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 81217 event pairs, 1822 based on Foata normal form. 80/9477 useless extension candidates. Maximal degree in co-relation 76838. Up to 4389 conditions per place. [2023-08-30 08:14:23,204 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 456 selfloop transitions, 200 changer transitions 3/665 dead transitions. [2023-08-30 08:14:23,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 665 transitions, 11486 flow [2023-08-30 08:14:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 08:14:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 08:14:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5480 transitions. [2023-08-30 08:14:23,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40682999257609503 [2023-08-30 08:14:23,211 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5480 transitions. [2023-08-30 08:14:23,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5480 transitions. [2023-08-30 08:14:23,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:14:23,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5480 transitions. [2023-08-30 08:14:23,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 182.66666666666666) internal successors, (5480), 30 states have internal predecessors, (5480), 0 states have call successors, (0), 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 08:14:23,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 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 08:14:23,230 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 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 08:14:23,231 INFO L175 Difference]: Start difference. First operand has 231 places, 350 transitions, 4142 flow. Second operand 30 states and 5480 transitions. [2023-08-30 08:14:23,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 665 transitions, 11486 flow [2023-08-30 08:14:23,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 665 transitions, 10456 flow, removed 482 selfloop flow, removed 6 redundant places. [2023-08-30 08:14:23,439 INFO L231 Difference]: Finished difference. Result has 267 places, 453 transitions, 5889 flow [2023-08-30 08:14:23,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3516, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5889, PETRI_PLACES=267, PETRI_TRANSITIONS=453} [2023-08-30 08:14:23,440 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 210 predicate places. [2023-08-30 08:14:23,440 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 453 transitions, 5889 flow [2023-08-30 08:14:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 174.78125) internal successors, (5593), 32 states have internal predecessors, (5593), 0 states have call successors, (0), 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 08:14:23,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:14:23,441 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:14:23,450 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 08:14:23,646 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,SelfDestructingSolverStorable15 [2023-08-30 08:14:23,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:14:23,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:14:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -682370779, now seen corresponding path program 1 times [2023-08-30 08:14:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:14:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245934901] [2023-08-30 08:14:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:14:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:24,081 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 08:14:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:14:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245934901] [2023-08-30 08:14:24,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245934901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:14:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648372775] [2023-08-30 08:14:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:14:24,085 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 08:14:24,091 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 08:14:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:24,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 08:14:24,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:14:24,405 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 13 treesize of output 9 [2023-08-30 08:14:24,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:24,435 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 18 treesize of output 20 [2023-08-30 08:14:24,495 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-08-30 08:14:24,496 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 27 treesize of output 30 [2023-08-30 08:14:24,542 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 25 treesize of output 24 [2023-08-30 08:14:24,549 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 08:14:24,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:14:24,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:24,678 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 31 treesize of output 32 [2023-08-30 08:14:24,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:24,690 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 55 treesize of output 59 [2023-08-30 08:14:24,697 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 28 treesize of output 24 [2023-08-30 08:14:24,707 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 08:14:24,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:24,718 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 43 treesize of output 43 [2023-08-30 08:14:24,794 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 08:14:24,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648372775] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:14:24,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:14:24,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-30 08:14:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185692397] [2023-08-30 08:14:24,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:14:24,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 08:14:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:14:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 08:14:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=346, Unknown=5, NotChecked=0, Total=420 [2023-08-30 08:14:26,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 449 [2023-08-30 08:14:26,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 453 transitions, 5889 flow. Second operand has 21 states, 21 states have (on average 180.57142857142858) internal successors, (3792), 21 states have internal predecessors, (3792), 0 states have call successors, (0), 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 08:14:26,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:14:26,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 449 [2023-08-30 08:14:26,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:14:29,712 INFO L130 PetriNetUnfolder]: 6547/12649 cut-off events. [2023-08-30 08:14:29,713 INFO L131 PetriNetUnfolder]: For 571499/573764 co-relation queries the response was YES. [2023-08-30 08:14:29,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104994 conditions, 12649 events. 6547/12649 cut-off events. For 571499/573764 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 102432 event pairs, 2734 based on Foata normal form. 55/11577 useless extension candidates. Maximal degree in co-relation 103735. Up to 5264 conditions per place. [2023-08-30 08:14:29,946 INFO L137 encePairwiseOnDemand]: 438/449 looper letters, 475 selfloop transitions, 134 changer transitions 4/619 dead transitions. [2023-08-30 08:14:29,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 619 transitions, 9312 flow [2023-08-30 08:14:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 08:14:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 08:14:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1566 transitions. [2023-08-30 08:14:29,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43596881959910916 [2023-08-30 08:14:29,963 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1566 transitions. [2023-08-30 08:14:29,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1566 transitions. [2023-08-30 08:14:29,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:14:29,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1566 transitions. [2023-08-30 08:14:29,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 195.75) internal successors, (1566), 8 states have internal predecessors, (1566), 0 states have call successors, (0), 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 08:14:29,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 449.0) internal successors, (4041), 9 states have internal predecessors, (4041), 0 states have call successors, (0), 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 08:14:29,967 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 449.0) internal successors, (4041), 9 states have internal predecessors, (4041), 0 states have call successors, (0), 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 08:14:29,967 INFO L175 Difference]: Start difference. First operand has 267 places, 453 transitions, 5889 flow. Second operand 8 states and 1566 transitions. [2023-08-30 08:14:29,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 619 transitions, 9312 flow [2023-08-30 08:14:30,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 619 transitions, 8293 flow, removed 441 selfloop flow, removed 10 redundant places. [2023-08-30 08:14:30,314 INFO L231 Difference]: Finished difference. Result has 268 places, 467 transitions, 5954 flow [2023-08-30 08:14:30,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5110, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5954, PETRI_PLACES=268, PETRI_TRANSITIONS=467} [2023-08-30 08:14:30,315 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 211 predicate places. [2023-08-30 08:14:30,315 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 467 transitions, 5954 flow [2023-08-30 08:14:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 180.57142857142858) internal successors, (3792), 21 states have internal predecessors, (3792), 0 states have call successors, (0), 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 08:14:30,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:14:30,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:14:30,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 08:14:30,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:30,516 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:14:30,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:14:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 328848417, now seen corresponding path program 1 times [2023-08-30 08:14:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:14:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754294013] [2023-08-30 08:14:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:14:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:31,347 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 08:14:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:14:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754294013] [2023-08-30 08:14:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754294013] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:14:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6188930] [2023-08-30 08:14:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:14:31,349 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 08:14:31,358 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 08:14:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:31,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-30 08:14:31,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:14:31,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:31,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:31,535 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:14:31,535 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 08:14:31,553 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:14:31,553 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 08:14:31,659 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 08:14:31,726 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 08:14:31,828 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 08:14:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:31,868 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 08:14:31,937 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 59 treesize of output 59 [2023-08-30 08:14:31,986 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 59 treesize of output 54 [2023-08-30 08:14:32,062 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 08:14:32,130 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 08:14:32,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:14:34,230 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1108) .cse0) 2147483650)) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))) is different from false [2023-08-30 08:14:34,240 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1106)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1108) .cse1) 2147483650)) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))) is different from false [2023-08-30 08:14:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 08:14:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6188930] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:14:34,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:14:34,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-08-30 08:14:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10963070] [2023-08-30 08:14:34,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:14:34,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 08:14:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:14:34,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 08:14:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=710, Unknown=32, NotChecked=118, Total=1056 [2023-08-30 08:14:34,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 08:14:34,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 467 transitions, 5954 flow. Second operand has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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 08:14:34,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:14:34,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 08:14:34,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:14:37,514 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1106)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1108) .cse1) 2147483650)) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))) (<= 0 (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) 3204) 2147483648))) is different from false [2023-08-30 08:14:44,820 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1106)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1108) .cse1) 2147483650)) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))) (< 0 (+ 2147483650 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-08-30 08:14:45,549 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1108 Int)) (< 0 (+ (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 v_ArrVal_1108) .cse1) 2147483650))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1108 Int)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 v_ArrVal_1108) .cse1)))))) is different from false [2023-08-30 08:14:47,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:14:50,023 INFO L130 PetriNetUnfolder]: 7353/14178 cut-off events. [2023-08-30 08:14:50,024 INFO L131 PetriNetUnfolder]: For 645527/647870 co-relation queries the response was YES. [2023-08-30 08:14:50,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116420 conditions, 14178 events. 7353/14178 cut-off events. For 645527/647870 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 116673 event pairs, 2649 based on Foata normal form. 129/12998 useless extension candidates. Maximal degree in co-relation 114772. Up to 8378 conditions per place. [2023-08-30 08:14:50,158 INFO L137 encePairwiseOnDemand]: 425/449 looper letters, 449 selfloop transitions, 254 changer transitions 3/712 dead transitions. [2023-08-30 08:14:50,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 712 transitions, 13098 flow [2023-08-30 08:14:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 08:14:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 08:14:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5653 transitions. [2023-08-30 08:14:50,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4061354982398161 [2023-08-30 08:14:50,165 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5653 transitions. [2023-08-30 08:14:50,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5653 transitions. [2023-08-30 08:14:50,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:14:50,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5653 transitions. [2023-08-30 08:14:50,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 182.3548387096774) internal successors, (5653), 31 states have internal predecessors, (5653), 0 states have call successors, (0), 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 08:14:50,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:14:50,181 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:14:50,181 INFO L175 Difference]: Start difference. First operand has 268 places, 467 transitions, 5954 flow. Second operand 31 states and 5653 transitions. [2023-08-30 08:14:50,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 712 transitions, 13098 flow [2023-08-30 08:14:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 712 transitions, 13036 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-30 08:14:50,543 INFO L231 Difference]: Finished difference. Result has 303 places, 537 transitions, 8180 flow [2023-08-30 08:14:50,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5518, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8180, PETRI_PLACES=303, PETRI_TRANSITIONS=537} [2023-08-30 08:14:50,544 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 246 predicate places. [2023-08-30 08:14:50,544 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 537 transitions, 8180 flow [2023-08-30 08:14:50,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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 08:14:50,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:14:50,545 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:14:50,550 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 08:14:50,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 08:14:50,746 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:14:50,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:14:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 321388709, now seen corresponding path program 2 times [2023-08-30 08:14:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:14:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353085205] [2023-08-30 08:14:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:14:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:51,342 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 08:14:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:14:51,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353085205] [2023-08-30 08:14:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353085205] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:14:51,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059654948] [2023-08-30 08:14:51,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:14:51,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:51,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:14:51,345 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 08:14:51,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 08:14:51,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:14:51,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:14:51,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-30 08:14:51,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:14:51,532 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:14:51,533 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 08:14:51,752 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 08:14:51,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:51,785 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 08:14:51,860 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 08:14:51,861 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 08:14:51,913 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 08:14:51,924 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 08:14:51,949 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 08:14:51,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:14:51,967 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1203 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1203) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483650))) is different from false [2023-08-30 08:14:51,971 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1202 Int)) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1202)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1203) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-08-30 08:14:52,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:52,121 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 08:14:52,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:52,130 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 93 treesize of output 97 [2023-08-30 08:14:52,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2023-08-30 08:14:52,142 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 43 treesize of output 39 [2023-08-30 08:14:52,165 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 08:14:52,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:14:52,180 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 58 treesize of output 58 [2023-08-30 08:14:52,341 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 08:14:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059654948] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:14:52,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:14:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 24 [2023-08-30 08:14:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834695400] [2023-08-30 08:14:52,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:14:52,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 08:14:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:14:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 08:14:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=470, Unknown=7, NotChecked=90, Total=650 [2023-08-30 08:14:52,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 449 [2023-08-30 08:14:52,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 537 transitions, 8180 flow. Second operand has 26 states, 26 states have (on average 174.19230769230768) internal successors, (4529), 26 states have internal predecessors, (4529), 0 states have call successors, (0), 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 08:14:52,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:14:52,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 449 [2023-08-30 08:14:52,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:14:56,552 INFO L130 PetriNetUnfolder]: 8073/15622 cut-off events. [2023-08-30 08:14:56,552 INFO L131 PetriNetUnfolder]: For 967717/971771 co-relation queries the response was YES. [2023-08-30 08:14:56,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146372 conditions, 15622 events. 8073/15622 cut-off events. For 967717/971771 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 130277 event pairs, 2924 based on Foata normal form. 86/14246 useless extension candidates. Maximal degree in co-relation 144216. Up to 7939 conditions per place. [2023-08-30 08:14:56,723 INFO L137 encePairwiseOnDemand]: 431/449 looper letters, 412 selfloop transitions, 236 changer transitions 3/657 dead transitions. [2023-08-30 08:14:56,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 657 transitions, 11515 flow [2023-08-30 08:14:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 08:14:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 08:14:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2041 transitions. [2023-08-30 08:14:56,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132415468718364 [2023-08-30 08:14:56,726 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2041 transitions. [2023-08-30 08:14:56,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2041 transitions. [2023-08-30 08:14:56,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:14:56,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2041 transitions. [2023-08-30 08:14:56,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 185.54545454545453) internal successors, (2041), 11 states have internal predecessors, (2041), 0 states have call successors, (0), 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 08:14:56,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 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 08:14:56,732 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 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 08:14:56,732 INFO L175 Difference]: Start difference. First operand has 303 places, 537 transitions, 8180 flow. Second operand 11 states and 2041 transitions. [2023-08-30 08:14:56,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 657 transitions, 11515 flow [2023-08-30 08:14:57,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 657 transitions, 10432 flow, removed 398 selfloop flow, removed 15 redundant places. [2023-08-30 08:14:57,675 INFO L231 Difference]: Finished difference. Result has 300 places, 563 transitions, 8478 flow [2023-08-30 08:14:57,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8478, PETRI_PLACES=300, PETRI_TRANSITIONS=563} [2023-08-30 08:14:57,675 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 243 predicate places. [2023-08-30 08:14:57,675 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 563 transitions, 8478 flow [2023-08-30 08:14:57,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 174.19230769230768) internal successors, (4529), 26 states have internal predecessors, (4529), 0 states have call successors, (0), 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 08:14:57,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:14:57,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:14:57,681 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 08:14:57,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:57,877 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:14:57,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:14:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 321388724, now seen corresponding path program 2 times [2023-08-30 08:14:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:14:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148623133] [2023-08-30 08:14:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:14:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:58,636 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 08:14:58,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:14:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148623133] [2023-08-30 08:14:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148623133] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:14:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056611530] [2023-08-30 08:14:58,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:14:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:14:58,638 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 08:14:58,640 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 08:14:58,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:14:58,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:14:58,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 08:14:58,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:14:58,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:58,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:58,823 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:14:58,824 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 08:14:58,837 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:14:58,837 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 08:14:58,927 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 08:14:58,984 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 08:14:59,098 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 08:14:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:59,144 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 08:14:59,235 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 08:14:59,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-08-30 08:14:59,364 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 08:14:59,437 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 08:14:59,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:14:59,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 08:14:59,596 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1305 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1305) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1305)) |c_~#stored_elements~0.base| v_ArrVal_1307))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1308)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1310))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse2)) 2147483647))) is different from false [2023-08-30 08:14:59,611 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1305 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1305) (< (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1305)) |c_~#stored_elements~0.base| v_ArrVal_1307))) (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_1308)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1310))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse4)) 2147483647)))) is different from false [2023-08-30 08:14:59,637 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1303 Int) (v_ArrVal_1305 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1303) .cse4 v_ArrVal_1305)) |c_~#stored_elements~0.base| v_ArrVal_1307))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1308)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1310))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse2)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1305)))) is different from false [2023-08-30 08:14:59,667 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1301 Int) (v_ArrVal_1303 Int) (v_ArrVal_1305 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_1301)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1305) (< (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1303) .cse1 v_ArrVal_1305)) |c_~#stored_elements~0.base| v_ArrVal_1307))) (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1308)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1310))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse4)) 2147483647)))) is different from false [2023-08-30 08:15:03,784 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 08:15:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056611530] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:15:03,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:15:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-08-30 08:15:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091536114] [2023-08-30 08:15:03,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:15:03,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 08:15:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:15:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 08:15:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=544, Unknown=9, NotChecked=280, Total=1056 [2023-08-30 08:15:03,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 08:15:03,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 563 transitions, 8478 flow. Second operand has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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 08:15:03,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:03,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 08:15:03,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:11,309 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1308)) .cse2 v_ArrVal_1310)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse1) 2147483647)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int))) (< (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1307))) (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1308)) .cse2 v_ArrVal_1310))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2023-08-30 08:15:11,727 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1310)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1308) .cse1 v_ArrVal_1310)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1312) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)))) is different from false [2023-08-30 08:15:16,263 INFO L130 PetriNetUnfolder]: 10490/20419 cut-off events. [2023-08-30 08:15:16,263 INFO L131 PetriNetUnfolder]: For 1382510/1382999 co-relation queries the response was YES. [2023-08-30 08:15:16,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196356 conditions, 20419 events. 10490/20419 cut-off events. For 1382510/1382999 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 177259 event pairs, 3722 based on Foata normal form. 177/18808 useless extension candidates. Maximal degree in co-relation 192882. Up to 11100 conditions per place. [2023-08-30 08:15:16,517 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 544 selfloop transitions, 313 changer transitions 3/866 dead transitions. [2023-08-30 08:15:16,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 866 transitions, 18140 flow [2023-08-30 08:15:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 08:15:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 08:15:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4035 transitions. [2023-08-30 08:15:16,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084834986839441 [2023-08-30 08:15:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4035 transitions. [2023-08-30 08:15:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4035 transitions. [2023-08-30 08:15:16,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:15:16,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4035 transitions. [2023-08-30 08:15:16,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 183.4090909090909) internal successors, (4035), 22 states have internal predecessors, (4035), 0 states have call successors, (0), 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 08:15:16,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 449.0) internal successors, (10327), 23 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:16,535 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 449.0) internal successors, (10327), 23 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:16,535 INFO L175 Difference]: Start difference. First operand has 300 places, 563 transitions, 8478 flow. Second operand 22 states and 4035 transitions. [2023-08-30 08:15:16,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 866 transitions, 18140 flow [2023-08-30 08:15:17,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 866 transitions, 16730 flow, removed 596 selfloop flow, removed 5 redundant places. [2023-08-30 08:15:17,701 INFO L231 Difference]: Finished difference. Result has 325 places, 722 transitions, 12835 flow [2023-08-30 08:15:17,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=8000, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12835, PETRI_PLACES=325, PETRI_TRANSITIONS=722} [2023-08-30 08:15:17,701 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 268 predicate places. [2023-08-30 08:15:17,702 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 722 transitions, 12835 flow [2023-08-30 08:15:17,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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 08:15:17,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:15:17,703 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:15:17,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 08:15:17,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:15:17,906 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:15:17,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:15:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2075760955, now seen corresponding path program 1 times [2023-08-30 08:15:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:15:17,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863259952] [2023-08-30 08:15:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:15:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:17,961 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 08:15:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:15:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863259952] [2023-08-30 08:15:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863259952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:15:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:15:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:15:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243380678] [2023-08-30 08:15:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:15:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:15:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:15:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:15:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:15:17,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:15:17,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 722 transitions, 12835 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 08:15:17,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:17,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:15:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:23,101 INFO L130 PetriNetUnfolder]: 10166/19689 cut-off events. [2023-08-30 08:15:23,101 INFO L131 PetriNetUnfolder]: For 1811258/1818482 co-relation queries the response was YES. [2023-08-30 08:15:23,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209549 conditions, 19689 events. 10166/19689 cut-off events. For 1811258/1818482 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 171045 event pairs, 5624 based on Foata normal form. 83/18126 useless extension candidates. Maximal degree in co-relation 206421. Up to 12717 conditions per place. [2023-08-30 08:15:23,345 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 560 selfloop transitions, 88 changer transitions 0/703 dead transitions. [2023-08-30 08:15:23,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 703 transitions, 13843 flow [2023-08-30 08:15:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:15:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:15:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2023-08-30 08:15:23,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330363771343727 [2023-08-30 08:15:23,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2023-08-30 08:15:23,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2023-08-30 08:15:23,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:15:23,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2023-08-30 08:15:23,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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 08:15:23,348 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 08:15:23,348 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 08:15:23,348 INFO L175 Difference]: Start difference. First operand has 325 places, 722 transitions, 12835 flow. Second operand 3 states and 718 transitions. [2023-08-30 08:15:23,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 703 transitions, 13843 flow [2023-08-30 08:15:24,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 703 transitions, 12728 flow, removed 511 selfloop flow, removed 7 redundant places. [2023-08-30 08:15:24,954 INFO L231 Difference]: Finished difference. Result has 319 places, 691 transitions, 11294 flow [2023-08-30 08:15:24,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=11118, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=11294, PETRI_PLACES=319, PETRI_TRANSITIONS=691} [2023-08-30 08:15:24,955 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 262 predicate places. [2023-08-30 08:15:24,955 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 691 transitions, 11294 flow [2023-08-30 08:15:24,956 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 08:15:24,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:15:24,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:15:24,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 08:15:24,956 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:15:24,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:15:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1371567626, now seen corresponding path program 1 times [2023-08-30 08:15:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:15:24,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472383793] [2023-08-30 08:15:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:15:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:24,992 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 08:15:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:15:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472383793] [2023-08-30 08:15:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472383793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:15:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:15:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:15:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685685510] [2023-08-30 08:15:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:15:24,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:15:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:15:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:15:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:15:25,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 08:15:25,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 691 transitions, 11294 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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 08:15:25,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:25,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 08:15:25,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:29,969 INFO L130 PetriNetUnfolder]: 9887/19288 cut-off events. [2023-08-30 08:15:29,970 INFO L131 PetriNetUnfolder]: For 1753103/1756925 co-relation queries the response was YES. [2023-08-30 08:15:30,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198433 conditions, 19288 events. 9887/19288 cut-off events. For 1753103/1756925 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 167656 event pairs, 5318 based on Foata normal form. 293/18086 useless extension candidates. Maximal degree in co-relation 196148. Up to 17968 conditions per place. [2023-08-30 08:15:30,219 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 608 selfloop transitions, 1 changer transitions 3/667 dead transitions. [2023-08-30 08:15:30,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 667 transitions, 12160 flow [2023-08-30 08:15:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:15:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:15:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2023-08-30 08:15:30,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360059391239792 [2023-08-30 08:15:30,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2023-08-30 08:15:30,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2023-08-30 08:15:30,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:15:30,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2023-08-30 08:15:30,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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 08:15:30,222 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 08:15:30,223 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 08:15:30,223 INFO L175 Difference]: Start difference. First operand has 319 places, 691 transitions, 11294 flow. Second operand 3 states and 722 transitions. [2023-08-30 08:15:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 667 transitions, 12160 flow [2023-08-30 08:15:31,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 667 transitions, 12031 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 08:15:31,242 INFO L231 Difference]: Finished difference. Result has 317 places, 659 transitions, 10548 flow [2023-08-30 08:15:31,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=10546, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10548, PETRI_PLACES=317, PETRI_TRANSITIONS=659} [2023-08-30 08:15:31,243 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places. [2023-08-30 08:15:31,243 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 659 transitions, 10548 flow [2023-08-30 08:15:31,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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 08:15:31,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:15:31,243 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 08:15:31,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 08:15:31,244 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:15:31,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:15:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1622923070, now seen corresponding path program 1 times [2023-08-30 08:15:31,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:15:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091077688] [2023-08-30 08:15:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:31,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:15:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 08:15:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:15:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091077688] [2023-08-30 08:15:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091077688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:15:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:15:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:15:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481547775] [2023-08-30 08:15:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:15:31,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:15:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:15:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:15:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:15:31,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 449 [2023-08-30 08:15:31,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 659 transitions, 10548 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:31,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:31,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 449 [2023-08-30 08:15:31,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:35,168 INFO L130 PetriNetUnfolder]: 7627/15634 cut-off events. [2023-08-30 08:15:35,168 INFO L131 PetriNetUnfolder]: For 1393892/1393899 co-relation queries the response was YES. [2023-08-30 08:15:35,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139590 conditions, 15634 events. 7627/15634 cut-off events. For 1393892/1393899 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 129938 event pairs, 593 based on Foata normal form. 889/15126 useless extension candidates. Maximal degree in co-relation 138845. Up to 13652 conditions per place. [2023-08-30 08:15:35,326 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 555 selfloop transitions, 4 changer transitions 0/612 dead transitions. [2023-08-30 08:15:35,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 612 transitions, 11373 flow [2023-08-30 08:15:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:15:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:15:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2023-08-30 08:15:35,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330363771343727 [2023-08-30 08:15:35,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2023-08-30 08:15:35,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2023-08-30 08:15:35,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:15:35,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2023-08-30 08:15:35,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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 08:15:35,330 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 08:15:35,330 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 08:15:35,330 INFO L175 Difference]: Start difference. First operand has 317 places, 659 transitions, 10548 flow. Second operand 3 states and 718 transitions. [2023-08-30 08:15:35,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 612 transitions, 11373 flow [2023-08-30 08:15:35,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 612 transitions, 11372 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:15:35,934 INFO L231 Difference]: Finished difference. Result has 318 places, 600 transitions, 10004 flow [2023-08-30 08:15:35,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=9996, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10004, PETRI_PLACES=318, PETRI_TRANSITIONS=600} [2023-08-30 08:15:35,935 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 261 predicate places. [2023-08-30 08:15:35,935 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 600 transitions, 10004 flow [2023-08-30 08:15:35,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:35,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:15:35,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:15:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 08:15:35,936 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:15:35,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:15:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash -714079076, now seen corresponding path program 1 times [2023-08-30 08:15:35,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:15:35,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962552603] [2023-08-30 08:15:35,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:15:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:35,989 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 08:15:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:15:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962552603] [2023-08-30 08:15:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962552603] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:15:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472228816] [2023-08-30 08:15:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:35,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:15:35,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:15:35,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 08:15:35,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 08:15:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:36,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 08:15:36,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:15:36,153 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 08:15:36,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:15:36,170 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 08:15:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472228816] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:15:36,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:15:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 08:15:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460981316] [2023-08-30 08:15:36,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:15:36,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:15:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:15:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:15:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:15:36,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:15:36,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 600 transitions, 10004 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 08:15:36,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:36,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:15:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:38,274 INFO L130 PetriNetUnfolder]: 3429/7288 cut-off events. [2023-08-30 08:15:38,274 INFO L131 PetriNetUnfolder]: For 621661/622218 co-relation queries the response was YES. [2023-08-30 08:15:38,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75675 conditions, 7288 events. 3429/7288 cut-off events. For 621661/622218 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 48932 event pairs, 1940 based on Foata normal form. 154/6883 useless extension candidates. Maximal degree in co-relation 74780. Up to 4228 conditions per place. [2023-08-30 08:15:38,345 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 531 selfloop transitions, 50 changer transitions 0/636 dead transitions. [2023-08-30 08:15:38,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 636 transitions, 12433 flow [2023-08-30 08:15:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:15:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:15:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1421 transitions. [2023-08-30 08:15:38,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274684484038604 [2023-08-30 08:15:38,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1421 transitions. [2023-08-30 08:15:38,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1421 transitions. [2023-08-30 08:15:38,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:15:38,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1421 transitions. [2023-08-30 08:15:38,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 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 08:15:38,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:38,351 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 08:15:38,351 INFO L175 Difference]: Start difference. First operand has 318 places, 600 transitions, 10004 flow. Second operand 6 states and 1421 transitions. [2023-08-30 08:15:38,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 636 transitions, 12433 flow [2023-08-30 08:15:38,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 636 transitions, 12397 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-30 08:15:38,687 INFO L231 Difference]: Finished difference. Result has 326 places, 585 transitions, 9960 flow [2023-08-30 08:15:38,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=9537, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9960, PETRI_PLACES=326, PETRI_TRANSITIONS=585} [2023-08-30 08:15:38,688 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 269 predicate places. [2023-08-30 08:15:38,688 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 585 transitions, 9960 flow [2023-08-30 08:15:38,688 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 08:15:38,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:15:38,688 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:15:38,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 08:15:38,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-30 08:15:38,889 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:15:38,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:15:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1292910326, now seen corresponding path program 1 times [2023-08-30 08:15:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:15:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088882505] [2023-08-30 08:15:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:15:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:40,300 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 08:15:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:15:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088882505] [2023-08-30 08:15:40,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088882505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:15:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229799834] [2023-08-30 08:15:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:15:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:15:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:15:40,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 08:15:40,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 08:15:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:15:40,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-30 08:15:40,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:15:40,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:15:40,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:15:40,518 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:15:40,518 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 08:15:40,534 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:15:40,534 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 08:15:40,582 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 22 treesize of output 24 [2023-08-30 08:15:40,643 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 08:15:40,722 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 08:15:40,837 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 08:15:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:15:40,907 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 08:15:41,002 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 08:15:41,223 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 08:15:41,606 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 08:15:43,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:15:43,065 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 08:15:44,693 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 08:15:51,202 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 08:15:51,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:15:51,366 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1644)))) is different from false [2023-08-30 08:15:51,383 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1644) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))))) is different from false [2023-08-30 08:15:51,426 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1641) .cse2 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1644) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1641) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 08:15:53,564 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1647 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_1639)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1641) .cse3 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1641) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1644))))) is different from false [2023-08-30 08:15:59,696 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1641) .cse4 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1641) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1644))))))) is different from false [2023-08-30 08:15:59,738 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1641) .cse1 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1644) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1641) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1637) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse2) 2147483647))))))) is different from false [2023-08-30 08:16:02,028 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1635 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1635) .cse3 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1641) .cse4 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1635) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1637) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1644) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1641) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))) is different from false [2023-08-30 08:16:04,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1644 Int) (v_ArrVal_1635 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 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_1633)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1635) .cse4 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1641) .cse5 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1641) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1635) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1637) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1644) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))) is different from false [2023-08-30 08:16:04,311 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1644 Int) (v_ArrVal_1635 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1633)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1635) .cse1 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1641) .cse1 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1637) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1644) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1641) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1635) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse5) 2147483647))))))))) is different from false [2023-08-30 08:16:04,400 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1644 Int) (v_ArrVal_1635 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1631))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1633)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1635) .cse3 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1641) .cse3 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1641) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1635) (< (+ 1 (select .cse4 .cse3)) v_ArrVal_1637) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1644) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))))) is different from false [2023-08-30 08:16:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-30 08:16:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229799834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:16:04,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:16:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2023-08-30 08:16:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565773964] [2023-08-30 08:16:04,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:16:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 08:16:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:16:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 08:16:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=1451, Unknown=42, NotChecked=950, Total=2970 [2023-08-30 08:16:04,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:16:04,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 585 transitions, 9960 flow. Second operand has 55 states, 55 states have (on average 168.36363636363637) internal successors, (9260), 55 states have internal predecessors, (9260), 0 states have call successors, (0), 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 08:16:04,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:16:04,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:16:04,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:16:10,616 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 08:16:17,079 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 08:16:21,283 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 08:16:23,413 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 08:16:25,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:16:29,683 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 08:16:31,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:16:33,737 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 08:16:35,981 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 08:16:38,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 [0] [2023-08-30 08:16:46,990 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 08:17:02,901 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 08:17:07,138 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 08:17:08,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:17:10,368 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 08:17:12,397 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 08:17:14,410 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 08:17:16,418 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 08:17:16,436 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse7 .cse8) 1)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1641) .cse1 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1644) (< .cse2 v_ArrVal_1637) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1641) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse3) 2147483647))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse3) 2147483647) (< .cse2 v_ArrVal_1644) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))))))) is different from false [2023-08-30 08:17:23,217 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< .cse3 v_ArrVal_1644)))) (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1637 Int) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1647 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1637)) |c_~#stored_elements~0.base| v_ArrVal_1638))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1641) .cse2 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1644) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1641) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< .cse3 v_ArrVal_1637) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse1) 2147483647))))))))) is different from false [2023-08-30 08:17:25,260 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 08:17:43,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:17:46,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 08:17:48,103 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 08:17:48,116 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse1 .cse8)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1647 Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse2) 2147483647))) (forall ((v_ArrVal_1647 Int)) (< (select (store .cse3 .cse4 v_ArrVal_1647) .cse5) 2147483647)) (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse7 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1639))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_1641) .cse8 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse2) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1644) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1641) (< (select .cse6 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))) (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1641 Int) (v_ArrVal_1644 Int) (v_ArrVal_1647 Int)) (let ((.cse10 (store .cse3 .cse4 v_ArrVal_1639)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse5 v_ArrVal_1641) .cse11 v_ArrVal_1644)) |c_~#stored_elements~0.base| v_ArrVal_1645) |c_~#queue~0.base|))) (or (< (select .cse9 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse10 .cse5) 1) v_ArrVal_1641) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1647) .cse2) 2147483647) (< (+ (select .cse10 .cse11) 1) v_ArrVal_1644)))))))) is different from false [2023-08-30 08:17:50,339 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 08:17:52,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 [1] [2023-08-30 08:17:54,354 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 08:17:56,376 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 08:18:00,693 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 08:18:02,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:18:04,710 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 08:18:10,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:18:12,004 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 08:18:14,014 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 08:18:16,019 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 08:18:18,067 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 08:18:20,948 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 08:18:22,803 INFO L130 PetriNetUnfolder]: 3805/8175 cut-off events. [2023-08-30 08:18:22,803 INFO L131 PetriNetUnfolder]: For 703062/703327 co-relation queries the response was YES. [2023-08-30 08:18:22,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86602 conditions, 8175 events. 3805/8175 cut-off events. For 703062/703327 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 56780 event pairs, 1919 based on Foata normal form. 43/7653 useless extension candidates. Maximal degree in co-relation 85690. Up to 6160 conditions per place. [2023-08-30 08:18:22,947 INFO L137 encePairwiseOnDemand]: 432/449 looper letters, 562 selfloop transitions, 296 changer transitions 3/867 dead transitions. [2023-08-30 08:18:22,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 867 transitions, 20096 flow [2023-08-30 08:18:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-30 08:18:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-30 08:18:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6936 transitions. [2023-08-30 08:18:22,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861915367483296 [2023-08-30 08:18:22,956 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6936 transitions. [2023-08-30 08:18:22,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6936 transitions. [2023-08-30 08:18:22,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:18:22,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6936 transitions. [2023-08-30 08:18:22,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 173.4) internal successors, (6936), 40 states have internal predecessors, (6936), 0 states have call successors, (0), 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 08:18:22,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 449.0) internal successors, (18409), 41 states have internal predecessors, (18409), 0 states have call successors, (0), 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 08:18:22,982 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 449.0) internal successors, (18409), 41 states have internal predecessors, (18409), 0 states have call successors, (0), 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 08:18:22,982 INFO L175 Difference]: Start difference. First operand has 326 places, 585 transitions, 9960 flow. Second operand 40 states and 6936 transitions. [2023-08-30 08:18:22,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 867 transitions, 20096 flow [2023-08-30 08:18:23,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 867 transitions, 20058 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-30 08:18:23,546 INFO L231 Difference]: Finished difference. Result has 386 places, 742 transitions, 14924 flow [2023-08-30 08:18:23,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=9932, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=14924, PETRI_PLACES=386, PETRI_TRANSITIONS=742} [2023-08-30 08:18:23,547 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 329 predicate places. [2023-08-30 08:18:23,548 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 742 transitions, 14924 flow [2023-08-30 08:18:23,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 168.36363636363637) internal successors, (9260), 55 states have internal predecessors, (9260), 0 states have call successors, (0), 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 08:18:23,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:18:23,550 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:18:23,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 08:18:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-30 08:18:23,755 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:18:23,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:18:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1206067624, now seen corresponding path program 2 times [2023-08-30 08:18:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:18:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463427595] [2023-08-30 08:18:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:18:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:18:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:18:24,925 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 08:18:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:18:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463427595] [2023-08-30 08:18:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463427595] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:18:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233694768] [2023-08-30 08:18:24,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:18:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:18:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:18:24,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 08:18:24,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 08:18:25,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:18:25,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:18:25,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 101 conjunts are in the unsatisfiable core [2023-08-30 08:18:25,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:18:25,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:18:25,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:18:25,129 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:18:25,129 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 08:18:25,142 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:18:25,143 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 08:18:25,237 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 08:18:25,343 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 08:18:25,514 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 37 treesize of output 37 [2023-08-30 08:18:25,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-08-30 08:18:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:18:25,666 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 08:18:25,766 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 08:18:26,260 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 08:18:26,777 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 08:18:27,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:18:27,077 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 08:18:28,694 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 08:18:35,319 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 08:18:35,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:18:35,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1769) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|)))) is different from false [2023-08-30 08:18:35,513 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1769) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|))))) is different from false [2023-08-30 08:18:35,809 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1766 Int) (v_ArrVal_1769 Int) (v_ArrVal_1768 Int)) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1766)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1768) .cse4 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (= 800 .cse0) (< (+ .cse0 1) v_ArrVal_1769) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1768))))) is different from false [2023-08-30 08:18:42,150 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1766 Int) (v_ArrVal_1769 Int) (v_ArrVal_1768 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1764))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1766)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1768) .cse2 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1769) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) .cse4) 2147483647) (= 800 .cse0) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1768))))))) is different from false [2023-08-30 08:18:42,194 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1762 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1766 Int) (v_ArrVal_1769 Int) (v_ArrVal_1768 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1762)) |c_~#stored_elements~0.base| v_ArrVal_1764))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1766)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1768) .cse3 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1769) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1762) (= .cse0 800) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1768) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|))))))) is different from false [2023-08-30 08:18:42,242 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1766 Int) (v_ArrVal_1769 Int) (v_ArrVal_1768 Int)) (let ((.cse6 (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1761))) (store .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1762))) |c_~#stored_elements~0.base| v_ArrVal_1764))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1766)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1768) .cse1 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ .cse2 1) v_ArrVal_1769) (= 800 .cse2) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1762) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1768))))))) is different from false [2023-08-30 08:18:42,474 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1760 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1766 Int) (v_ArrVal_1769 Int) (v_ArrVal_1768 Int)) (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse8 (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1760)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1761))) (store .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 v_ArrVal_1762))) |c_~#stored_elements~0.base| v_ArrVal_1764))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1766)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select .cse4 .cse1)) (.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1768) .cse1 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1762) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1768) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1760) (= 800 .cse6) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) .cse5) 2147483647) (< (+ .cse6 1) v_ArrVal_1769) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|)))))))) is different from false [2023-08-30 08:19:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-30 08:19:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233694768] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:19:02,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:19:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2023-08-30 08:19:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804350588] [2023-08-30 08:19:02,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:19:02,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-30 08:19:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:19:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-30 08:19:02,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=1772, Unknown=63, NotChecked=700, Total=3080 [2023-08-30 08:19:02,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:19:02,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 742 transitions, 14924 flow. Second operand has 56 states, 56 states have (on average 168.33928571428572) internal successors, (9427), 56 states have internal predecessors, (9427), 0 states have call successors, (0), 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 08:19:02,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:19:02,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:19:02,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:19:07,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 [0, 1] [2023-08-30 08:19:10,030 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 08:19:12,129 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 08:19:14,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:19:16,165 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 08:19:18,625 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 08:19:21,693 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 08:19:25,084 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 08:19:48,834 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 08:19:55,892 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 08:20:06,560 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 08:20:08,595 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 08:20:10,607 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 08:20:12,365 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse3 .cse4))) (let ((.cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1769 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1769)) |c_~#stored_elements~0.base| v_ArrVal_1771) |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_1769) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1773) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|)))))) (and (or .cse0 (= 800 .cse1)) .cse0)))) is different from false [2023-08-30 08:20:15,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:20:22,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:20:24,776 INFO L130 PetriNetUnfolder]: 3900/8438 cut-off events. [2023-08-30 08:20:24,776 INFO L131 PetriNetUnfolder]: For 1040629/1040943 co-relation queries the response was YES. [2023-08-30 08:20:24,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102911 conditions, 8438 events. 3900/8438 cut-off events. For 1040629/1040943 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 59337 event pairs, 1900 based on Foata normal form. 15/7888 useless extension candidates. Maximal degree in co-relation 101792. Up to 6194 conditions per place. [2023-08-30 08:20:24,919 INFO L137 encePairwiseOnDemand]: 432/449 looper letters, 546 selfloop transitions, 411 changer transitions 3/966 dead transitions. [2023-08-30 08:20:24,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 966 transitions, 25327 flow [2023-08-30 08:20:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-30 08:20:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-30 08:20:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6227 transitions. [2023-08-30 08:20:24,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852388022766642 [2023-08-30 08:20:24,924 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6227 transitions. [2023-08-30 08:20:24,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6227 transitions. [2023-08-30 08:20:24,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:20:24,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6227 transitions. [2023-08-30 08:20:24,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 172.97222222222223) internal successors, (6227), 36 states have internal predecessors, (6227), 0 states have call successors, (0), 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 08:20:24,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 449.0) internal successors, (16613), 37 states have internal predecessors, (16613), 0 states have call successors, (0), 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 08:20:24,941 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 449.0) internal successors, (16613), 37 states have internal predecessors, (16613), 0 states have call successors, (0), 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 08:20:24,941 INFO L175 Difference]: Start difference. First operand has 386 places, 742 transitions, 14924 flow. Second operand 36 states and 6227 transitions. [2023-08-30 08:20:24,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 966 transitions, 25327 flow [2023-08-30 08:20:25,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 966 transitions, 23850 flow, removed 729 selfloop flow, removed 3 redundant places. [2023-08-30 08:20:25,875 INFO L231 Difference]: Finished difference. Result has 435 places, 852 transitions, 17782 flow [2023-08-30 08:20:25,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=13547, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=17782, PETRI_PLACES=435, PETRI_TRANSITIONS=852} [2023-08-30 08:20:25,876 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 378 predicate places. [2023-08-30 08:20:25,876 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 852 transitions, 17782 flow [2023-08-30 08:20:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 168.33928571428572) internal successors, (9427), 56 states have internal predecessors, (9427), 0 states have call successors, (0), 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 08:20:25,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:20:25,878 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:20:25,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 08:20:26,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-30 08:20:26,085 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:20:26,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:20:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1239218742, now seen corresponding path program 3 times [2023-08-30 08:20:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:20:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284799915] [2023-08-30 08:20:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:20:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:20:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:20:27,756 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 08:20:27,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:20:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284799915] [2023-08-30 08:20:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284799915] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:20:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507681451] [2023-08-30 08:20:27,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 08:20:27,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:20:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:20:27,758 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 08:20:27,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 08:20:28,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 08:20:28,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:20:28,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 92 conjunts are in the unsatisfiable core [2023-08-30 08:20:28,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:20:28,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:20:28,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:20:28,039 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:20:28,040 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 08:20:28,057 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-30 08:20:28,057 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 08:20:28,155 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 08:20:28,256 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 08:20:28,396 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 08:20:28,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:20:28,467 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 08:20:28,498 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 08:20:28,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 08:20:28,897 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 08:20:31,172 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 08:20:31,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:20:31,832 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 08:20:32,639 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 08:20:42,999 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 08:20:42,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:20:43,102 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 08:20:43,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 Int) (v_ArrVal_1898 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1895) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))) is different from false [2023-08-30 08:20:43,238 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1898 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1892) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1895) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1892) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2023-08-30 08:20:50,001 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1898 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1889))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1890)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1892) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1895) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1892) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-30 08:20:50,037 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1887 Int) (v_ArrVal_1898 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1887)) |c_~#stored_elements~0.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1889))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1890)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1892) .cse3 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1892) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1887) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1895) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse1) 2147483647))))))) is different from false [2023-08-30 08:20:50,073 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1887 Int) (v_ArrVal_1898 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1887)) |c_~#stored_elements~0.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1889))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1890)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1892) .cse5 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1892) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1887) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1895) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse1) 2147483647)))))))) is different from false [2023-08-30 08:20:50,602 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1885 Int) (v_ArrVal_1887 Int) (v_ArrVal_1898 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1885) .cse5 v_ArrVal_1887)) |c_~#stored_elements~0.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1889))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1890)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1892) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1885) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (+ (select .cse2 .cse5) 1) v_ArrVal_1887) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1895) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse7) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1892)))))))) is different from false [2023-08-30 08:20:50,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1890 Int) (v_ArrVal_1882 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1885 Int) (v_ArrVal_1887 Int) (v_ArrVal_1898 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_1882)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1885) .cse7 v_ArrVal_1887)) |c_~#stored_elements~0.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1889))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1890)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1892) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1895) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1885) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse5) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1892) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1887)))))))) is different from false [2023-08-30 08:21:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-08-30 08:21:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507681451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:21:01,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:21:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2023-08-30 08:21:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742865169] [2023-08-30 08:21:01,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:21:01,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 08:21:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:21:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 08:21:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=1625, Unknown=54, NotChecked=776, Total=2970 [2023-08-30 08:21:01,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:21:01,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 852 transitions, 17782 flow. Second operand has 55 states, 55 states have (on average 168.36363636363637) internal successors, (9260), 55 states have internal predecessors, (9260), 0 states have call successors, (0), 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 08:21:01,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:21:01,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:21:01,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:21:05,425 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 08:21:18,734 WARN L222 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 138 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:21:28,772 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 08:21:30,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:21:33,079 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 08:21:48,367 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 08:21:58,020 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 08:22:00,204 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 08:22:02,212 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 08:22:04,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:22:06,307 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 08:22:08,313 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 08:22:13,432 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 08:22:28,056 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 08:22:46,439 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 08:22:48,495 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 08:22:50,501 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 08:22:52,523 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 08:22:54,608 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 08:22:56,614 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 08:22:59,703 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 08:23:04,171 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 08:23:06,180 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 08:23:08,324 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 08:23:10,330 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 08:23:18,936 WARN L222 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 165 DAG size of output: 150 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:23:21,481 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 08:23:40,456 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 08:23:42,467 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 08:23:44,574 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 08:23:46,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:23:48,617 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 08:23:53,419 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 08:23:55,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] [2023-08-30 08:24:02,812 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 08:24:04,905 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 08:24:11,381 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 08:24:13,405 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 08:24:15,559 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 08:24:17,644 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 08:24:31,170 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 Int) (v_ArrVal_1898 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1895) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 Int) (v_ArrVal_1898 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1898) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1895) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) is different from false [2023-08-30 08:24:33,266 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 08:24:45,023 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 08:24:47,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:24:50,825 INFO L130 PetriNetUnfolder]: 3991/8719 cut-off events. [2023-08-30 08:24:50,825 INFO L131 PetriNetUnfolder]: For 1259223/1259551 co-relation queries the response was YES. [2023-08-30 08:24:50,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113361 conditions, 8719 events. 3991/8719 cut-off events. For 1259223/1259551 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 62246 event pairs, 1844 based on Foata normal form. 29/8183 useless extension candidates. Maximal degree in co-relation 112156. Up to 5875 conditions per place. [2023-08-30 08:24:50,988 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 522 selfloop transitions, 557 changer transitions 3/1088 dead transitions. [2023-08-30 08:24:50,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1088 transitions, 30468 flow [2023-08-30 08:24:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-30 08:24:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-30 08:24:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 7924 transitions. [2023-08-30 08:24:50,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3836544979180788 [2023-08-30 08:24:50,996 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 7924 transitions. [2023-08-30 08:24:50,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 7924 transitions. [2023-08-30 08:24:50,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:24:50,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 7924 transitions. [2023-08-30 08:24:51,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 172.2608695652174) internal successors, (7924), 46 states have internal predecessors, (7924), 0 states have call successors, (0), 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 08:24:51,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 449.0) internal successors, (21103), 47 states have internal predecessors, (21103), 0 states have call successors, (0), 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 08:24:51,016 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 449.0) internal successors, (21103), 47 states have internal predecessors, (21103), 0 states have call successors, (0), 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 08:24:51,016 INFO L175 Difference]: Start difference. First operand has 435 places, 852 transitions, 17782 flow. Second operand 46 states and 7924 transitions. [2023-08-30 08:24:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 1088 transitions, 30468 flow [2023-08-30 08:24:52,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 1088 transitions, 29457 flow, removed 437 selfloop flow, removed 8 redundant places. [2023-08-30 08:24:52,327 INFO L231 Difference]: Finished difference. Result has 490 places, 956 transitions, 21932 flow [2023-08-30 08:24:52,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=16887, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=21932, PETRI_PLACES=490, PETRI_TRANSITIONS=956} [2023-08-30 08:24:52,328 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 433 predicate places. [2023-08-30 08:24:52,328 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 956 transitions, 21932 flow [2023-08-30 08:24:52,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 168.36363636363637) internal successors, (9260), 55 states have internal predecessors, (9260), 0 states have call successors, (0), 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 08:24:52,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:24:52,329 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:24:52,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 08:24:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:24:52,530 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:24:52,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:24:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2049751440, now seen corresponding path program 4 times [2023-08-30 08:24:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:24:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481403361] [2023-08-30 08:24:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:24:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:24:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:24:53,906 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 08:24:53,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:24:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481403361] [2023-08-30 08:24:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481403361] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:24:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408953323] [2023-08-30 08:24:53,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 08:24:53,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:24:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:24:53,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 08:24:53,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 08:24:54,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 08:24:54,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:24:54,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 100 conjunts are in the unsatisfiable core [2023-08-30 08:24:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:24:54,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:24:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:24:54,106 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:24:54,107 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 08:24:54,121 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:24:54,121 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 08:24:54,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-08-30 08:24:54,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-30 08:24:54,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-08-30 08:24:54,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:24:54,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-30 08:24:54,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-08-30 08:24:54,729 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 50 treesize of output 43 [2023-08-30 08:24:54,837 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 44 treesize of output 44 [2023-08-30 08:24:54,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:24:55,129 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 53 treesize of output 46 [2023-08-30 08:24:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:24:55,276 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 42 treesize of output 44 [2023-08-30 08:24:57,030 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 56 treesize of output 49 [2023-08-30 08:25:01,316 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 08:25:01,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:25:01,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2022 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 08:25:01,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2019 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_2019)))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2021)) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_2021) (= .cse0 800) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-30 08:25:01,651 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2019 Int)) (let ((.cse2 (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2017)))) (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_2019))))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2021)) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_2017) (< (+ .cse0 1) v_ArrVal_2021) (= .cse0 800) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|)))))) is different from false [2023-08-30 08:25:01,850 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (v_ArrVal_2014 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2019 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_2014)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2017)))) (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_2019))))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2021)) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2017) (< (+ .cse2 1) v_ArrVal_2021) (= .cse2 800) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-30 08:25:04,251 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (v_ArrVal_2014 Int) (v_ArrVal_2013 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2019 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2013))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2014)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2017)))) (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_2019))))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_2021)) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|)) (.cse3 (select .cse6 .cse5))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2017) (< (+ .cse3 1) v_ArrVal_2021) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (= .cse3 800))))))))) is different from false [2023-08-30 08:25:04,310 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2021 Int) (v_ArrVal_2012 Int) (v_ArrVal_2023 Int) (v_ArrVal_2014 Int) (v_ArrVal_2013 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2019 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2012)) |c_~#stored_elements~0.base| v_ArrVal_2013))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2014)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2017)))) (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_2019))))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse5)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse5 v_ArrVal_2021)) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2017) (< (+ .cse0 1) v_ArrVal_2021) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2012) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse2) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|))))))))) is different from false Killed by 15