./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations 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.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 08:11:10,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 08:11:10,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 08:11:10,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 08:11:10,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 08:11:10,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 08:11:10,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 08:11:10,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 08:11:10,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 08:11:10,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 08:11:10,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 08:11:10,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 08:11:10,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 08:11:10,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 08:11:10,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 08:11:10,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 08:11:10,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 08:11:10,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 08:11:10,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 08:11:10,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 08:11:10,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 08:11:10,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 08:11:10,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 08:11:10,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 08:11:10,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 08:11:10,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 08:11:10,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 08:11:10,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 08:11:10,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 08:11:10,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 08:11:10,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 08:11:10,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 08:11:10,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 08:11:10,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 08:11:10,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 08:11:10,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 08:11:10,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 08:11:10,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 08:11:10,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 08:11:10,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 08:11:10,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 08:11:10,732 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:10,757 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 08:11:10,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 08:11:10,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 08:11:10,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 08:11:10,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 08:11:10,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 08:11:10,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 08:11:10,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 08:11:10,760 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 08:11:10,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 08:11:10,761 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 08:11:10,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 08:11:10,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 08:11:10,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 08:11:10,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 08:11:10,763 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 08:11:10,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 08:11:10,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 08:11:10,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 08:11:10,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 08:11:10,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:11:10,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 08:11:10,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 08:11:10,765 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 08:11:10,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 08:11:10,765 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 08:11:10,765 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 08:11:11,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 08:11:11,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 08:11:11,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 08:11:11,032 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 08:11:11,033 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 08:11:11,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 08:11:11,938 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 08:11:12,184 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 08:11:12,185 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 08:11:12,200 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec8ffb6c/7cdb099bd7154be0bc9098b2dc09c3d8/FLAG9a01e86be [2023-08-30 08:11:12,209 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec8ffb6c/7cdb099bd7154be0bc9098b2dc09c3d8 [2023-08-30 08:11:12,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 08:11:12,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 08:11:12,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 08:11:12,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 08:11:12,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 08:11:12,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:11:12" (1/1) ... [2023-08-30 08:11:12,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c89cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:12, skipping insertion in model container [2023-08-30 08:11:12,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:11:12" (1/1) ... [2023-08-30 08:11:12,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 08:11:12,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 08:11:12,613 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-08-30 08:11:12,616 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-08-30 08:11:12,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:11:12,631 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 08:11:12,667 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-08-30 08:11:12,673 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-08-30 08:11:12,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:11:12,738 INFO L208 MainTranslator]: Completed translation [2023-08-30 08:11:12,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:12 WrapperNode [2023-08-30 08:11:12,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 08:11:12,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 08:11:12,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 08:11:12,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 08:11:12,744 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:12" (1/1) ... [2023-08-30 08:11:12,769 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:12" (1/1) ... [2023-08-30 08:11:12,800 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-08-30 08:11:12,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 08:11:12,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 08:11:12,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 08:11:12,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 08:11:12,807 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:12" (1/1) ... [2023-08-30 08:11:12,808 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:12" (1/1) ... [2023-08-30 08:11:12,820 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:12" (1/1) ... [2023-08-30 08:11:12,823 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:12" (1/1) ... [2023-08-30 08:11:12,829 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:12" (1/1) ... [2023-08-30 08:11:12,841 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:12" (1/1) ... [2023-08-30 08:11:12,843 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:12" (1/1) ... [2023-08-30 08:11:12,847 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:12" (1/1) ... [2023-08-30 08:11:12,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 08:11:12,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 08:11:12,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 08:11:12,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 08:11:12,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:12" (1/1) ... [2023-08-30 08:11:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:11:12,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:11:12,876 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:12,896 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:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 08:11:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 08:11:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 08:11:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 08:11:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 08:11:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 08:11:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 08:11:12,903 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:13,060 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 08:11:13,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 08:11:13,365 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 08:11:13,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 08:11:13,373 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 08:11:13,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:11:13 BoogieIcfgContainer [2023-08-30 08:11:13,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 08:11:13,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 08:11:13,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 08:11:13,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 08:11:13,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:11:12" (1/3) ... [2023-08-30 08:11:13,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d54e036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:11:13, skipping insertion in model container [2023-08-30 08:11:13,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:11:12" (2/3) ... [2023-08-30 08:11:13,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d54e036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:11:13, skipping insertion in model container [2023-08-30 08:11:13,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:11:13" (3/3) ... [2023-08-30 08:11:13,382 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-30 08:11:13,388 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 08:11:13,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 08:11:13,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 08:11:13,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 08:11:13,504 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 08:11:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 08:11:13,620 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-08-30 08:11:13,620 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 08:11:13,626 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:13,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 08:11:13,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:13,636 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 08:11:13,645 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:13,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:13,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-08-30 08:11:13,701 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-08-30 08:11:13,702 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:11:13,703 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:13,707 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-08-30 08:11:20,508 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-08-30 08:11:20,509 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-08-30 08:11:20,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 08:11:20,525 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;@6068d740, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 08:11:20,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 08:11:20,532 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 08:11:20,533 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:11:20,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:20,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:20,535 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:20,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-08-30 08:11:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633609282] [2023-08-30 08:11:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:21,736 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:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633609282] [2023-08-30 08:11:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633609282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:11:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538527268] [2023-08-30 08:11:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:21,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:11:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:21,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:11:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:11:22,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 08:11:22,192 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:22,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:22,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 08:11:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:22,601 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-08-30 08:11:22,602 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 08:11:22,605 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:22,612 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-30 08:11:22,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-08-30 08:11:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-30 08:11:22,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-08-30 08:11:22,630 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-30 08:11:22,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-30 08:11:22,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:22,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-30 08:11:22,639 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:22,645 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:22,646 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:22,647 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:22,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-08-30 08:11:22,651 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:22,653 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-08-30 08:11:22,654 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:22,657 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-30 08:11:22,657 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-08-30 08:11:22,658 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:22,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:22,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:22,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 08:11:22,661 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:22,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-08-30 08:11:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587545466] [2023-08-30 08:11:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:23,237 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:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587545466] [2023-08-30 08:11:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587545466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:23,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690328233] [2023-08-30 08:11:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:23,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:23,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 08:11:23,802 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:23,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:23,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 08:11:23,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:24,263 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-08-30 08:11:24,264 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-30 08:11:24,267 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:24,276 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-08-30 08:11:24,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-08-30 08:11:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-08-30 08:11:24,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-08-30 08:11:24,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-08-30 08:11:24,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-08-30 08:11:24,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:24,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-08-30 08:11:24,282 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:24,286 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:24,287 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:24,287 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:24,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-08-30 08:11:24,291 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:24,292 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-08-30 08:11:24,292 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:24,293 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-08-30 08:11:24,293 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-08-30 08:11:24,294 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:24,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:24,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 08:11:24,295 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:24,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-08-30 08:11:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682838232] [2023-08-30 08:11:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:24,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:24,635 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:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682838232] [2023-08-30 08:11:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682838232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:24,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341121006] [2023-08-30 08:11:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:24,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:24,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:24,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:24,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 08:11:24,845 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:24,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:24,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 08:11:24,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:25,265 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-08-30 08:11:25,265 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 08:11:25,270 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:25,281 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 08:11:25,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-08-30 08:11:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 08:11:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 08:11:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-30 08:11:25,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-08-30 08:11:25,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-30 08:11:25,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-30 08:11:25,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:25,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-30 08:11:25,287 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:25,289 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:25,290 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:25,291 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:25,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-08-30 08:11:25,296 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:25,298 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-08-30 08:11:25,298 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:25,298 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-30 08:11:25,299 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-08-30 08:11:25,299 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:25,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:25,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:25,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 08:11:25,300 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:25,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-08-30 08:11:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:25,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961343432] [2023-08-30 08:11:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:25,336 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:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961343432] [2023-08-30 08:11:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961343432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:11:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775118963] [2023-08-30 08:11:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:25,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 08:11:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 08:11:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 08:11:25,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-08-30 08:11:25,355 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:25,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:25,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-08-30 08:11:25,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:25,920 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-08-30 08:11:25,920 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-08-30 08:11:25,929 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:25,953 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-08-30 08:11:25,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-08-30 08:11:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 08:11:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 08:11:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 08:11:25,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-08-30 08:11:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 08:11:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 08:11:25,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:25,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 08:11:25,960 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:25,963 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:25,963 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:25,964 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:25,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-08-30 08:11:25,970 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:25,972 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-08-30 08:11:25,972 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:25,973 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-30 08:11:25,973 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-08-30 08:11:25,973 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:25,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:25,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:25,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 08:11:25,974 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:25,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-08-30 08:11:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368792708] [2023-08-30 08:11:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:26,466 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:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368792708] [2023-08-30 08:11:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368792708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:11:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567502843] [2023-08-30 08:11:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:26,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:11:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:11:26,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:11:26,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 08:11:26,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:26,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:26,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 08:11:26,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:27,391 INFO L130 PetriNetUnfolder]: 3404/5688 cut-off events. [2023-08-30 08:11:27,391 INFO L131 PetriNetUnfolder]: For 2514/2522 co-relation queries the response was YES. [2023-08-30 08:11:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13911 conditions, 5688 events. 3404/5688 cut-off events. For 2514/2522 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34241 event pairs, 2258 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 9525. Up to 5474 conditions per place. [2023-08-30 08:11:27,422 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-08-30 08:11:27,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 554 flow [2023-08-30 08:11:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-08-30 08:11:27,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974016332590943 [2023-08-30 08:11:27,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-08-30 08:11:27,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-08-30 08:11:27,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:27,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-08-30 08:11:27,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:27,430 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:27,431 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:27,431 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 6 states and 1340 transitions. [2023-08-30 08:11:27,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 554 flow [2023-08-30 08:11:27,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:11:27,439 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 404 flow [2023-08-30 08:11:27,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-08-30 08:11:27,441 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-08-30 08:11:27,441 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 404 flow [2023-08-30 08:11:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:27,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:27,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 08:11:27,442 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:27,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-08-30 08:11:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816654683] [2023-08-30 08:11:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:11:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816654683] [2023-08-30 08:11:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816654683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538486623] [2023-08-30 08:11:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:27,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:28,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 08:11:28,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:28,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:28,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 08:11:28,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:29,535 INFO L130 PetriNetUnfolder]: 3697/6100 cut-off events. [2023-08-30 08:11:29,535 INFO L131 PetriNetUnfolder]: For 1866/1896 co-relation queries the response was YES. [2023-08-30 08:11:29,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 6100 events. 3697/6100 cut-off events. For 1866/1896 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37242 event pairs, 626 based on Foata normal form. 94/5216 useless extension candidates. Maximal degree in co-relation 11952. Up to 4451 conditions per place. [2023-08-30 08:11:29,566 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 141 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2023-08-30 08:11:29,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 168 transitions, 969 flow [2023-08-30 08:11:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:11:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:11:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1393 transitions. [2023-08-30 08:11:29,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170749814402376 [2023-08-30 08:11:29,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1393 transitions. [2023-08-30 08:11:29,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1393 transitions. [2023-08-30 08:11:29,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:29,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1393 transitions. [2023-08-30 08:11:29,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.16666666666666) internal successors, (1393), 6 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:29,575 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:29,576 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:29,576 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 404 flow. Second operand 6 states and 1393 transitions. [2023-08-30 08:11:29,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 168 transitions, 969 flow [2023-08-30 08:11:29,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 08:11:29,595 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 456 flow [2023-08-30 08:11:29,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-30 08:11:29,597 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-08-30 08:11:29,597 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 456 flow [2023-08-30 08:11:29,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:29,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:29,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:29,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 08:11:29,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:29,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1523080992, now seen corresponding path program 1 times [2023-08-30 08:11:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171300141] [2023-08-30 08:11:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:29,847 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,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171300141] [2023-08-30 08:11:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171300141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:11:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790718440] [2023-08-30 08:11:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:29,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:11:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:11:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:11:30,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 08:11:30,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:30,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 08:11:30,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:30,518 INFO L130 PetriNetUnfolder]: 3933/6511 cut-off events. [2023-08-30 08:11:30,518 INFO L131 PetriNetUnfolder]: For 3371/3393 co-relation queries the response was YES. [2023-08-30 08:11:30,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 6511 events. 3933/6511 cut-off events. For 3371/3393 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 39424 event pairs, 722 based on Foata normal form. 94/5591 useless extension candidates. Maximal degree in co-relation 12673. Up to 4119 conditions per place. [2023-08-30 08:11:30,544 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 126 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2023-08-30 08:11:30,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 939 flow [2023-08-30 08:11:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 08:11:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 08:11:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1170 transitions. [2023-08-30 08:11:30,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211581291759465 [2023-08-30 08:11:30,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1170 transitions. [2023-08-30 08:11:30,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1170 transitions. [2023-08-30 08:11:30,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:30,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1170 transitions. [2023-08-30 08:11:30,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,551 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:30,552 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:30,552 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 456 flow. Second operand 5 states and 1170 transitions. [2023-08-30 08:11:30,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 939 flow [2023-08-30 08:11:30,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 907 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 08:11:30,573 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 497 flow [2023-08-30 08:11:30,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=497, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-30 08:11:30,574 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-08-30 08:11:30,575 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 497 flow [2023-08-30 08:11:30,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:30,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:30,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 08:11:30,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:30,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-08-30 08:11:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:30,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177723359] [2023-08-30 08:11:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:30,630 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:30,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:30,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177723359] [2023-08-30 08:11:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177723359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:11:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294026088] [2023-08-30 08:11:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:30,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:11:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:11:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:11:30,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:11:30,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:30,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:11:30,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:30,763 INFO L130 PetriNetUnfolder]: 716/1428 cut-off events. [2023-08-30 08:11:30,763 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-08-30 08:11:30,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1428 events. 716/1428 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8101 event pairs, 457 based on Foata normal form. 64/1344 useless extension candidates. Maximal degree in co-relation 2930. Up to 761 conditions per place. [2023-08-30 08:11:30,767 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-08-30 08:11:30,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 595 flow [2023-08-30 08:11:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:11:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:11:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-08-30 08:11:30,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-08-30 08:11:30,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-08-30 08:11:30,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-08-30 08:11:30,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:30,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-08-30 08:11:30,771 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:30,773 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:30,773 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:30,773 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 497 flow. Second operand 3 states and 725 transitions. [2023-08-30 08:11:30,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 595 flow [2023-08-30 08:11:30,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 573 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 08:11:30,777 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 08:11:30,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-08-30 08:11:30,778 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 08:11:30,778 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 08:11:30,778 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:30,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:30,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 08:11:30,779 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:30,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -240537722, now seen corresponding path program 1 times [2023-08-30 08:11:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783018457] [2023-08-30 08:11:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:30,805 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:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783018457] [2023-08-30 08:11:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783018457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:11:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:11:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:11:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258825256] [2023-08-30 08:11:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:11:30,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:11:30,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:11:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:11:30,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 08:11:30,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:30,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 08:11:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:30,915 INFO L130 PetriNetUnfolder]: 528/1058 cut-off events. [2023-08-30 08:11:30,916 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-08-30 08:11:30,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1058 events. 528/1058 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5246 event pairs, 390 based on Foata normal form. 8/948 useless extension candidates. Maximal degree in co-relation 2085. Up to 780 conditions per place. [2023-08-30 08:11:30,920 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 75 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 08:11:30,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 560 flow [2023-08-30 08:11:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:11:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:11:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-08-30 08:11:30,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-08-30 08:11:30,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-08-30 08:11:30,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-08-30 08:11:30,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:30,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-08-30 08:11:30,924 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:30,925 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:30,926 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:30,926 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 3 states and 732 transitions. [2023-08-30 08:11:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 560 flow [2023-08-30 08:11:30,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 552 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 08:11:30,929 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 08:11:30,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-08-30 08:11:30,930 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 08:11:30,930 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 08:11:30,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:30,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:30,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:30,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 08:11:30,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:30,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-08-30 08:11:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635303300] [2023-08-30 08:11:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:31,201 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:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:31,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635303300] [2023-08-30 08:11:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635303300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:11:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772530616] [2023-08-30 08:11:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:31,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:11:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:11:31,204 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:31,224 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:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:31,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 08:11:31,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:11:31,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:31,436 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:11:31,453 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:31,463 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:11:31,463 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:31,552 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:31,665 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:31,774 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:31,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:31,818 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:31,895 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:31,943 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:31,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:11:32,036 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_373) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-08-30 08:11:32,050 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2023-08-30 08:11:32,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373))))) is different from false [2023-08-30 08:11:34,218 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_369)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_372) .cse3 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) .cse1) 2147483650)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_373) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ v_ArrVal_372 2147483648) 0)))))) is different from false [2023-08-30 08:11:34,277 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:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772530616] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:11:34,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:11:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 08:11:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063209079] [2023-08-30 08:11:34,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:11:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 08:11:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:11:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 08:11:34,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=487, Unknown=14, NotChecked=204, Total=870 [2023-08-30 08:11:34,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-08-30 08:11:34,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:11:34,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:11:34,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-08-30 08:11:34,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:11:43,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:11:46,158 INFO L130 PetriNetUnfolder]: 1225/2416 cut-off events. [2023-08-30 08:11:46,158 INFO L131 PetriNetUnfolder]: For 770/770 co-relation queries the response was YES. [2023-08-30 08:11:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2416 events. 1225/2416 cut-off events. For 770/770 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14571 event pairs, 542 based on Foata normal form. 1/2132 useless extension candidates. Maximal degree in co-relation 4415. Up to 808 conditions per place. [2023-08-30 08:11:46,169 INFO L137 encePairwiseOnDemand]: 424/449 looper letters, 148 selfloop transitions, 75 changer transitions 4/233 dead transitions. [2023-08-30 08:11:46,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 233 transitions, 1375 flow [2023-08-30 08:11:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-30 08:11:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-30 08:11:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4972 transitions. [2023-08-30 08:11:46,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39548202354438433 [2023-08-30 08:11:46,179 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4972 transitions. [2023-08-30 08:11:46,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4972 transitions. [2023-08-30 08:11:46,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:11:46,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4972 transitions. [2023-08-30 08:11:46,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 177.57142857142858) internal successors, (4972), 28 states have internal predecessors, (4972), 0 states have call successors, (0), 0 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:46,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 449.0) internal successors, (13021), 29 states have internal predecessors, (13021), 0 states have call successors, (0), 0 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:46,202 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 449.0) internal successors, (13021), 29 states have internal predecessors, (13021), 0 states have call successors, (0), 0 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:46,202 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 28 states and 4972 transitions. [2023-08-30 08:11:46,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 233 transitions, 1375 flow [2023-08-30 08:11:46,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 233 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:11:46,208 INFO L231 Difference]: Finished difference. Result has 127 places, 132 transitions, 884 flow [2023-08-30 08:11:46,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=884, PETRI_PLACES=127, PETRI_TRANSITIONS=132} [2023-08-30 08:11:46,209 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places. [2023-08-30 08:11:46,209 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 132 transitions, 884 flow [2023-08-30 08:11:46,210 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:11:46,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:11:46,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:11:46,217 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:11:46,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-30 08:11:46,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:11:46,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:11:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 1 times [2023-08-30 08:11:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:11:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639303125] [2023-08-30 08:11:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:11:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:47,213 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:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:11:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639303125] [2023-08-30 08:11:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639303125] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:11:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416759874] [2023-08-30 08:11:47,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:11:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:11:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:11:47,229 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:11:47,233 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:11:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:11:47,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 08:11:47,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:11:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:47,361 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:11:47,362 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:47,379 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:11:47,379 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:11:47,473 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:47,572 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:11:47,696 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:47,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:11:47,748 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:47,803 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:47,903 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:48,002 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:48,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:11:48,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 08:11:48,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 08:11:50,105 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_476) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 08:12:02,933 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:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416759874] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:12:02,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:12:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 08:12:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580933676] [2023-08-30 08:12:02,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:12:02,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 08:12:02,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:12:02,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 08:12:02,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=734, Unknown=25, NotChecked=186, Total=1190 [2023-08-30 08:12:02,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:12:02,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 132 transitions, 884 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:02,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:12:02,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:12:02,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:12:16,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, 1] [2023-08-30 08:12:19,024 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:21,050 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:12:23,116 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:34,057 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:35,405 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_476)))) (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_476) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647)))))) is different from false [2023-08-30 08:12:38,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:40,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:42,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:12:45,432 INFO L130 PetriNetUnfolder]: 1930/3774 cut-off events. [2023-08-30 08:12:45,432 INFO L131 PetriNetUnfolder]: For 2857/2891 co-relation queries the response was YES. [2023-08-30 08:12:45,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11404 conditions, 3774 events. 1930/3774 cut-off events. For 2857/2891 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 24913 event pairs, 611 based on Foata normal form. 0/3402 useless extension candidates. Maximal degree in co-relation 10585. Up to 1947 conditions per place. [2023-08-30 08:12:45,452 INFO L137 encePairwiseOnDemand]: 427/449 looper letters, 213 selfloop transitions, 87 changer transitions 3/309 dead transitions. [2023-08-30 08:12:45,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 309 transitions, 2353 flow [2023-08-30 08:12:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 08:12:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 08:12:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4577 transitions. [2023-08-30 08:12:45,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39206784307007025 [2023-08-30 08:12:45,459 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4577 transitions. [2023-08-30 08:12:45,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4577 transitions. [2023-08-30 08:12:45,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:12:45,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4577 transitions. [2023-08-30 08:12:45,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 176.03846153846155) internal successors, (4577), 26 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:45,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 449.0) internal successors, (12123), 27 states have internal predecessors, (12123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:45,477 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 449.0) internal successors, (12123), 27 states have internal predecessors, (12123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:45,477 INFO L175 Difference]: Start difference. First operand has 127 places, 132 transitions, 884 flow. Second operand 26 states and 4577 transitions. [2023-08-30 08:12:45,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 309 transitions, 2353 flow [2023-08-30 08:12:45,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 309 transitions, 2178 flow, removed 69 selfloop flow, removed 11 redundant places. [2023-08-30 08:12:45,493 INFO L231 Difference]: Finished difference. Result has 152 places, 183 transitions, 1371 flow [2023-08-30 08:12:45,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1371, PETRI_PLACES=152, PETRI_TRANSITIONS=183} [2023-08-30 08:12:45,494 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places. [2023-08-30 08:12:45,494 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 183 transitions, 1371 flow [2023-08-30 08:12:45,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:45,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:12:45,496 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:12:45,512 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:45,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-30 08:12:45,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:12:45,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:12:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash 444195113, now seen corresponding path program 1 times [2023-08-30 08:12:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:12:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271549497] [2023-08-30 08:12:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:12:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:46,051 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:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:12:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271549497] [2023-08-30 08:12:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271549497] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:12:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959726878] [2023-08-30 08:12:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:12:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:12:46,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:12:46,065 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:46,100 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:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:12:46,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 08:12:46,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:12:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:46,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:46,259 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:12:46,259 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:46,285 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:12:46,285 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:46,414 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:46,505 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:12:46,599 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:46,719 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:46,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:12:46,777 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:46,931 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:47,051 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:47,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:12:47,140 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))) is different from false [2023-08-30 08:12:47,300 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_579)))))) is different from false [2023-08-30 08:12:47,351 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< v_ArrVal_576 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2023-08-30 08:12:47,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ v_ArrVal_576 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 08:12:47,407 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_575) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_576 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))) is different from false [2023-08-30 08:12:47,552 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:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959726878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:12:47,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:12:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-08-30 08:12:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150419593] [2023-08-30 08:12:47,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:12:47,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 08:12:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:12:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 08:12:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=561, Unknown=26, NotChecked=280, Total=1056 [2023-08-30 08:12:50,290 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:12:50,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 449 [2023-08-30 08:12:50,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 183 transitions, 1371 flow. Second operand has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:12:50,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:12:50,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 449 [2023-08-30 08:12:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:05,019 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:18,502 INFO L130 PetriNetUnfolder]: 2944/5800 cut-off events. [2023-08-30 08:13:18,502 INFO L131 PetriNetUnfolder]: For 18026/18082 co-relation queries the response was YES. [2023-08-30 08:13:18,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23250 conditions, 5800 events. 2944/5800 cut-off events. For 18026/18082 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 40676 event pairs, 835 based on Foata normal form. 125/5425 useless extension candidates. Maximal degree in co-relation 22930. Up to 1943 conditions per place. [2023-08-30 08:13:18,535 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 285 selfloop transitions, 141 changer transitions 3/435 dead transitions. [2023-08-30 08:13:18,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 435 transitions, 4133 flow [2023-08-30 08:13:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-30 08:13:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-30 08:13:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5791 transitions. [2023-08-30 08:13:18,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39083485185935074 [2023-08-30 08:13:18,542 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5791 transitions. [2023-08-30 08:13:18,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5791 transitions. [2023-08-30 08:13:18,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:18,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5791 transitions. [2023-08-30 08:13:18,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 175.4848484848485) internal successors, (5791), 33 states have internal predecessors, (5791), 0 states have call successors, (0), 0 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:18,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 449.0) internal successors, (15266), 34 states have internal predecessors, (15266), 0 states have call successors, (0), 0 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:18,561 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 449.0) internal successors, (15266), 34 states have internal predecessors, (15266), 0 states have call successors, (0), 0 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:18,561 INFO L175 Difference]: Start difference. First operand has 152 places, 183 transitions, 1371 flow. Second operand 33 states and 5791 transitions. [2023-08-30 08:13:18,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 435 transitions, 4133 flow [2023-08-30 08:13:18,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 435 transitions, 3938 flow, removed 67 selfloop flow, removed 9 redundant places. [2023-08-30 08:13:18,608 INFO L231 Difference]: Finished difference. Result has 185 places, 249 transitions, 2234 flow [2023-08-30 08:13:18,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2234, PETRI_PLACES=185, PETRI_TRANSITIONS=249} [2023-08-30 08:13:18,609 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 128 predicate places. [2023-08-30 08:13:18,609 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 249 transitions, 2234 flow [2023-08-30 08:13:18,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:18,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:18,610 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:18,619 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:13:18,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:18,814 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:18,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 2 times [2023-08-30 08:13:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723593645] [2023-08-30 08:13:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:19,531 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:13:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723593645] [2023-08-30 08:13:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723593645] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:13:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062201361] [2023-08-30 08:13:19,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:13:19,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:19,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:13:19,533 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:13:19,535 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:13:19,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:13:19,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:13:19,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-30 08:13:19,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:13:19,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:19,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:19,696 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:13:19,696 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:19,712 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:13:19,713 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:19,810 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:13:19,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-30 08:13:19,993 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:13:20,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:20,038 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:13:20,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 45 treesize of output 38 [2023-08-30 08:13:20,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-08-30 08:13:20,228 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:13:20,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:13:20,247 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 08:13:20,331 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))) is different from false [2023-08-30 08:13:20,348 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_681))))) is different from false [2023-08-30 08:13:20,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_681)))))) is different from false [2023-08-30 08:13:20,397 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse3 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_681) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_679)))))) is different from false [2023-08-30 08:13:20,502 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_679) .cse1 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_681) (< (+ (select .cse0 .cse2) 1) v_ArrVal_679) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-30 08:13:24,626 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:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062201361] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:24,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 08:13:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882051517] [2023-08-30 08:13:24,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:24,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 08:13:24,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 08:13:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=590, Unknown=17, NotChecked=354, Total=1190 [2023-08-30 08:13:24,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:13:24,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 249 transitions, 2234 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:24,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:24,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:13:24,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:35,987 WARN L222 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:13:38,131 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:40,136 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:41,728 INFO L130 PetriNetUnfolder]: 3648/7219 cut-off events. [2023-08-30 08:13:41,728 INFO L131 PetriNetUnfolder]: For 93042/93216 co-relation queries the response was YES. [2023-08-30 08:13:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41212 conditions, 7219 events. 3648/7219 cut-off events. For 93042/93216 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 53076 event pairs, 1470 based on Foata normal form. 53/6656 useless extension candidates. Maximal degree in co-relation 40706. Up to 4339 conditions per place. [2023-08-30 08:13:41,771 INFO L137 encePairwiseOnDemand]: 430/449 looper letters, 302 selfloop transitions, 120 changer transitions 3/431 dead transitions. [2023-08-30 08:13:41,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 431 transitions, 5629 flow [2023-08-30 08:13:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 08:13:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 08:13:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4228 transitions. [2023-08-30 08:13:41,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39235337787676317 [2023-08-30 08:13:41,776 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4228 transitions. [2023-08-30 08:13:41,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4228 transitions. [2023-08-30 08:13:41,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:41,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4228 transitions. [2023-08-30 08:13:41,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 176.16666666666666) internal successors, (4228), 24 states have internal predecessors, (4228), 0 states have call successors, (0), 0 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,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 449.0) internal successors, (11225), 25 states have internal predecessors, (11225), 0 states have call successors, (0), 0 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,787 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 449.0) internal successors, (11225), 25 states have internal predecessors, (11225), 0 states have call successors, (0), 0 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,787 INFO L175 Difference]: Start difference. First operand has 185 places, 249 transitions, 2234 flow. Second operand 24 states and 4228 transitions. [2023-08-30 08:13:41,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 431 transitions, 5629 flow [2023-08-30 08:13:41,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 431 transitions, 5015 flow, removed 250 selfloop flow, removed 15 redundant places. [2023-08-30 08:13:41,839 INFO L231 Difference]: Finished difference. Result has 207 places, 310 transitions, 2983 flow [2023-08-30 08:13:41,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2983, PETRI_PLACES=207, PETRI_TRANSITIONS=310} [2023-08-30 08:13:41,840 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 150 predicate places. [2023-08-30 08:13:41,840 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 310 transitions, 2983 flow [2023-08-30 08:13:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:41,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:41,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:41,849 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:13:42,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:42,049 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:42,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1298397099, now seen corresponding path program 1 times [2023-08-30 08:13:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306165264] [2023-08-30 08:13:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:42,915 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:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306165264] [2023-08-30 08:13:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306165264] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:13:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019941162] [2023-08-30 08:13:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:42,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:13:42,916 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:13:42,918 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:13:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:43,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 08:13:43,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:13:43,191 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 21 [2023-08-30 08:13:43,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:43,226 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 28 treesize of output 28 [2023-08-30 08:13:43,297 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-30 08:13:43,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2023-08-30 08:13:43,335 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 28 [2023-08-30 08:13:43,345 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:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:13:43,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:43,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-08-30 08:13:43,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:43,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2023-08-30 08:13:43,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-08-30 08:13:43,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-30 08:13:43,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:43,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-08-30 08:13:43,820 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:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019941162] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:43,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-08-30 08:13:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531243546] [2023-08-30 08:13:43,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 08:13:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 08:13:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=581, Unknown=2, NotChecked=0, Total=702 [2023-08-30 08:13:44,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 08:13:44,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 310 transitions, 2983 flow. Second operand has 27 states, 27 states have (on average 175.11111111111111) internal successors, (4728), 27 states have internal predecessors, (4728), 0 states have call successors, (0), 0 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:44,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:44,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 08:13:44,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:48,445 INFO L130 PetriNetUnfolder]: 6568/12744 cut-off events. [2023-08-30 08:13:48,445 INFO L131 PetriNetUnfolder]: For 279702/281456 co-relation queries the response was YES. [2023-08-30 08:13:48,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83496 conditions, 12744 events. 6568/12744 cut-off events. For 279702/281456 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 99542 event pairs, 2299 based on Foata normal form. 108/11666 useless extension candidates. Maximal degree in co-relation 82789. Up to 4033 conditions per place. [2023-08-30 08:13:48,540 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 516 selfloop transitions, 198 changer transitions 3/723 dead transitions. [2023-08-30 08:13:48,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 723 transitions, 9431 flow [2023-08-30 08:13:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 08:13:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 08:13:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4661 transitions. [2023-08-30 08:13:48,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41523385300668153 [2023-08-30 08:13:48,545 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4661 transitions. [2023-08-30 08:13:48,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4661 transitions. [2023-08-30 08:13:48,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:48,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4661 transitions. [2023-08-30 08:13:48,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 186.44) internal successors, (4661), 25 states have internal predecessors, (4661), 0 states have call successors, (0), 0 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:48,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:48,556 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:48,556 INFO L175 Difference]: Start difference. First operand has 207 places, 310 transitions, 2983 flow. Second operand 25 states and 4661 transitions. [2023-08-30 08:13:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 723 transitions, 9431 flow [2023-08-30 08:13:48,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 723 transitions, 8924 flow, removed 244 selfloop flow, removed 3 redundant places. [2023-08-30 08:13:48,672 INFO L231 Difference]: Finished difference. Result has 239 places, 406 transitions, 4367 flow [2023-08-30 08:13:48,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4367, PETRI_PLACES=239, PETRI_TRANSITIONS=406} [2023-08-30 08:13:48,673 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 182 predicate places. [2023-08-30 08:13:48,673 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 406 transitions, 4367 flow [2023-08-30 08:13:48,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 175.11111111111111) internal successors, (4728), 27 states have internal predecessors, (4728), 0 states have call successors, (0), 0 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:48,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:48,674 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:48,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 08:13:48,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-30 08:13:48,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:48,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 321388709, now seen corresponding path program 2 times [2023-08-30 08:13:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963216209] [2023-08-30 08:13:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:49,585 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:49,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963216209] [2023-08-30 08:13:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963216209] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:13:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137190097] [2023-08-30 08:13:49,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:13:49,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:49,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:13:49,601 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:49,645 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:49,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:13:49,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:13:49,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-30 08:13:49,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:13:49,834 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:13:49,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:13:49,950 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:13:49,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:13:49,979 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:13:50,045 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-08-30 08:13:50,046 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:13:50,095 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:13:50,104 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:13:50,128 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:50,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:13:50,184 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_866)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_867) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-08-30 08:13:50,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:50,344 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:13:50,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:50,351 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:13:50,354 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:13:50,360 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:13:50,384 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:13:50,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:13:50,393 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:13:50,532 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:13:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137190097] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:50,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 24 [2023-08-30 08:13:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101619839] [2023-08-30 08:13:50,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 08:13:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 08:13:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=494, Unknown=5, NotChecked=46, Total=650 [2023-08-30 08:13:50,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 449 [2023-08-30 08:13:50,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 406 transitions, 4367 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:13:50,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:50,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 449 [2023-08-30 08:13:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:53,282 INFO L130 PetriNetUnfolder]: 6469/12638 cut-off events. [2023-08-30 08:13:53,282 INFO L131 PetriNetUnfolder]: For 281796/283536 co-relation queries the response was YES. [2023-08-30 08:13:53,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84142 conditions, 12638 events. 6469/12638 cut-off events. For 281796/283536 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 99261 event pairs, 2642 based on Foata normal form. 101/11553 useless extension candidates. Maximal degree in co-relation 83471. Up to 9294 conditions per place. [2023-08-30 08:13:53,391 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 408 selfloop transitions, 45 changer transitions 3/462 dead transitions. [2023-08-30 08:13:53,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 462 transitions, 5983 flow [2023-08-30 08:13:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 08:13:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 08:13:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1856 transitions. [2023-08-30 08:13:53,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4133630289532294 [2023-08-30 08:13:53,394 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1856 transitions. [2023-08-30 08:13:53,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1856 transitions. [2023-08-30 08:13:53,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:53,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1856 transitions. [2023-08-30 08:13:53,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 185.6) internal successors, (1856), 10 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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:53,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 449.0) internal successors, (4939), 11 states have internal predecessors, (4939), 0 states have call successors, (0), 0 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:53,399 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 449.0) internal successors, (4939), 11 states have internal predecessors, (4939), 0 states have call successors, (0), 0 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:53,399 INFO L175 Difference]: Start difference. First operand has 239 places, 406 transitions, 4367 flow. Second operand 10 states and 1856 transitions. [2023-08-30 08:13:53,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 462 transitions, 5983 flow [2023-08-30 08:13:53,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 462 transitions, 5821 flow, removed 57 selfloop flow, removed 7 redundant places. [2023-08-30 08:13:53,611 INFO L231 Difference]: Finished difference. Result has 240 places, 394 transitions, 4140 flow [2023-08-30 08:13:53,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4050, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4140, PETRI_PLACES=240, PETRI_TRANSITIONS=394} [2023-08-30 08:13:53,612 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 183 predicate places. [2023-08-30 08:13:53,612 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 394 transitions, 4140 flow [2023-08-30 08:13:53,613 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:13:53,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:53,613 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:53,618 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:13:53,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 08:13:53,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:53,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash -660856952, now seen corresponding path program 1 times [2023-08-30 08:13:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720847104] [2023-08-30 08:13:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:53,853 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:13:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720847104] [2023-08-30 08:13:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720847104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:13:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:13:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:13:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333212537] [2023-08-30 08:13:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:13:53,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:13:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:13:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:13:53,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 08:13:53,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 394 transitions, 4140 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:53,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:53,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 08:13:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:55,761 INFO L130 PetriNetUnfolder]: 6199/12240 cut-off events. [2023-08-30 08:13:55,762 INFO L131 PetriNetUnfolder]: For 266711/268262 co-relation queries the response was YES. [2023-08-30 08:13:55,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79253 conditions, 12240 events. 6199/12240 cut-off events. For 266711/268262 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 96521 event pairs, 3923 based on Foata normal form. 14/11212 useless extension candidates. Maximal degree in co-relation 78720. Up to 11353 conditions per place. [2023-08-30 08:13:55,888 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 366 selfloop transitions, 1 changer transitions 3/395 dead transitions. [2023-08-30 08:13:55,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 395 transitions, 4944 flow [2023-08-30 08:13:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:13:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:13:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-08-30 08:13:55,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-08-30 08:13:55,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-08-30 08:13:55,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-08-30 08:13:55,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:55,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-08-30 08:13:55,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:55,892 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:13:55,892 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:13:55,892 INFO L175 Difference]: Start difference. First operand has 240 places, 394 transitions, 4140 flow. Second operand 3 states and 723 transitions. [2023-08-30 08:13:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 395 transitions, 4944 flow [2023-08-30 08:13:56,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 395 transitions, 4851 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-30 08:13:56,038 INFO L231 Difference]: Finished difference. Result has 232 places, 387 transitions, 3986 flow [2023-08-30 08:13:56,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3984, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3986, PETRI_PLACES=232, PETRI_TRANSITIONS=387} [2023-08-30 08:13:56,038 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 175 predicate places. [2023-08-30 08:13:56,039 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 387 transitions, 3986 flow [2023-08-30 08:13:56,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:56,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:56,039 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:13:56,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 08:13:56,039 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:56,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -660856951, now seen corresponding path program 1 times [2023-08-30 08:13:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641762155] [2023-08-30 08:13:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:56,079 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:13:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641762155] [2023-08-30 08:13:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641762155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:13:56,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:13:56,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:13:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705245703] [2023-08-30 08:13:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:13:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:13:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:13:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:13:56,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:13:56,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 387 transitions, 3986 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:13:56,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:56,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:13:56,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:13:57,780 INFO L130 PetriNetUnfolder]: 6045/11998 cut-off events. [2023-08-30 08:13:57,780 INFO L131 PetriNetUnfolder]: For 256069/258568 co-relation queries the response was YES. [2023-08-30 08:13:57,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76230 conditions, 11998 events. 6045/11998 cut-off events. For 256069/258568 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 94615 event pairs, 3755 based on Foata normal form. 45/11084 useless extension candidates. Maximal degree in co-relation 75697. Up to 8015 conditions per place. [2023-08-30 08:13:57,882 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 328 selfloop transitions, 37 changer transitions 0/390 dead transitions. [2023-08-30 08:13:57,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 390 transitions, 4804 flow [2023-08-30 08:13:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:13:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:13:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-08-30 08:13:57,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-08-30 08:13:57,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-08-30 08:13:57,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-08-30 08:13:57,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:13:57,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-08-30 08:13:57,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:57,885 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:13:57,885 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:13:57,885 INFO L175 Difference]: Start difference. First operand has 232 places, 387 transitions, 3986 flow. Second operand 3 states and 717 transitions. [2023-08-30 08:13:57,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 390 transitions, 4804 flow [2023-08-30 08:13:57,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 390 transitions, 4801 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 08:13:58,001 INFO L231 Difference]: Finished difference. Result has 232 places, 380 transitions, 3989 flow [2023-08-30 08:13:58,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3915, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3989, PETRI_PLACES=232, PETRI_TRANSITIONS=380} [2023-08-30 08:13:58,002 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 175 predicate places. [2023-08-30 08:13:58,002 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 380 transitions, 3989 flow [2023-08-30 08:13:58,003 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:13:58,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:13:58,003 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:13:58,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 08:13:58,003 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:13:58,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:13:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 855812905, now seen corresponding path program 1 times [2023-08-30 08:13:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:13:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788540709] [2023-08-30 08:13:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:13:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:58,034 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:13:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:13:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788540709] [2023-08-30 08:13:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788540709] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:13:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464748385] [2023-08-30 08:13:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:13:58,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:13:58,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:13:58,037 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:13:58,039 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:13:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:13:58,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 08:13:58,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:13:58,162 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:13:58,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:13:58,180 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:13:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464748385] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:13:58,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:13:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 08:13:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009161961] [2023-08-30 08:13:58,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:13:58,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:13:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:13:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:13:58,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:13:58,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 08:13:58,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 380 transitions, 3989 flow. Second operand has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:13:58,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:13:58,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 08:13:58,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:14:00,067 INFO L130 PetriNetUnfolder]: 5328/10520 cut-off events. [2023-08-30 08:14:00,068 INFO L131 PetriNetUnfolder]: For 255115/257629 co-relation queries the response was YES. [2023-08-30 08:14:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75015 conditions, 10520 events. 5328/10520 cut-off events. For 255115/257629 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 77553 event pairs, 2814 based on Foata normal form. 177/9979 useless extension candidates. Maximal degree in co-relation 74410. Up to 5539 conditions per place. [2023-08-30 08:14:00,173 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 396 selfloop transitions, 28 changer transitions 0/449 dead transitions. [2023-08-30 08:14:00,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 449 transitions, 5876 flow [2023-08-30 08:14:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:14:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:14:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-30 08:14:00,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289532293986637 [2023-08-30 08:14:00,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-30 08:14:00,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-30 08:14:00,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:14:00,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-30 08:14:00,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:14:00,179 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:14:00,179 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:14:00,180 INFO L175 Difference]: Start difference. First operand has 232 places, 380 transitions, 3989 flow. Second operand 6 states and 1425 transitions. [2023-08-30 08:14:00,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 449 transitions, 5876 flow [2023-08-30 08:14:00,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 449 transitions, 5802 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-30 08:14:00,314 INFO L231 Difference]: Finished difference. Result has 240 places, 385 transitions, 4145 flow [2023-08-30 08:14:00,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4145, PETRI_PLACES=240, PETRI_TRANSITIONS=385} [2023-08-30 08:14:00,315 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 183 predicate places. [2023-08-30 08:14:00,315 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 385 transitions, 4145 flow [2023-08-30 08:14:00,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:14:00,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:14:00,316 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:14:00,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:00,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:00,516 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:14:00,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:14:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash -727572926, now seen corresponding path program 3 times [2023-08-30 08:14:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:14:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761109203] [2023-08-30 08:14:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:14:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:14:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:14:01,814 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:14:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:14:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761109203] [2023-08-30 08:14:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761109203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:14:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015101667] [2023-08-30 08:14:01,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 08:14:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:14:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:14:01,816 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:01,818 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:02,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 08:14:02,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:14:02,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 98 conjunts are in the unsatisfiable core [2023-08-30 08:14:02,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:14:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:02,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:02,143 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:14:02,143 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:02,156 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:14:02,157 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:02,247 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:02,335 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:02,461 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:02,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:02,536 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:02,685 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:14:02,908 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:14:03,358 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 48 treesize of output 48 [2023-08-30 08:14:03,454 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:14:07,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:14:07,841 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:14:13,177 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:14:21,767 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:14:21,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:14:21,852 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))) is different from false [2023-08-30 08:14:21,868 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1158)) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1158) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))) is different from false [2023-08-30 08:14:21,883 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1158)))) is different from false [2023-08-30 08:14:22,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1154) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1158))))) is different from false [2023-08-30 08:14:32,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 Int) (v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1151 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1150)) |c_~#stored_elements~0.base| v_ArrVal_1151))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse5 |c_~#queue~0.base| (store (select .cse5 |c_~#queue~0.base|) .cse1 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1158) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1150) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1154) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|))))))) is different from false [2023-08-30 08:14:35,272 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 Int) (v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1147 Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1151 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1147) .cse6 v_ArrVal_1150)) |c_~#stored_elements~0.base| v_ArrVal_1151))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse7 |c_~#queue~0.base| (store (select .cse7 |c_~#queue~0.base|) .cse2 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1147) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1158) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1154) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1150)))))))) is different from false [2023-08-30 08:14:37,535 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 Int) (v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1145)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1147) .cse7 v_ArrVal_1150)) |c_~#stored_elements~0.base| v_ArrVal_1151))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse8 |c_~#queue~0.base| (store (select .cse8 |c_~#queue~0.base|) .cse3 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1154) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1147) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1150) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1158) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647)))))))) is different from false [2023-08-30 08:14:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 08:14:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015101667] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:14:55,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:14:55,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-30 08:14:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374783218] [2023-08-30 08:14:55,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:14:55,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-30 08:14:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:14:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-30 08:14:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=1591, Unknown=77, NotChecked=672, Total=2862 [2023-08-30 08:14:57,365 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:14:59,379 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:15:01,409 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:15:02,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 08:15:02,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 385 transitions, 4145 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:15:02,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:15:02,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 08:15:02,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:15:10,306 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:15:12,880 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:15:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:15:17,871 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:15:30,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 08:15:34,956 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:15:36,974 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:15:43,672 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:06,083 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:16,117 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:16:18,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:20,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:34,847 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:16:36,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:38,861 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:16:40,867 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:16:42,872 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:16:44,877 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:16:46,882 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:16:48,887 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:16:50,894 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:16:52,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:54,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:57,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:16:59,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:17:01,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:17:27,386 WARN L222 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:17:30,047 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:36,978 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:38,987 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:40,993 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:43,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 [0, 1] [2023-08-30 08:17:45,010 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:47,018 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:49,026 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:51,031 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:53,036 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:55,045 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:57,050 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:59,059 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:18:00,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:18:02,295 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:18:04,302 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:18:06,313 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:18:08,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:18:10,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 [0, 1] [2023-08-30 08:18:12,335 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:18:14,341 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:18:16,426 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:18:18,432 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:18:20,441 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:18:22,451 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:18:24,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 [0, 1] [2023-08-30 08:18:26,477 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:18:28,748 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:18:30,754 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:18:53,609 WARN L222 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 321 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:18:55,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, 1] [2023-08-30 08:18:57,623 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:19:00,433 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:02,442 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:19:28,903 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:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:19:33,391 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:35,399 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:19:37,774 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:39,780 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:19:41,795 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:06,820 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,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:20:10,871 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,877 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:20:25,598 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:43,480 WARN L222 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 298 DAG size of output: 235 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:20:45,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:47,615 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:20:49,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, 1] [2023-08-30 08:20:51,648 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:54,299 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:54,565 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ (select .cse11 .cse5) 1)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< .cse3 v_ArrVal_1158)))) (forall ((v_ArrVal_1150 Int) (v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1151 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse5 v_ArrVal_1150)) |c_~#stored_elements~0.base| v_ArrVal_1151))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153))) (let ((.cse6 (select (store (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse9 |c_~#queue~0.base| (store (select .cse9 |c_~#queue~0.base|) .cse2 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1158) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1154) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< .cse3 v_ArrVal_1150)))))))))) is different from false [2023-08-30 08:20:57,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 08:20:59,340 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:21:01,510 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:21:03,518 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:21:11,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:21:39,984 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:41,991 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:21:44,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s 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:46,129 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:22:18,738 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:18,859 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1150 Int) (v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1151 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse8 v_ArrVal_1150)) |c_~#stored_elements~0.base| v_ArrVal_1151))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153))) (let ((.cse0 (select (store (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse6 |c_~#queue~0.base| (store (select .cse6 |c_~#queue~0.base|) .cse1 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1158) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse3) 2147483647) (< .cse4 v_ArrVal_1150) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1154) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|))))))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse8 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse3) 2147483647) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< .cse4 v_ArrVal_1158)))))) is different from false [2023-08-30 08:22:42,694 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:44,029 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1158)))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse1) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4) 1) v_ArrVal_1158)))))) is different from false [2023-08-30 08:22:46,301 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,313 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,321 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,328 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:54,335 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:56,347 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:58,382 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:00,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:23:05,894 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:07,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 [1] [2023-08-30 08:23:09,911 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:11,918 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:13,924 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:16,790 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,796 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:20,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:23:22,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:23:24,024 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:26,032 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:28,039 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:30,047 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:32,057 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:35,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:23:38,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 [1] [2023-08-30 08:23:40,272 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:42,280 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,288 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:46,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:23:48,302 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:50,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:23:52,355 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:54,365 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:56,392 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:58,398 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:24:00,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:24:01,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:24:03,083 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse7 .cse8)) (.cse4 (+ (select .cse7 .cse6) 1))) (and (< .cse0 2147483647) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse1 (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1154) (< .cse4 v_ArrVal_1158)))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse9 (select (store (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse3) 2147483647) (< (+ .cse0 1) v_ArrVal_1154) (< .cse4 v_ArrVal_1158))))))) is different from false [2023-08-30 08:24:04,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:24:06,310 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:24:08,470 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:24:10,600 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:24:12,606 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:24:14,615 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:24:35,029 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:24:37,117 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:24:41,077 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:24:50,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:24:52,780 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:24:54,792 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:24:56,800 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:24:58,808 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:25:00,837 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:25:01,805 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select .cse4 .cse7)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1161 Int)) (< (select (store .cse0 .cse1 v_ArrVal_1161) .cse2) 2147483647)) (forall ((v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse5) 2147483647))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (store .cse0 .cse1 v_ArrVal_1153))) (let ((.cse6 (select (store (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse2 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse9 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1154) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse5) 2147483647) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1158))))) (forall ((v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse11 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1153))) (let ((.cse12 (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse5 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse13 |c_~#queue~0.base| (store (select .cse13 |c_~#queue~0.base|) .cse7 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (+ (select .cse11 .cse5) 1) v_ArrVal_1154) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse11 .cse7) 1) v_ArrVal_1158) (< (select .cse12 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) .cse5) 2147483647)))))))) is different from false [2023-08-30 08:25:03,814 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:25:05,824 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:25:07,887 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:25:09,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:25:11,905 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:25:13,988 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:25:14,465 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse5))) (and (< .cse0 2147483647) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse5 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_1154) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1158)))))))) is different from false [2023-08-30 08:25:14,524 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1154 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1158 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1156))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 v_ArrVal_1158))) |c_~#stored_elements~0.base| v_ArrVal_1159) |c_~#queue~0.base|))) (or (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_1161) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1154) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1158))))))) is different from false [2023-08-30 08:25:16,523 INFO L130 PetriNetUnfolder]: 6331/12390 cut-off events. [2023-08-30 08:25:16,523 INFO L131 PetriNetUnfolder]: For 318337/320500 co-relation queries the response was YES. [2023-08-30 08:25:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94198 conditions, 12390 events. 6331/12390 cut-off events. For 318337/320500 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 92332 event pairs, 2669 based on Foata normal form. 105/11767 useless extension candidates. Maximal degree in co-relation 93591. Up to 8208 conditions per place. [2023-08-30 08:25:16,642 INFO L137 encePairwiseOnDemand]: 430/449 looper letters, 392 selfloop transitions, 322 changer transitions 3/723 dead transitions. [2023-08-30 08:25:16,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 723 transitions, 12432 flow [2023-08-30 08:25:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-30 08:25:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-30 08:25:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 9862 transitions. [2023-08-30 08:25:16,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38533974133552146 [2023-08-30 08:25:16,650 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 9862 transitions. [2023-08-30 08:25:16,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 9862 transitions. [2023-08-30 08:25:16,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:25:16,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 9862 transitions. [2023-08-30 08:25:16,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 173.01754385964912) internal successors, (9862), 57 states have internal predecessors, (9862), 0 states have call successors, (0), 0 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:25:16,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 449.0) internal successors, (26042), 58 states have internal predecessors, (26042), 0 states have call successors, (0), 0 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:25:16,677 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 449.0) internal successors, (26042), 58 states have internal predecessors, (26042), 0 states have call successors, (0), 0 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:25:16,678 INFO L175 Difference]: Start difference. First operand has 240 places, 385 transitions, 4145 flow. Second operand 57 states and 9862 transitions. [2023-08-30 08:25:16,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 723 transitions, 12432 flow [2023-08-30 08:25:16,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 723 transitions, 12353 flow, removed 38 selfloop flow, removed 1 redundant places. [2023-08-30 08:25:16,867 INFO L231 Difference]: Finished difference. Result has 323 places, 563 transitions, 8375 flow [2023-08-30 08:25:16,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4100, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8375, PETRI_PLACES=323, PETRI_TRANSITIONS=563} [2023-08-30 08:25:16,867 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 266 predicate places. [2023-08-30 08:25:16,867 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 563 transitions, 8375 flow [2023-08-30 08:25:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:25:16,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:25:16,869 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:25:16,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 08:25:17,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:25:17,069 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 08:25:17,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:25:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash -228871586, now seen corresponding path program 4 times [2023-08-30 08:25:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:25:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622826858] [2023-08-30 08:25:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:25:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:25:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:25:18,111 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:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:25:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622826858] [2023-08-30 08:25:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622826858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:25:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265740423] [2023-08-30 08:25:18,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 08:25:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:25:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:25:18,113 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:25:18,113 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:25:18,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 08:25:18,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:25:18,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 101 conjunts are in the unsatisfiable core [2023-08-30 08:25:18,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:25:18,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:25:18,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:25:18,270 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 08:25:18,271 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:25:18,286 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:25:18,286 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:25:18,387 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:25:18,491 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:25:18,618 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:25:18,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:25:18,672 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:25:18,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:25:18,959 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:25:19,394 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:25:19,731 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:25:20,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:25:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-08-30 08:25:20,866 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:25:23,836 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:23,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:25:23,997 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|)))) is different from false [2023-08-30 08:25:31,202 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1286 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse0 .cse5)) (.cse3 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1281) .cse5 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1281) (< (+ .cse2 1) v_ArrVal_1283) (= .cse2 20) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse1) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|)))))) is different from false [2023-08-30 08:25:31,239 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1286 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1281) .cse3 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1281) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse1) 2147483647) (= .cse4 20) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ .cse4 1) v_ArrVal_1283))))))) is different from false [2023-08-30 08:25:31,287 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1275 Int) (v_ArrVal_1286 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1275)) |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2)) (.cse3 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1281) .cse2 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1283) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1275) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1281) (= 20 .cse0) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|))))))) is different from false [2023-08-30 08:25:31,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1275 Int) (v_ArrVal_1286 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1275)) |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2)) (.cse3 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1281) .cse2 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1283) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1275) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1281) (= 20 .cse0) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|)))))))) is different from false [2023-08-30 08:25:31,432 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1275 Int) (v_ArrVal_1286 Int) (v_ArrVal_1274 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1274) .cse6 v_ArrVal_1275)) |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1281) .cse1 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|)) (.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) (< (+ .cse2 1) v_ArrVal_1283) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1275) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1274) (= 20 .cse2) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1281)))))))) is different from false [2023-08-30 08:25:31,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 Int) (v_ArrVal_1283 Int) (v_ArrVal_1275 Int) (v_ArrVal_1286 Int) (v_ArrVal_1274 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1274) .cse6 v_ArrVal_1275)) |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1281) .cse1 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|)) (.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) (< (+ .cse2 1) v_ArrVal_1283) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1275) (= 20 .cse2) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1281) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1274)))))))) is different from false [2023-08-30 08:25:31,562 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int) (v_ArrVal_1281 Int) (v_ArrVal_1272 Int) (v_ArrVal_1283 Int) (v_ArrVal_1275 Int) (v_ArrVal_1286 Int) (v_ArrVal_1274 Int) (v_ArrVal_1278 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_1272)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1274) .cse8 v_ArrVal_1275)) |c_~#stored_elements~0.base| v_ArrVal_1277))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1278)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse6 .cse4)) (.cse5 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1281) .cse4 v_ArrVal_1283)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284) |c_~#stored_elements~0.base| v_ArrVal_1285) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1274) (= .cse2 20) (< (+ .cse2 1) v_ArrVal_1283) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1281) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_1286) .cse7) 2147483647) (< (+ (select .cse0 .cse8) 1) v_ArrVal_1275)))))))) is different from false Killed by 15