./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 04:42:24,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:42:24,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:42:24,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:42:24,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:42:24,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:42:24,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:42:24,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:42:24,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:42:24,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:42:24,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:42:24,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:42:24,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:42:24,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:42:24,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:42:24,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:42:24,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:42:24,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:42:24,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:42:24,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:42:24,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:42:24,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:42:24,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:42:24,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:42:24,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:42:24,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:42:24,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:42:24,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:42:24,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:42:24,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:42:24,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:42:24,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:42:24,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:42:24,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:42:24,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:42:24,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:42:24,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:42:24,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:42:24,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:42:24,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:42:24,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:42:24,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-09-01 04:42:24,196 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:42:24,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:42:24,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:42:24,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:42:24,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:42:24,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:42:24,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:42:24,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:42:24,199 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:42:24,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:42:24,200 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:42:24,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:42:24,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:42:24,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:42:24,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:42:24,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 04:42:24,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:42:24,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:42:24,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:42:24,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:24,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:42:24,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:42:24,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:42:24,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:42:24,204 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:42:24,204 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 04:42:24,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:42:24,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:42:24,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:42:24,475 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:42:24,476 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:42:24,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-09-01 04:42:25,488 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:42:25,767 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:42:25,768 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-09-01 04:42:25,785 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6356729c8/c55337abff0c4d259934d7b2f09a3508/FLAG6332e074a [2023-09-01 04:42:25,803 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6356729c8/c55337abff0c4d259934d7b2f09a3508 [2023-09-01 04:42:25,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:42:25,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:42:25,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:25,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:42:25,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:42:25,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:25" (1/1) ... [2023-09-01 04:42:25,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6768dc64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:25, skipping insertion in model container [2023-09-01 04:42:25,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:25" (1/1) ... [2023-09-01 04:42:25,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:42:25,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:42:26,219 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-09-01 04:42:26,223 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-09-01 04:42:26,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:26,239 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:42:26,282 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-09-01 04:42:26,287 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-09-01 04:42:26,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:26,341 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:42:26,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26 WrapperNode [2023-09-01 04:42:26,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:26,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:26,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:42:26,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:42:26,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,417 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-09-01 04:42:26,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:26,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:42:26,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:42:26,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:42:26,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,478 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:42:26,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:42:26,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:42:26,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:42:26,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:26,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 04:42:26,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 04:42:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 04:42:26,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 04:42:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 04:42:26,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:42:26,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:42:26,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 04:42:26,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:42:26,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:42:26,619 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 04:42:26,744 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:42:26,746 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:42:27,035 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:42:27,042 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:42:27,042 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 04:42:27,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:27 BoogieIcfgContainer [2023-09-01 04:42:27,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:42:27,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:42:27,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:42:27,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:42:27,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:42:25" (1/3) ... [2023-09-01 04:42:27,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a17754b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:27, skipping insertion in model container [2023-09-01 04:42:27,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (2/3) ... [2023-09-01 04:42:27,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a17754b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:27, skipping insertion in model container [2023-09-01 04:42:27,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:27" (3/3) ... [2023-09-01 04:42:27,050 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-09-01 04:42:27,055 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 04:42:27,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:42:27,062 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-09-01 04:42:27,062 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:42:27,189 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:42:27,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:27,337 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-09-01 04:42:27,337 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:42:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 236 events. 13/236 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:27,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:27,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,354 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:42:27,366 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,432 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-09-01 04:42:27,433 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:27,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 227 events. 13/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:27,443 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-09-01 04:42:34,583 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-09-01 04:42:34,584 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-09-01 04:42:34,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:42:34,640 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;@7369ebd0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:42:34,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-09-01 04:42:34,649 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-09-01 04:42:34,650 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:34,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:34,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:34,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:34,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-09-01 04:42:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246797249] [2023-09-01 04:42:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246797249] [2023-09-01 04:42:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246797249] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:35,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906681128] [2023-09-01 04:42:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:35,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:35,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:36,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:36,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:36,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:36,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:36,807 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-09-01 04:42:36,807 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-09-01 04:42:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2384 events. 1447/2384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11890 event pairs, 1050 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 4563. Up to 2313 conditions per place. [2023-09-01 04:42:36,818 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-09-01 04:42:36,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-09-01 04:42:36,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-09-01 04:42:36,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-09-01 04:42:36,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-09-01 04:42:36,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:36,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-09-01 04:42:36,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,854 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-09-01 04:42:36,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:36,859 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:36,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-09-01 04:42:36,863 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-09-01 04:42:36,864 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:36,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:36,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 04:42:36,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:36,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-09-01 04:42:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96261903] [2023-09-01 04:42:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:36,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96261903] [2023-09-01 04:42:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96261903] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:37,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430717827] [2023-09-01 04:42:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:37,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:37,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:37,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:38,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:38,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:38,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:38,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:38,695 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-09-01 04:42:38,695 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-09-01 04:42:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3185 events. 1909/3185 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17548 event pairs, 356 based on Foata normal form. 0/2452 useless extension candidates. Maximal degree in co-relation 4972. Up to 2371 conditions per place. [2023-09-01 04:42:38,710 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-09-01 04:42:38,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-09-01 04:42:38,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-09-01 04:42:38,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-09-01 04:42:38,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-09-01 04:42:38,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:38,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-09-01 04:42:38,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,721 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-09-01 04:42:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:38,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:38,729 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:38,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-09-01 04:42:38,730 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-09-01 04:42:38,731 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:38,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:38,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:38,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 04:42:38,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:38,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-09-01 04:42:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644155596] [2023-09-01 04:42:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:39,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:39,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644155596] [2023-09-01 04:42:39,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644155596] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:39,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283361754] [2023-09-01 04:42:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:39,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:39,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:39,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:39,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:39,754 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-09-01 04:42:39,755 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-09-01 04:42:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 3425 events. 2048/3425 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19054 event pairs, 410 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6211. Up to 2404 conditions per place. [2023-09-01 04:42:39,776 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-09-01 04:42:39,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-09-01 04:42:39,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-09-01 04:42:39,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-09-01 04:42:39,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-09-01 04:42:39,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:39,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-09-01 04:42:39,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,788 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-09-01 04:42:39,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:39,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:39,799 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:39,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-09-01 04:42:39,800 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-09-01 04:42:39,801 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:39,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:39,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:39,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 04:42:39,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:39,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-09-01 04:42:39,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:39,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347617668] [2023-09-01 04:42:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:39,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347617668] [2023-09-01 04:42:39,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347617668] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:39,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:39,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:39,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733577476] [2023-09-01 04:42:39,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:39,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:42:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:39,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:42:39,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 04:42:39,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-09-01 04:42:39,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:39,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-09-01 04:42:39,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:40,387 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-09-01 04:42:40,395 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-09-01 04:42:40,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5521 events. 3360/5521 cut-off events. For 2431/2471 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33384 event pairs, 1505 based on Foata normal form. 40/4211 useless extension candidates. Maximal degree in co-relation 10283. Up to 3250 conditions per place. [2023-09-01 04:42:40,414 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-09-01 04:42:40,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 04:42:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 04:42:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-09-01 04:42:40,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-09-01 04:42:40,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-09-01 04:42:40,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-09-01 04:42:40,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:40,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-09-01 04:42:40,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:40,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:40,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:40,422 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-09-01 04:42:40,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:40,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:40,427 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:40,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-09-01 04:42:40,428 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-09-01 04:42:40,428 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:40,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:40,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:40,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:40,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 04:42:40,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:40,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-09-01 04:42:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434857725] [2023-09-01 04:42:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434857725] [2023-09-01 04:42:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434857725] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981416114] [2023-09-01 04:42:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:40,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:41,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:41,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:41,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:41,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:41,658 INFO L130 PetriNetUnfolder]: 3404/5688 cut-off events. [2023-09-01 04:42:41,658 INFO L131 PetriNetUnfolder]: For 2514/2522 co-relation queries the response was YES. [2023-09-01 04:42:41,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13911 conditions, 5688 events. 3404/5688 cut-off events. For 2514/2522 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34241 event pairs, 2258 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 9525. Up to 5474 conditions per place. [2023-09-01 04:42:41,691 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-09-01 04:42:41,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 554 flow [2023-09-01 04:42:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-09-01 04:42:41,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974016332590943 [2023-09-01 04:42:41,699 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-09-01 04:42:41,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-09-01 04:42:41,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:41,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-09-01 04:42:41,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,730 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,731 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 6 states and 1340 transitions. [2023-09-01 04:42:41,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 554 flow [2023-09-01 04:42:41,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:41,743 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 404 flow [2023-09-01 04:42:41,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-09-01 04:42:41,744 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-09-01 04:42:41,744 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 404 flow [2023-09-01 04:42:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:41,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 04:42:41,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:41,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-09-01 04:42:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749836104] [2023-09-01 04:42:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749836104] [2023-09-01 04:42:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749836104] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738606587] [2023-09-01 04:42:42,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:42,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:42,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:42,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:43,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:43,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:43,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:43,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:43,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:44,062 INFO L130 PetriNetUnfolder]: 3697/6100 cut-off events. [2023-09-01 04:42:44,062 INFO L131 PetriNetUnfolder]: For 1866/1896 co-relation queries the response was YES. [2023-09-01 04:42:44,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 6100 events. 3697/6100 cut-off events. For 1866/1896 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37242 event pairs, 626 based on Foata normal form. 94/5216 useless extension candidates. Maximal degree in co-relation 11952. Up to 4451 conditions per place. [2023-09-01 04:42:44,100 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 141 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2023-09-01 04:42:44,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 168 transitions, 969 flow [2023-09-01 04:42:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1393 transitions. [2023-09-01 04:42:44,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170749814402376 [2023-09-01 04:42:44,105 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1393 transitions. [2023-09-01 04:42:44,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1393 transitions. [2023-09-01 04:42:44,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:44,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1393 transitions. [2023-09-01 04:42:44,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.16666666666666) internal successors, (1393), 6 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,115 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,115 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 404 flow. Second operand 6 states and 1393 transitions. [2023-09-01 04:42:44,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 168 transitions, 969 flow [2023-09-01 04:42:44,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:44,143 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 456 flow [2023-09-01 04:42:44,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-09-01 04:42:44,146 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-09-01 04:42:44,146 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 456 flow [2023-09-01 04:42:44,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:44,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 04:42:44,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:44,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1523080992, now seen corresponding path program 1 times [2023-09-01 04:42:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460079509] [2023-09-01 04:42:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:44,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460079509] [2023-09-01 04:42:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460079509] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903685402] [2023-09-01 04:42:44,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:44,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:44,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:44,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:44,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:45,412 INFO L130 PetriNetUnfolder]: 3933/6511 cut-off events. [2023-09-01 04:42:45,413 INFO L131 PetriNetUnfolder]: For 3371/3393 co-relation queries the response was YES. [2023-09-01 04:42:45,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 6511 events. 3933/6511 cut-off events. For 3371/3393 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 39424 event pairs, 722 based on Foata normal form. 94/5591 useless extension candidates. Maximal degree in co-relation 12673. Up to 4119 conditions per place. [2023-09-01 04:42:45,451 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 126 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2023-09-01 04:42:45,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 939 flow [2023-09-01 04:42:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1170 transitions. [2023-09-01 04:42:45,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211581291759465 [2023-09-01 04:42:45,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1170 transitions. [2023-09-01 04:42:45,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1170 transitions. [2023-09-01 04:42:45,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:45,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1170 transitions. [2023-09-01 04:42:45,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,460 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,460 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 456 flow. Second operand 5 states and 1170 transitions. [2023-09-01 04:42:45,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 939 flow [2023-09-01 04:42:45,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 907 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:45,482 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 497 flow [2023-09-01 04:42:45,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=497, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-09-01 04:42:45,482 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-09-01 04:42:45,483 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 497 flow [2023-09-01 04:42:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:45,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:45,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 04:42:45,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:45,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-09-01 04:42:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528167466] [2023-09-01 04:42:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528167466] [2023-09-01 04:42:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528167466] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:45,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:45,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846872187] [2023-09-01 04:42:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:45,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:45,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:45,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:42:45,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:45,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:42:45,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:45,678 INFO L130 PetriNetUnfolder]: 716/1428 cut-off events. [2023-09-01 04:42:45,678 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-09-01 04:42:45,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1428 events. 716/1428 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8101 event pairs, 457 based on Foata normal form. 64/1344 useless extension candidates. Maximal degree in co-relation 2930. Up to 761 conditions per place. [2023-09-01 04:42:45,685 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-09-01 04:42:45,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 595 flow [2023-09-01 04:42:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-09-01 04:42:45,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-09-01 04:42:45,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-09-01 04:42:45,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-09-01 04:42:45,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:45,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-09-01 04:42:45,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,694 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 497 flow. Second operand 3 states and 725 transitions. [2023-09-01 04:42:45,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 595 flow [2023-09-01 04:42:45,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 573 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:45,698 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:45,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-09-01 04:42:45,698 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-09-01 04:42:45,699 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:45,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:45,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:45,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 04:42:45,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:45,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash -240537722, now seen corresponding path program 1 times [2023-09-01 04:42:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856142773] [2023-09-01 04:42:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856142773] [2023-09-01 04:42:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856142773] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268188525] [2023-09-01 04:42:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:45,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:45,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:42:45,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:45,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:42:45,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:45,897 INFO L130 PetriNetUnfolder]: 528/1058 cut-off events. [2023-09-01 04:42:45,897 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-09-01 04:42:45,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1058 events. 528/1058 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5246 event pairs, 390 based on Foata normal form. 8/948 useless extension candidates. Maximal degree in co-relation 2085. Up to 780 conditions per place. [2023-09-01 04:42:45,903 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 75 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-09-01 04:42:45,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 560 flow [2023-09-01 04:42:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-09-01 04:42:45,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-09-01 04:42:45,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-09-01 04:42:45,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-09-01 04:42:45,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:45,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-09-01 04:42:45,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,911 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 3 states and 732 transitions. [2023-09-01 04:42:45,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 560 flow [2023-09-01 04:42:45,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 552 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:45,917 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:45,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-09-01 04:42:45,918 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-09-01 04:42:45,918 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-09-01 04:42:45,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:45,919 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:45,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 04:42:45,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:45,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-09-01 04:42:45,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:45,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284324034] [2023-09-01 04:42:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284324034] [2023-09-01 04:42:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284324034] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:42:46,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901749061] [2023-09-01 04:42:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:46,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:42:46,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:46,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:42:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 04:42:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:46,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-09-01 04:42:46,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:42:46,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:46,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:46,436 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:42:46,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:42:46,447 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:42:46,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-01 04:42:46,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:42:46,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:42:46,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:42:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:46,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:42:47,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:42:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:47,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:42:47,176 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_373)))) is different from false [2023-09-01 04:42:47,196 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2023-09-01 04:42:47,235 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< v_ArrVal_372 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2023-09-01 04:42:47,258 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< 0 (+ (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2023-09-01 04:42:47,283 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_369)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373))))) is different from false [2023-09-01 04:42:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:42:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901749061] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:42:47,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:42:47,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-09-01 04:42:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186161635] [2023-09-01 04:42:47,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:42:47,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 04:42:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 04:42:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=446, Unknown=15, NotChecked=250, Total=870 [2023-09-01 04:42:47,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-09-01 04:42:47,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:47,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:47,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-09-01 04:42:47,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:59,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:43:32,238 INFO L130 PetriNetUnfolder]: 1537/3020 cut-off events. [2023-09-01 04:43:32,238 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2023-09-01 04:43:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 3020 events. 1537/3020 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 19151 event pairs, 606 based on Foata normal form. 1/2698 useless extension candidates. Maximal degree in co-relation 5493. Up to 801 conditions per place. [2023-09-01 04:43:32,258 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 189 selfloop transitions, 105 changer transitions 4/304 dead transitions. [2023-09-01 04:43:32,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 304 transitions, 1740 flow [2023-09-01 04:43:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-09-01 04:43:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-09-01 04:43:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6574 transitions. [2023-09-01 04:43:32,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3957141997231084 [2023-09-01 04:43:32,276 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6574 transitions. [2023-09-01 04:43:32,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6574 transitions. [2023-09-01 04:43:32,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:32,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6574 transitions. [2023-09-01 04:43:32,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 177.67567567567568) internal successors, (6574), 37 states have internal predecessors, (6574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:32,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 449.0) internal successors, (17062), 38 states have internal predecessors, (17062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:32,318 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 449.0) internal successors, (17062), 38 states have internal predecessors, (17062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:32,318 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 37 states and 6574 transitions. [2023-09-01 04:43:32,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 304 transitions, 1740 flow [2023-09-01 04:43:32,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 304 transitions, 1735 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:43:32,330 INFO L231 Difference]: Finished difference. Result has 139 places, 165 transitions, 1129 flow [2023-09-01 04:43:32,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1129, PETRI_PLACES=139, PETRI_TRANSITIONS=165} [2023-09-01 04:43:32,331 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 82 predicate places. [2023-09-01 04:43:32,331 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 165 transitions, 1129 flow [2023-09-01 04:43:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:32,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 04:43:32,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-09-01 04:43:32,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:43:32,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 1 times [2023-09-01 04:43:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87442144] [2023-09-01 04:43:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87442144] [2023-09-01 04:43:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87442144] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:43:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189380034] [2023-09-01 04:43:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:43:33,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:43:33,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 04:43:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:33,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-09-01 04:43:33,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:43:33,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:33,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:33,516 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:43:33,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:43:33,532 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:43:33,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:43:33,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:43:33,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:43:33,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:43:34,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:34,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:43:34,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:43:34,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:43:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:34,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:43:36,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_474) .cse2 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_474) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_476) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:43:36,305 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_474) .cse3 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_474) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_476) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:43:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 04:43:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189380034] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:45,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-09-01 04:43:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870605294] [2023-09-01 04:43:45,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:45,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 04:43:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 04:43:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=776, Unknown=29, NotChecked=126, Total=1190 [2023-09-01 04:43:45,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:43:45,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 165 transitions, 1129 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:45,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:45,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:43:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:09,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:44:11,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:44:13,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:44:15,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:17,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:17,575 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |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)))) (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 ((.cse3 (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 .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_476) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|))))))) is different from false [2023-09-01 04:44:19,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 [1] [2023-09-01 04:44:21,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:23,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:36,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:39,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:39,612 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |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)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647)))))) is different from false [2023-09-01 04:44:40,054 INFO L130 PetriNetUnfolder]: 2384/4700 cut-off events. [2023-09-01 04:44:40,054 INFO L131 PetriNetUnfolder]: For 20402/20412 co-relation queries the response was YES. [2023-09-01 04:44:40,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19478 conditions, 4700 events. 2384/4700 cut-off events. For 20402/20412 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 32971 event pairs, 763 based on Foata normal form. 0/4278 useless extension candidates. Maximal degree in co-relation 18180. Up to 2504 conditions per place. [2023-09-01 04:44:40,092 INFO L137 encePairwiseOnDemand]: 423/449 looper letters, 256 selfloop transitions, 108 changer transitions 3/373 dead transitions. [2023-09-01 04:44:40,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 373 transitions, 3656 flow [2023-09-01 04:44:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-01 04:44:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-09-01 04:44:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5275 transitions. [2023-09-01 04:44:40,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39161098737936156 [2023-09-01 04:44:40,103 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5275 transitions. [2023-09-01 04:44:40,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5275 transitions. [2023-09-01 04:44:40,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:40,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5275 transitions. [2023-09-01 04:44:40,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 175.83333333333334) internal successors, (5275), 30 states have internal predecessors, (5275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,128 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,128 INFO L175 Difference]: Start difference. First operand has 139 places, 165 transitions, 1129 flow. Second operand 30 states and 5275 transitions. [2023-09-01 04:44:40,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 373 transitions, 3656 flow [2023-09-01 04:44:40,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 373 transitions, 3427 flow, removed 96 selfloop flow, removed 11 redundant places. [2023-09-01 04:44:40,156 INFO L231 Difference]: Finished difference. Result has 172 places, 233 transitions, 1837 flow [2023-09-01 04:44:40,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1837, PETRI_PLACES=172, PETRI_TRANSITIONS=233} [2023-09-01 04:44:40,157 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 115 predicate places. [2023-09-01 04:44:40,157 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 233 transitions, 1837 flow [2023-09-01 04:44:40,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:40,158 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:40,164 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-09-01 04:44:40,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-09-01 04:44:40,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:40,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1054020545, now seen corresponding path program 1 times [2023-09-01 04:44:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9562699] [2023-09-01 04:44:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9562699] [2023-09-01 04:44:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9562699] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328646332] [2023-09-01 04:44:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:40,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:40,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:40,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:40,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 04:44:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:41,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 52 conjunts are in the unsatisfiable core [2023-09-01 04:44:41,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:41,026 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:44:41,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:44:41,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 04:44:41,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 04:44:41,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-09-01 04:44:41,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:41,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 04:44:41,297 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 04:44:41,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-09-01 04:44:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:41,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:41,413 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_568 2147483648) 0))) is different from false [2023-09-01 04:44:41,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:41,510 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-09-01 04:44:41,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:41,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1337 treesize of output 1315 [2023-09-01 04:44:41,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 458 [2023-09-01 04:44:41,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 444 [2023-09-01 04:44:42,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 04:44:42,190 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-09-01 04:44:42,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-09-01 04:44:42,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:44:42,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 450 treesize of output 426 [2023-09-01 04:44:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328646332] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:42,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-09-01 04:44:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630342552] [2023-09-01 04:44:42,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:42,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-01 04:44:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-01 04:44:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=620, Unknown=9, NotChecked=52, Total=812 [2023-09-01 04:44:42,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 449 [2023-09-01 04:44:42,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 233 transitions, 1837 flow. Second operand has 29 states, 29 states have (on average 169.75862068965517) internal successors, (4923), 29 states have internal predecessors, (4923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:42,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:42,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 449 [2023-09-01 04:44:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:43,419 INFO L130 PetriNetUnfolder]: 2465/4881 cut-off events. [2023-09-01 04:44:43,420 INFO L131 PetriNetUnfolder]: For 61385/61399 co-relation queries the response was YES. [2023-09-01 04:44:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27418 conditions, 4881 events. 2465/4881 cut-off events. For 61385/61399 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 34508 event pairs, 1155 based on Foata normal form. 41/4484 useless extension candidates. Maximal degree in co-relation 27146. Up to 3798 conditions per place. [2023-09-01 04:44:43,460 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 216 selfloop transitions, 39 changer transitions 3/264 dead transitions. [2023-09-01 04:44:43,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 264 transitions, 2567 flow [2023-09-01 04:44:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:44:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:44:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2023-09-01 04:44:43,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4060876020786934 [2023-09-01 04:44:43,462 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2023-09-01 04:44:43,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2023-09-01 04:44:43,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:43,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2023-09-01 04:44:43,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,466 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,466 INFO L175 Difference]: Start difference. First operand has 172 places, 233 transitions, 1837 flow. Second operand 6 states and 1094 transitions. [2023-09-01 04:44:43,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 264 transitions, 2567 flow [2023-09-01 04:44:43,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 264 transitions, 2297 flow, removed 115 selfloop flow, removed 8 redundant places. [2023-09-01 04:44:43,514 INFO L231 Difference]: Finished difference. Result has 169 places, 229 transitions, 1623 flow [2023-09-01 04:44:43,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1623, PETRI_PLACES=169, PETRI_TRANSITIONS=229} [2023-09-01 04:44:43,515 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 112 predicate places. [2023-09-01 04:44:43,515 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 229 transitions, 1623 flow [2023-09-01 04:44:43,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 169.75862068965517) internal successors, (4923), 29 states have internal predecessors, (4923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:43,516 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:43,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:43,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:43,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:43,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 2 times [2023-09-01 04:44:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716731393] [2023-09-01 04:44:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716731393] [2023-09-01 04:44:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716731393] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130174547] [2023-09-01 04:44:44,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:44:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:44,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:44:44,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 04:44:44,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:44:44,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:44:44,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-09-01 04:44:44,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:44,666 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:44:44,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:44:44,680 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:44:44,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:44:44,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:44:44,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:44:45,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:44:45,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:45,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:44:45,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:44:45,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-09-01 04:44:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:45,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:45,638 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int)) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:44:45,660 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_666) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))) is different from false [2023-09-01 04:44:45,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_665) .cse3 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_665) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_666)))))) is different from false [2023-09-01 04:44:45,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_663 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_663)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_665) .cse4 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_665) (< (+ (select .cse2 .cse4) 1) v_ArrVal_666)))))) is different from false [2023-09-01 04:44:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 04:44:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130174547] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:48,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-09-01 04:44:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201765402] [2023-09-01 04:44:48,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:48,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 04:44:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 04:44:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=729, Unknown=25, NotChecked=244, Total=1190 [2023-09-01 04:44:49,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:44:49,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 229 transitions, 1623 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:49,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:49,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:44:49,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:11,203 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 160 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:45:13,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:15,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:17,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:17,389 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|)))) (and (forall ((v_ArrVal_665 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_665) .cse6 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_665) (< (+ (select .cse4 .cse6) 1) v_ArrVal_666)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (<= (select .cse7 1608) 1) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) .cse8) (= |c_~#queue~0.offset| 0) (<= (select .cse4 1608) 1) (let ((.cse9 (select .cse7 1604))) (or (<= 403 .cse9) (<= .cse9 401))) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (exists ((v_ArrVal_665 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_663 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse10 (store (store (store (store ((as const (Array Int Int)) 0) 1600 0) 1604 0) 1608 0) (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) v_ArrVal_663))) (and (<= v_ArrVal_666 (+ (select .cse10 1604) 1)) (<= v_ArrVal_665 (+ (select .cse10 1608) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| 0) (= (select |c_#memory_int| 5) (store (store (store .cse10 1608 v_ArrVal_665) 1604 v_ArrVal_666) (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) v_ArrVal_669)) (<= |t1Thread1of1ForFork0_enqueue_#t~mem36#1| v_ArrVal_666)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse3) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))) .cse8)) is different from false [2023-09-01 04:45:19,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:45:19,861 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_666))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int) (v_ArrVal_666 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_668))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_666) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))))) is different from false [2023-09-01 04:45:21,879 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_669 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_671) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-09-01 04:45:23,394 INFO L130 PetriNetUnfolder]: 3119/6178 cut-off events. [2023-09-01 04:45:23,394 INFO L131 PetriNetUnfolder]: For 77709/77719 co-relation queries the response was YES. [2023-09-01 04:45:23,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34561 conditions, 6178 events. 3119/6178 cut-off events. For 77709/77719 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 45762 event pairs, 1008 based on Foata normal form. 19/5680 useless extension candidates. Maximal degree in co-relation 34071. Up to 3118 conditions per place. [2023-09-01 04:45:23,447 INFO L137 encePairwiseOnDemand]: 430/449 looper letters, 290 selfloop transitions, 134 changer transitions 3/433 dead transitions. [2023-09-01 04:45:23,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 433 transitions, 5092 flow [2023-09-01 04:45:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-01 04:45:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-09-01 04:45:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4935 transitions. [2023-09-01 04:45:23,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925389755011136 [2023-09-01 04:45:23,452 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4935 transitions. [2023-09-01 04:45:23,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4935 transitions. [2023-09-01 04:45:23,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:23,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4935 transitions. [2023-09-01 04:45:23,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 176.25) internal successors, (4935), 28 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:23,464 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-09-01 04:45:23,465 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-09-01 04:45:23,465 INFO L175 Difference]: Start difference. First operand has 169 places, 229 transitions, 1623 flow. Second operand 28 states and 4935 transitions. [2023-09-01 04:45:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 433 transitions, 5092 flow [2023-09-01 04:45:23,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 433 transitions, 5043 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 04:45:23,630 INFO L231 Difference]: Finished difference. Result has 206 places, 294 transitions, 2974 flow [2023-09-01 04:45:23,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2974, PETRI_PLACES=206, PETRI_TRANSITIONS=294} [2023-09-01 04:45:23,630 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 149 predicate places. [2023-09-01 04:45:23,631 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 294 transitions, 2974 flow [2023-09-01 04:45:23,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:23,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:23,632 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:23,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-01 04:45:23,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:23,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:23,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -682370779, now seen corresponding path program 1 times [2023-09-01 04:45:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636822108] [2023-09-01 04:45:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636822108] [2023-09-01 04:45:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636822108] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355020454] [2023-09-01 04:45:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:24,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:45:24,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 04:45:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjunts are in the unsatisfiable core [2023-09-01 04:45:24,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:24,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:24,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:24,381 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:24,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:45:24,390 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:45:24,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-01 04:45:24,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:45:24,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:45:24,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 41 treesize of output 34 [2023-09-01 04:45:24,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:24,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-09-01 04:45:24,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2023-09-01 04:45:24,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2023-09-01 04:45:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:24,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:24,937 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) is different from false [2023-09-01 04:45:24,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) is different from false [2023-09-01 04:45:24,956 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1) 2147483650)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) is different from false [2023-09-01 04:45:25,073 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_771 Int) (v_ArrVal_769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_765 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_764)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_765) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_769) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_771) .cse1)))))) is different from false [2023-09-01 04:45:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-09-01 04:45:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355020454] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:25,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2023-09-01 04:45:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209785199] [2023-09-01 04:45:25,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-09-01 04:45:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-09-01 04:45:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=354, Unknown=9, NotChecked=172, Total=650 [2023-09-01 04:45:25,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 449 [2023-09-01 04:45:25,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 294 transitions, 2974 flow. Second operand has 26 states, 26 states have (on average 178.07692307692307) internal successors, (4630), 26 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:25,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:25,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 449 [2023-09-01 04:45:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:29,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:45:32,343 INFO L130 PetriNetUnfolder]: 4980/9809 cut-off events. [2023-09-01 04:45:32,343 INFO L131 PetriNetUnfolder]: For 336668/336770 co-relation queries the response was YES. [2023-09-01 04:45:32,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73757 conditions, 9809 events. 4980/9809 cut-off events. For 336668/336770 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 78505 event pairs, 1949 based on Foata normal form. 79/9034 useless extension candidates. Maximal degree in co-relation 72601. Up to 3560 conditions per place. [2023-09-01 04:45:32,455 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 445 selfloop transitions, 118 changer transitions 4/573 dead transitions. [2023-09-01 04:45:32,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 573 transitions, 7308 flow [2023-09-01 04:45:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-01 04:45:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-09-01 04:45:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4851 transitions. [2023-09-01 04:45:32,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4155388041802296 [2023-09-01 04:45:32,467 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4851 transitions. [2023-09-01 04:45:32,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4851 transitions. [2023-09-01 04:45:32,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:32,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4851 transitions. [2023-09-01 04:45:32,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 186.57692307692307) internal successors, (4851), 26 states have internal predecessors, (4851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:32,481 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-09-01 04:45:32,482 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-09-01 04:45:32,482 INFO L175 Difference]: Start difference. First operand has 206 places, 294 transitions, 2974 flow. Second operand 26 states and 4851 transitions. [2023-09-01 04:45:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 573 transitions, 7308 flow [2023-09-01 04:45:32,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 573 transitions, 6463 flow, removed 386 selfloop flow, removed 10 redundant places. [2023-09-01 04:45:32,704 INFO L231 Difference]: Finished difference. Result has 229 places, 331 transitions, 3368 flow [2023-09-01 04:45:32,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3368, PETRI_PLACES=229, PETRI_TRANSITIONS=331} [2023-09-01 04:45:32,706 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 172 predicate places. [2023-09-01 04:45:32,706 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 331 transitions, 3368 flow [2023-09-01 04:45:32,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 178.07692307692307) internal successors, (4630), 26 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:32,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:32,707 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:32,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 04:45:32,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-09-01 04:45:32,913 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:32,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash 45335056, now seen corresponding path program 1 times [2023-09-01 04:45:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:32,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250766931] [2023-09-01 04:45:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:32,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250766931] [2023-09-01 04:45:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250766931] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420431825] [2023-09-01 04:45:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:33,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:33,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:33,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:45:33,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 04:45:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:33,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 61 conjunts are in the unsatisfiable core [2023-09-01 04:45:33,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:34,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-09-01 04:45:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:34,025 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:34,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 04:45:34,039 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:45:34,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:45:34,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 04:45:34,214 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:45:34,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-09-01 04:45:34,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-01 04:45:34,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-09-01 04:45:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:34,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 04:45:34,403 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:45:34,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-09-01 04:45:34,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-01 04:45:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:34,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:34,567 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))) is different from false [2023-09-01 04:45:34,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_873 Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_873)) |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_873) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse3) 2147483647))))) is different from false [2023-09-01 04:45:34,681 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_873 Int) (v_ArrVal_871 Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_871) .cse3 v_ArrVal_873)) |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_873))))) is different from false [2023-09-01 04:45:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-09-01 04:45:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420431825] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:36,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-09-01 04:45:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658076190] [2023-09-01 04:45:36,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:36,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 04:45:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 04:45:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=12, NotChecked=156, Total=870 [2023-09-01 04:45:36,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:45:36,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 331 transitions, 3368 flow. Second operand has 30 states, 30 states have (on average 174.9) internal successors, (5247), 30 states have internal predecessors, (5247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:36,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:36,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:45:36,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:39,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:45:41,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:45:41,988 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_875 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_875 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_874) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_875) .cse1) 2147483647)))))) is different from false [2023-09-01 04:45:44,791 INFO L130 PetriNetUnfolder]: 5582/10970 cut-off events. [2023-09-01 04:45:44,791 INFO L131 PetriNetUnfolder]: For 422933/423038 co-relation queries the response was YES. [2023-09-01 04:45:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85247 conditions, 10970 events. 5582/10970 cut-off events. For 422933/423038 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 89268 event pairs, 2071 based on Foata normal form. 59/10080 useless extension candidates. Maximal degree in co-relation 84528. Up to 7309 conditions per place. [2023-09-01 04:45:45,023 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 401 selfloop transitions, 117 changer transitions 3/527 dead transitions. [2023-09-01 04:45:45,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 527 transitions, 7818 flow [2023-09-01 04:45:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-01 04:45:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-09-01 04:45:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3491 transitions. [2023-09-01 04:45:45,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40921345680459503 [2023-09-01 04:45:45,029 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3491 transitions. [2023-09-01 04:45:45,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3491 transitions. [2023-09-01 04:45:45,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:45,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3491 transitions. [2023-09-01 04:45:45,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 183.73684210526315) internal successors, (3491), 19 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 449.0) internal successors, (8980), 20 states have internal predecessors, (8980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,043 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 449.0) internal successors, (8980), 20 states have internal predecessors, (8980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,043 INFO L175 Difference]: Start difference. First operand has 229 places, 331 transitions, 3368 flow. Second operand 19 states and 3491 transitions. [2023-09-01 04:45:45,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 527 transitions, 7818 flow [2023-09-01 04:45:45,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 527 transitions, 7581 flow, removed 101 selfloop flow, removed 12 redundant places. [2023-09-01 04:45:45,314 INFO L231 Difference]: Finished difference. Result has 245 places, 392 transitions, 4481 flow [2023-09-01 04:45:45,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4481, PETRI_PLACES=245, PETRI_TRANSITIONS=392} [2023-09-01 04:45:45,315 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 188 predicate places. [2023-09-01 04:45:45,315 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 392 transitions, 4481 flow [2023-09-01 04:45:45,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 174.9) internal successors, (5247), 30 states have internal predecessors, (5247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:45,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:45,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 04:45:45,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-09-01 04:45:45,522 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:45,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1223401722, now seen corresponding path program 2 times [2023-09-01 04:45:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426015430] [2023-09-01 04:45:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426015430] [2023-09-01 04:45:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426015430] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933269330] [2023-09-01 04:45:46,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:45:46,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:46,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:45:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 04:45:46,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:45:46,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:45:46,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 78 conjunts are in the unsatisfiable core [2023-09-01 04:45:46,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:46,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:46,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:46,344 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:46,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:45:46,358 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:45:46,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 31 [2023-09-01 04:45:46,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-09-01 04:45:46,503 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 30 treesize of output 25 [2023-09-01 04:45:46,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-09-01 04:45:46,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-09-01 04:45:46,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:46,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-09-01 04:45:46,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-09-01 04:45:46,803 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 36 [2023-09-01 04:45:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:46,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:46,920 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_984) .cse1) 2147483647)))) is different from false [2023-09-01 04:45:46,929 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_984) .cse1) 2147483647)))) is different from false [2023-09-01 04:45:46,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_979 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_979)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_984) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_979)))) is different from false [2023-09-01 04:45:46,966 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_979 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_981 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_979)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_981) |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_979) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_984) .cse1) 2147483647))))) is different from false [2023-09-01 04:45:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:45:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933269330] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:53,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-09-01 04:45:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760340875] [2023-09-01 04:45:53,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 04:45:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 04:45:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=515, Unknown=11, NotChecked=212, Total=930 [2023-09-01 04:45:53,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:45:53,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 392 transitions, 4481 flow. Second operand has 31 states, 31 states have (on average 174.83870967741936) internal successors, (5420), 31 states have internal predecessors, (5420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:53,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:53,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:45:53,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:46:08,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-09-01 04:46:10,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:12,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:14,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:16,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:18,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:27,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:46:42,019 INFO L130 PetriNetUnfolder]: 6983/13575 cut-off events. [2023-09-01 04:46:42,019 INFO L131 PetriNetUnfolder]: For 630713/631010 co-relation queries the response was YES. [2023-09-01 04:46:42,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115926 conditions, 13575 events. 6983/13575 cut-off events. For 630713/631010 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 112282 event pairs, 2386 based on Foata normal form. 115/12507 useless extension candidates. Maximal degree in co-relation 114349. Up to 8795 conditions per place. [2023-09-01 04:46:42,167 INFO L137 encePairwiseOnDemand]: 427/449 looper letters, 503 selfloop transitions, 243 changer transitions 3/755 dead transitions. [2023-09-01 04:46:42,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 755 transitions, 12999 flow [2023-09-01 04:46:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-09-01 04:46:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-09-01 04:46:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6398 transitions. [2023-09-01 04:46:42,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071269487750557 [2023-09-01 04:46:42,173 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6398 transitions. [2023-09-01 04:46:42,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6398 transitions. [2023-09-01 04:46:42,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:46:42,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6398 transitions. [2023-09-01 04:46:42,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 182.8) internal successors, (6398), 35 states have internal predecessors, (6398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:42,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 449.0) internal successors, (16164), 36 states have internal predecessors, (16164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:42,339 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 449.0) internal successors, (16164), 36 states have internal predecessors, (16164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:42,339 INFO L175 Difference]: Start difference. First operand has 245 places, 392 transitions, 4481 flow. Second operand 35 states and 6398 transitions. [2023-09-01 04:46:42,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 755 transitions, 12999 flow [2023-09-01 04:46:42,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 755 transitions, 12502 flow, removed 233 selfloop flow, removed 6 redundant places. [2023-09-01 04:46:42,671 INFO L231 Difference]: Finished difference. Result has 293 places, 548 transitions, 7905 flow [2023-09-01 04:46:42,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=7905, PETRI_PLACES=293, PETRI_TRANSITIONS=548} [2023-09-01 04:46:42,672 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 236 predicate places. [2023-09-01 04:46:42,672 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 548 transitions, 7905 flow [2023-09-01 04:46:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 174.83870967741936) internal successors, (5420), 31 states have internal predecessors, (5420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:42,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:46:42,673 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:46:42,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 04:46:42,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:42,878 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:46:42,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:46:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash -729256589, now seen corresponding path program 1 times [2023-09-01 04:46:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:46:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363715347] [2023-09-01 04:46:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:46:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:46:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363715347] [2023-09-01 04:46:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363715347] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:46:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652740264] [2023-09-01 04:46:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:43,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:43,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:46:43,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:46:43,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 04:46:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:43,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2023-09-01 04:46:43,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:46:43,418 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:46:43,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-09-01 04:46:43,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-09-01 04:46:43,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-09-01 04:46:43,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:43,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-09-01 04:46:43,826 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:46:43,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-09-01 04:46:43,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-09-01 04:46:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:43,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:46:43,956 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 Int) (v_ArrVal_1074 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1075)) .cse1))))) is different from false [2023-09-01 04:46:43,963 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1073) |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1075)) .cse1))))) is different from false [2023-09-01 04:46:44,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:44,051 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 93 treesize of output 57 [2023-09-01 04:46:44,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:44,061 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 134 treesize of output 134 [2023-09-01 04:46:44,067 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 134 treesize of output 110 [2023-09-01 04:46:44,075 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 66 treesize of output 54 [2023-09-01 04:46:44,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-09-01 04:46:44,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:44,121 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 89 treesize of output 77 [2023-09-01 04:46:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652740264] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:46:44,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:46:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-09-01 04:46:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596179255] [2023-09-01 04:46:44,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:46:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-09-01 04:46:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:46:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-09-01 04:46:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=507, Unknown=2, NotChecked=94, Total=702 [2023-09-01 04:46:44,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 449 [2023-09-01 04:46:44,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 548 transitions, 7905 flow. Second operand has 27 states, 27 states have (on average 174.22222222222223) internal successors, (4704), 27 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:44,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:46:44,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 449 [2023-09-01 04:46:44,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:46:48,750 INFO L130 PetriNetUnfolder]: 7420/14314 cut-off events. [2023-09-01 04:46:48,751 INFO L131 PetriNetUnfolder]: For 1241252/1244606 co-relation queries the response was YES. [2023-09-01 04:46:48,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152240 conditions, 14314 events. 7420/14314 cut-off events. For 1241252/1244606 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 119012 event pairs, 2591 based on Foata normal form. 122/13098 useless extension candidates. Maximal degree in co-relation 150090. Up to 7750 conditions per place. [2023-09-01 04:46:48,951 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 454 selfloop transitions, 180 changer transitions 3/643 dead transitions. [2023-09-01 04:46:48,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 643 transitions, 11027 flow [2023-09-01 04:46:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 04:46:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 04:46:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2033 transitions. [2023-09-01 04:46:48,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116217857865965 [2023-09-01 04:46:48,955 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2033 transitions. [2023-09-01 04:46:48,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2033 transitions. [2023-09-01 04:46:48,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:46:48,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2033 transitions. [2023-09-01 04:46:48,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 184.8181818181818) internal successors, (2033), 11 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:48,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:48,973 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:48,973 INFO L175 Difference]: Start difference. First operand has 293 places, 548 transitions, 7905 flow. Second operand 11 states and 2033 transitions. [2023-09-01 04:46:48,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 643 transitions, 11027 flow [2023-09-01 04:46:49,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 643 transitions, 9282 flow, removed 823 selfloop flow, removed 13 redundant places. [2023-09-01 04:46:49,733 INFO L231 Difference]: Finished difference. Result has 291 places, 548 transitions, 6995 flow [2023-09-01 04:46:49,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=6330, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6995, PETRI_PLACES=291, PETRI_TRANSITIONS=548} [2023-09-01 04:46:49,734 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 234 predicate places. [2023-09-01 04:46:49,734 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 548 transitions, 6995 flow [2023-09-01 04:46:49,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.22222222222223) internal successors, (4704), 27 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:49,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:46:49,735 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:46:49,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-01 04:46:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-09-01 04:46:49,941 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:46:49,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:46:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1641107800, now seen corresponding path program 1 times [2023-09-01 04:46:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:46:49,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707967276] [2023-09-01 04:46:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:46:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:46:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707967276] [2023-09-01 04:46:50,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707967276] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:46:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952888930] [2023-09-01 04:46:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:50,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:50,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:46:50,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:46:50,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 04:46:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:50,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 74 conjunts are in the unsatisfiable core [2023-09-01 04:46:50,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:46:50,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:50,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:50,762 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:46:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:46:50,774 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:46:50,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:46:50,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:46:50,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-09-01 04:46:51,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:46:51,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:51,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:46:51,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:46:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-09-01 04:46:51,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 43 treesize of output 38 [2023-09-01 04:46:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:51,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:46:51,950 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1185 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2023-09-01 04:46:52,006 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1180 Int) (v_ArrVal_1182 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1180)) |c_~#stored_elements~0.base| v_ArrVal_1182))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1180) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|))))) is different from false [2023-09-01 04:46:52,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 Int) (v_ArrVal_1178 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1180 Int) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1178) .cse3 v_ArrVal_1180)) |c_~#stored_elements~0.base| v_ArrVal_1182))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1180) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2023-09-01 04:46:52,109 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 Int) (v_ArrVal_1178 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1180 Int) (v_ArrVal_1182 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1177)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1178) .cse4 v_ArrVal_1180)) |c_~#stored_elements~0.base| v_ArrVal_1182))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1180)))))) is different from false [2023-09-01 04:46:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-09-01 04:46:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952888930] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:46:56,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:46:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-09-01 04:46:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254191057] [2023-09-01 04:46:56,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:46:56,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 04:46:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:46:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 04:46:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=496, Unknown=20, NotChecked=212, Total=930 [2023-09-01 04:46:56,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:46:56,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 548 transitions, 6995 flow. Second operand has 31 states, 31 states have (on average 174.93548387096774) internal successors, (5423), 31 states have internal predecessors, (5423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:56,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:46:56,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:46:56,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:04,991 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1182))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|))))) (forall ((v_ArrVal_1185 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647))) is different from false [2023-09-01 04:47:06,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:47:10,555 INFO L130 PetriNetUnfolder]: 7496/14394 cut-off events. [2023-09-01 04:47:10,556 INFO L131 PetriNetUnfolder]: For 1277285/1280311 co-relation queries the response was YES. [2023-09-01 04:47:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154212 conditions, 14394 events. 7496/14394 cut-off events. For 1277285/1280311 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 116573 event pairs, 2452 based on Foata normal form. 112/13196 useless extension candidates. Maximal degree in co-relation 151730. Up to 10057 conditions per place. [2023-09-01 04:47:10,766 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 421 selfloop transitions, 250 changer transitions 3/680 dead transitions. [2023-09-01 04:47:10,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 680 transitions, 12618 flow [2023-09-01 04:47:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:47:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:47:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3298 transitions. [2023-09-01 04:47:10,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4080673100717644 [2023-09-01 04:47:10,770 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3298 transitions. [2023-09-01 04:47:10,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3298 transitions. [2023-09-01 04:47:10,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:47:10,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3298 transitions. [2023-09-01 04:47:10,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 183.22222222222223) internal successors, (3298), 18 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:10,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 449.0) internal successors, (8531), 19 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:10,779 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 449.0) internal successors, (8531), 19 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:10,780 INFO L175 Difference]: Start difference. First operand has 291 places, 548 transitions, 6995 flow. Second operand 18 states and 3298 transitions. [2023-09-01 04:47:10,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 680 transitions, 12618 flow [2023-09-01 04:47:11,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 680 transitions, 12356 flow, removed 51 selfloop flow, removed 9 redundant places. [2023-09-01 04:47:11,498 INFO L231 Difference]: Finished difference. Result has 301 places, 580 transitions, 8669 flow [2023-09-01 04:47:11,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=6244, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8669, PETRI_PLACES=301, PETRI_TRANSITIONS=580} [2023-09-01 04:47:11,499 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 244 predicate places. [2023-09-01 04:47:11,499 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 580 transitions, 8669 flow [2023-09-01 04:47:11,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 174.93548387096774) internal successors, (5423), 31 states have internal predecessors, (5423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:11,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:47:11,500 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:47:11,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-09-01 04:47:11,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-09-01 04:47:11,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:47:11,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:47:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash -431092636, now seen corresponding path program 1 times [2023-09-01 04:47:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:47:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911352320] [2023-09-01 04:47:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:47:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:47:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911352320] [2023-09-01 04:47:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911352320] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:47:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:47:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:47:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409351735] [2023-09-01 04:47:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:47:11,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:47:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:47:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:47:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:47:11,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:47:11,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 580 transitions, 8669 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:11,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:47:11,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:47:11,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:15,486 INFO L130 PetriNetUnfolder]: 7132/13947 cut-off events. [2023-09-01 04:47:15,486 INFO L131 PetriNetUnfolder]: For 1486680/1489784 co-relation queries the response was YES. [2023-09-01 04:47:15,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159344 conditions, 13947 events. 7132/13947 cut-off events. For 1486680/1489784 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 114861 event pairs, 3798 based on Foata normal form. 100/12935 useless extension candidates. Maximal degree in co-relation 155423. Up to 12904 conditions per place. [2023-09-01 04:47:15,757 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 510 selfloop transitions, 1 changer transitions 3/556 dead transitions. [2023-09-01 04:47:15,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 556 transitions, 9506 flow [2023-09-01 04:47:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:47:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:47:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-09-01 04:47:15,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-09-01 04:47:15,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-09-01 04:47:15,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-09-01 04:47:15,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:47:15,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-09-01 04:47:15,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:15,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:15,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:15,763 INFO L175 Difference]: Start difference. First operand has 301 places, 580 transitions, 8669 flow. Second operand 3 states and 723 transitions. [2023-09-01 04:47:15,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 556 transitions, 9506 flow [2023-09-01 04:47:16,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 556 transitions, 8731 flow, removed 309 selfloop flow, removed 10 redundant places. [2023-09-01 04:47:16,977 INFO L231 Difference]: Finished difference. Result has 292 places, 548 transitions, 7442 flow [2023-09-01 04:47:16,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=7440, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7442, PETRI_PLACES=292, PETRI_TRANSITIONS=548} [2023-09-01 04:47:16,977 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 235 predicate places. [2023-09-01 04:47:16,977 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 548 transitions, 7442 flow [2023-09-01 04:47:16,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:16,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:47:16,978 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:47:16,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-09-01 04:47:16,978 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:47:16,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:47:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1371567627, now seen corresponding path program 1 times [2023-09-01 04:47:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:47:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594522946] [2023-09-01 04:47:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:47:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:47:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:47:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594522946] [2023-09-01 04:47:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594522946] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:47:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:47:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:47:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561276077] [2023-09-01 04:47:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:47:17,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:47:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:47:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:47:17,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:47:17,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:47:17,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 548 transitions, 7442 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:17,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:47:17,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:47:17,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:20,749 INFO L130 PetriNetUnfolder]: 6852/13553 cut-off events. [2023-09-01 04:47:20,749 INFO L131 PetriNetUnfolder]: For 1391879/1396961 co-relation queries the response was YES. [2023-09-01 04:47:20,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150687 conditions, 13553 events. 6852/13553 cut-off events. For 1391879/1396961 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 112730 event pairs, 3790 based on Foata normal form. 146/12680 useless extension candidates. Maximal degree in co-relation 146939. Up to 8729 conditions per place. [2023-09-01 04:47:20,968 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 415 selfloop transitions, 65 changer transitions 0/522 dead transitions. [2023-09-01 04:47:20,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 522 transitions, 8211 flow [2023-09-01 04:47:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:47:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:47:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-09-01 04:47:20,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-09-01 04:47:20,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-09-01 04:47:20,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-09-01 04:47:20,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:47:20,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-09-01 04:47:20,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:20,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:20,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:20,972 INFO L175 Difference]: Start difference. First operand has 292 places, 548 transitions, 7442 flow. Second operand 3 states and 717 transitions. [2023-09-01 04:47:20,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 522 transitions, 8211 flow [2023-09-01 04:47:21,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 522 transitions, 8142 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-09-01 04:47:21,603 INFO L231 Difference]: Finished difference. Result has 292 places, 516 transitions, 7083 flow [2023-09-01 04:47:21,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=6953, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7083, PETRI_PLACES=292, PETRI_TRANSITIONS=516} [2023-09-01 04:47:21,604 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 235 predicate places. [2023-09-01 04:47:21,604 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 516 transitions, 7083 flow [2023-09-01 04:47:21,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:21,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:47:21,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:47:21,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 04:47:21,605 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:47:21,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:47:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 127132993, now seen corresponding path program 1 times [2023-09-01 04:47:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:47:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361957009] [2023-09-01 04:47:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:47:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:47:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361957009] [2023-09-01 04:47:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361957009] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:47:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040765206] [2023-09-01 04:47:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:21,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:47:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:47:21,648 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:47:21,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 04:47:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:21,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:47:21,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:47:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:21,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:47:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:21,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040765206] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:47:21,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:47:21,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 04:47:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657195722] [2023-09-01 04:47:21,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:47:21,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:47:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:47:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:47:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:47:21,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:47:21,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 516 transitions, 7083 flow. Second operand has 7 states, 7 states have (on average 227.42857142857142) internal successors, (1592), 7 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:21,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:47:21,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:47:21,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:24,792 INFO L130 PetriNetUnfolder]: 5212/10479 cut-off events. [2023-09-01 04:47:24,793 INFO L131 PetriNetUnfolder]: For 935833/936264 co-relation queries the response was YES. [2023-09-01 04:47:24,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120985 conditions, 10479 events. 5212/10479 cut-off events. For 935833/936264 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 77946 event pairs, 2486 based on Foata normal form. 260/10122 useless extension candidates. Maximal degree in co-relation 119286. Up to 4590 conditions per place. [2023-09-01 04:47:24,952 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 470 selfloop transitions, 49 changer transitions 0/561 dead transitions. [2023-09-01 04:47:24,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 561 transitions, 9569 flow [2023-09-01 04:47:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:47:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:47:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-09-01 04:47:24,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289532293986637 [2023-09-01 04:47:24,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-09-01 04:47:24,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-09-01 04:47:24,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:47:24,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-09-01 04:47:24,956 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-09-01 04:47:24,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:24,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:24,957 INFO L175 Difference]: Start difference. First operand has 292 places, 516 transitions, 7083 flow. Second operand 6 states and 1425 transitions. [2023-09-01 04:47:24,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 561 transitions, 9569 flow [2023-09-01 04:47:25,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 561 transitions, 9468 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-09-01 04:47:25,505 INFO L231 Difference]: Finished difference. Result has 299 places, 510 transitions, 7197 flow [2023-09-01 04:47:25,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=6807, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7197, PETRI_PLACES=299, PETRI_TRANSITIONS=510} [2023-09-01 04:47:25,506 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 242 predicate places. [2023-09-01 04:47:25,506 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 510 transitions, 7197 flow [2023-09-01 04:47:25,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.42857142857142) internal successors, (1592), 7 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:25,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:47:25,508 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-09-01 04:47:25,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-01 04:47:25,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-09-01 04:47:25,714 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:47:25,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:47:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1946776868, now seen corresponding path program 1 times [2023-09-01 04:47:25,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:47:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560203116] [2023-09-01 04:47:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:25,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:47:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:47:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560203116] [2023-09-01 04:47:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560203116] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:47:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527782603] [2023-09-01 04:47:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:47:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:47:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:47:27,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:47:27,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 04:47:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:47:27,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 89 conjunts are in the unsatisfiable core [2023-09-01 04:47:27,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:47:27,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:47:27,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:47:27,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:47:27,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:47:27,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:47:27,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-01 04:47:27,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:47:27,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:47:27,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:47:27,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:47:27,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:47:27,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:47:28,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-09-01 04:47:28,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-09-01 04:47:28,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:47:28,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-09-01 04:47:29,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:47:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:33,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:47:33,591 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-09-01 04:47:34,066 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1469) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:47:34,101 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1467 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1467) .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1469) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1467) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:47:34,293 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (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_1465)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1467) .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1469) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1467) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:47:40,701 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1461)) |c_~#stored_elements~0.base| v_ArrVal_1463))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1465)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1467) .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1461) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1469) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1467))))))) is different from false [2023-09-01 04:47:42,968 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1459 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1459) .cse1 v_ArrVal_1461)) |c_~#stored_elements~0.base| v_ArrVal_1463))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1465)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1467) .cse3 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1461) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1469) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1467) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1459) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse4) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|)))))))) is different from false [2023-09-01 04:47:43,016 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1459 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1459) .cse1 v_ArrVal_1461)) |c_~#stored_elements~0.base| v_ArrVal_1463))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1465)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1467) .cse3 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1461) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1469) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1467) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1459) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse4) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|)))))))) is different from false [2023-09-01 04:47:43,074 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1459 Int) (v_ArrVal_1458 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1458)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse7 v_ArrVal_1459) .cse4 v_ArrVal_1461)) |c_~#stored_elements~0.base| v_ArrVal_1463))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1465)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1467) .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1469) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1461) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse6) 2147483647) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1467) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ (select .cse3 .cse7) 1) v_ArrVal_1459)))))))) is different from false [2023-09-01 04:47:43,137 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1461 Int) (v_ArrVal_1465 Int) (v_ArrVal_1467 Int) (v_ArrVal_1459 Int) (v_ArrVal_1458 Int) (v_ArrVal_1469 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1458)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1459) .cse1 v_ArrVal_1461)) |c_~#stored_elements~0.base| v_ArrVal_1463))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1465))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1467) .cse1 v_ArrVal_1469)) |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1461) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1459) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse4) 2147483647) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1467) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1469))))))))) is different from false [2023-09-01 04:47:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-09-01 04:47:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527782603] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:47:43,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:47:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 49 [2023-09-01 04:47:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494730193] [2023-09-01 04:47:43,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:47:43,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-09-01 04:47:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:47:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-09-01 04:47:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1288, Unknown=32, NotChecked=792, Total=2550 [2023-09-01 04:47:43,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 449 [2023-09-01 04:47:43,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 510 transitions, 7197 flow. Second operand has 51 states, 51 states have (on average 172.35294117647058) internal successors, (8790), 51 states have internal predecessors, (8790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:43,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:47:43,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 449 [2023-09-01 04:47:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:47,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:47:50,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:47:54,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:48:00,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:48:13,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:15,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:15,974 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)))) (forall ((v_ArrVal_1471 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1470) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|)) v_ArrVal_1471) .cse1) 2147483647)))))) is different from false [2023-09-01 04:48:18,081 INFO L130 PetriNetUnfolder]: 5313/10553 cut-off events. [2023-09-01 04:48:18,081 INFO L131 PetriNetUnfolder]: For 987514/987779 co-relation queries the response was YES. [2023-09-01 04:48:18,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124372 conditions, 10553 events. 5313/10553 cut-off events. For 987514/987779 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 77750 event pairs, 3284 based on Foata normal form. 40/9986 useless extension candidates. Maximal degree in co-relation 123348. Up to 9340 conditions per place. [2023-09-01 04:48:18,239 INFO L137 encePairwiseOnDemand]: 437/449 looper letters, 417 selfloop transitions, 102 changer transitions 1/526 dead transitions. [2023-09-01 04:48:18,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 526 transitions, 8581 flow [2023-09-01 04:48:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-01 04:48:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-09-01 04:48:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4725 transitions. [2023-09-01 04:48:18,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3897550111358575 [2023-09-01 04:48:18,243 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4725 transitions. [2023-09-01 04:48:18,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4725 transitions. [2023-09-01 04:48:18,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:48:18,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4725 transitions. [2023-09-01 04:48:18,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 175.0) internal successors, (4725), 27 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:48:18,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:48:18,255 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:48:18,256 INFO L175 Difference]: Start difference. First operand has 299 places, 510 transitions, 7197 flow. Second operand 27 states and 4725 transitions. [2023-09-01 04:48:18,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 526 transitions, 8581 flow [2023-09-01 04:48:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 526 transitions, 8551 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-09-01 04:48:18,973 INFO L231 Difference]: Finished difference. Result has 328 places, 517 transitions, 7472 flow [2023-09-01 04:48:18,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=7133, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7472, PETRI_PLACES=328, PETRI_TRANSITIONS=517} [2023-09-01 04:48:18,974 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 271 predicate places. [2023-09-01 04:48:18,974 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 517 transitions, 7472 flow [2023-09-01 04:48:18,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 172.35294117647058) internal successors, (8790), 51 states have internal predecessors, (8790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:48:18,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:48:18,977 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:48:18,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-01 04:48:19,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-09-01 04:48:19,182 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:48:19,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:48:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash 541558942, now seen corresponding path program 3 times [2023-09-01 04:48:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:48:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168504901] [2023-09-01 04:48:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:48:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:48:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:48:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:48:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:48:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168504901] [2023-09-01 04:48:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168504901] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:48:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883808605] [2023-09-01 04:48:20,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 04:48:20,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:48:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:48:20,466 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:48:20,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 04:48:20,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 04:48:20,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:48:20,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 96 conjunts are in the unsatisfiable core [2023-09-01 04:48:20,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:48:20,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:48:20,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:48:20,807 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:48:20,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:48:20,822 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:48:20,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:48:20,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-09-01 04:48:21,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:48:21,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:48:21,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:48:21,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:48:21,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:48:21,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 45 treesize of output 45 [2023-09-01 04:48:21,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-09-01 04:48:21,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-09-01 04:48:23,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:48:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-09-01 04:48:23,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:48:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:48:28,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:48:28,527 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-09-01 04:48:28,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1594) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))) is different from false [2023-09-01 04:48:28,893 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1593) .cse2 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1593) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1594))))) is different from false [2023-09-01 04:48:28,920 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1594) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1593) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-09-01 04:48:28,940 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1594) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) 1) v_ArrVal_1593) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-09-01 04:48:28,964 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1591 (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_1590))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1593) .cse4 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1593) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1594) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))) is different from false [2023-09-01 04:48:28,990 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1594) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1593) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse4) 2147483647)))))))) is different from false [2023-09-01 04:48:29,015 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1594) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1593) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse4) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))) is different from false [2023-09-01 04:48:29,050 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1586 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1586)) |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1586) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1593) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1594) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse3) 2147483647))))))))) is different from false [2023-09-01 04:48:29,084 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1586 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1586)) |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1593) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1594) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse3) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1586)))))))))) is different from false [2023-09-01 04:48:29,159 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1585 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1586 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1585) .cse7 v_ArrVal_1586)) |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1593) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1594) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1585) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1586)))))))))) is different from false [2023-09-01 04:48:29,225 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1594 Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1593 Int) (v_ArrVal_1585 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1598 Int) (v_ArrVal_1586 Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1585) .cse8 v_ArrVal_1586)) |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1593) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1585) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1594) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse3) 2147483647) (< (+ (select .cse4 .cse8) 1) v_ArrVal_1586)))))))))) is different from false [2023-09-01 04:48:29,279 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1588 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 Int) (v_ArrVal_1583 Int) (v_ArrVal_1594 Int) (v_ArrVal_1593 Int) (v_ArrVal_1585 Int) (v_ArrVal_1598 Int) (v_ArrVal_1586 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_1583)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse8 v_ArrVal_1585) .cse5 v_ArrVal_1586)) |c_~#stored_elements~0.base| v_ArrVal_1588))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1590))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1591))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1593) .cse1 v_ArrVal_1594)) |c_~#stored_elements~0.base| v_ArrVal_1596) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1593) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1586) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1594) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1598) .cse3) 2147483647) (< (+ (select .cse4 .cse8) 1) v_ArrVal_1585)))))))))) is different from false [2023-09-01 04:48:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-09-01 04:48:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883808605] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:48:32,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:48:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-09-01 04:48:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221291049] [2023-09-01 04:48:32,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:48:32,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-09-01 04:48:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:48:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-09-01 04:48:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1271, Unknown=16, NotChecked=1170, Total=2862 [2023-09-01 04:48:32,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:48:32,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 517 transitions, 7472 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:48:32,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:48:32,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:48:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:48:48,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-09-01 04:48:50,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:52,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:54,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:56,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:48:58,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:00,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:02,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:04,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:06,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:08,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:23,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:36,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:38,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:40,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:42,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:44,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:48,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:50,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-09-01 04:49:52,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-09-01 04:49:54,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:56,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:58,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:00,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:02,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:31,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:44,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:49,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:54,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:50:59,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:04,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:51:06,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:51:08,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:10,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:16,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-09-01 04:51:18,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:51:20,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:48,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:50,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:52,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:54,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:51:57,403 INFO L130 PetriNetUnfolder]: 5766/11517 cut-off events. [2023-09-01 04:51:57,404 INFO L131 PetriNetUnfolder]: For 1066523/1067094 co-relation queries the response was YES. [2023-09-01 04:51:57,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138182 conditions, 11517 events. 5766/11517 cut-off events. For 1066523/1067094 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 86247 event pairs, 2528 based on Foata normal form. 217/11143 useless extension candidates. Maximal degree in co-relation 135237. Up to 7093 conditions per place. [2023-09-01 04:51:57,579 INFO L137 encePairwiseOnDemand]: 433/449 looper letters, 377 selfloop transitions, 387 changer transitions 3/773 dead transitions. [2023-09-01 04:51:57,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 773 transitions, 17531 flow [2023-09-01 04:51:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-09-01 04:51:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-09-01 04:51:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6927 transitions. [2023-09-01 04:51:57,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3856904231625835 [2023-09-01 04:51:57,656 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6927 transitions. [2023-09-01 04:51:57,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6927 transitions. [2023-09-01 04:51:57,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:51:57,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6927 transitions. [2023-09-01 04:51:57,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 173.175) internal successors, (6927), 40 states have internal predecessors, (6927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:51:57,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 449.0) internal successors, (18409), 41 states have internal predecessors, (18409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:51:57,702 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 449.0) internal successors, (18409), 41 states have internal predecessors, (18409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:51:57,702 INFO L175 Difference]: Start difference. First operand has 328 places, 517 transitions, 7472 flow. Second operand 40 states and 6927 transitions. [2023-09-01 04:51:57,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 773 transitions, 17531 flow [2023-09-01 04:51:58,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 773 transitions, 17447 flow, removed 18 selfloop flow, removed 15 redundant places. [2023-09-01 04:51:58,439 INFO L231 Difference]: Finished difference. Result has 371 places, 668 transitions, 12476 flow [2023-09-01 04:51:58,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=7336, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=12476, PETRI_PLACES=371, PETRI_TRANSITIONS=668} [2023-09-01 04:51:58,440 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 314 predicate places. [2023-09-01 04:51:58,440 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 668 transitions, 12476 flow [2023-09-01 04:51:58,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:51:58,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:51:58,442 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:51:58,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-09-01 04:51:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-09-01 04:51:58,643 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:51:58,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:51:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1828832700, now seen corresponding path program 4 times [2023-09-01 04:51:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:51:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222441542] [2023-09-01 04:51:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:51:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:51:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:52:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222441542] [2023-09-01 04:52:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222441542] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:52:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639915813] [2023-09-01 04:52:00,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 04:52:00,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:00,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:52:00,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:52:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 04:52:00,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 04:52:00,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:52:00,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 96 conjunts are in the unsatisfiable core [2023-09-01 04:52:00,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:52:00,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:00,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:00,463 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:52:00,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:52:00,474 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:52:00,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-09-01 04:52:00,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-09-01 04:52:00,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-09-01 04:52:00,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-09-01 04:52:00,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:00,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:52:00,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-09-01 04:52:01,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-09-01 04:52:02,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-09-01 04:52:03,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-09-01 04:52:06,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:06,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-09-01 04:52:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:52:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:13,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:52:14,105 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1723 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1721) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))) is different from false [2023-09-01 04:52:14,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1721)))))) is different from false [2023-09-01 04:52:14,251 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1721) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1717)))))) is different from false [2023-09-01 04:52:14,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1721) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1717) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|))))))) is different from false [2023-09-01 04:52:14,298 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 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_1715)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1717) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1721) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-09-01 04:52:14,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1721) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse3) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1717) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))))))) is different from false [2023-09-01 04:52:14,349 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1721) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse3) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1717) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|))))))))) is different from false [2023-09-01 04:52:14,384 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1713 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1713)) |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1713) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1717) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1721) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|))))))))) is different from false [2023-09-01 04:52:14,421 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1713 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1713)) |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1717) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1713) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1721) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse1) 2147483647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))))))))) is different from false [2023-09-01 04:52:14,510 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1711 Int) (v_ArrVal_1713 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1711) .cse1 v_ArrVal_1713)) |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse5 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1713) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1717) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1711) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse3) 2147483647) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1721)))))))))) is different from false [2023-09-01 04:52:14,576 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1711 Int) (v_ArrVal_1713 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1711) .cse2 v_ArrVal_1713)) |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse6 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1711) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1713) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_1717) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse4) 2147483647) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse8 .cse6) 1) v_ArrVal_1721)))))))))) is different from false [2023-09-01 04:52:14,638 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1711 Int) (v_ArrVal_1713 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_1708)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1711) .cse7 v_ArrVal_1713)) |c_~#stored_elements~0.base| v_ArrVal_1714))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1715)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_1717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1719))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1711) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1721) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1717) (< (+ (select .cse0 .cse7) 1) v_ArrVal_1713) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse6) 2147483647) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))))))))) is different from false [2023-09-01 04:52:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-09-01 04:52:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639915813] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:52:20,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:52:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-09-01 04:52:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375902570] [2023-09-01 04:52:20,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:52:20,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-09-01 04:52:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:52:20,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-09-01 04:52:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1277, Unknown=25, NotChecked=1092, Total=2862 [2023-09-01 04:52:21,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:52:21,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 668 transitions, 12476 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:21,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:52:21,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:52:21,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:52:23,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:26,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:29,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:40,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:42,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:52:47,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:49,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:51,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:53,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:55,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-09-01 04:52:57,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:59,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:01,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:03,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:07,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:53:14,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:23,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:25,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:27,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:29,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:31,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:33,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:35,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:37,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:49,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:52,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-09-01 04:53:54,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:56,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:53:58,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:00,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:02,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:04,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:06,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:08,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:10,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:12,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:14,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:16,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:18,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:33,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:48,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:50,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:03,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:05,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-09-01 04:55:07,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:09,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:26,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:29,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:35,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:46,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:48,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:50,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:55:52,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:17,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:19,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-09-01 04:56:21,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:23,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:25,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:27,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:29,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:32,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:56:32,315 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1723 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1721) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))) (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1721 Int) (v_ArrVal_1723 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1721)) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_1721) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1723) .cse1) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|)))))) is different from false Killed by 15