./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.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/goblint-regression/06-symbeq_05-funloop_hard2.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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --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 06:10:46,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 06:10:46,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 06:10:46,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 06:10:46,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 06:10:46,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 06:10:46,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 06:10:46,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 06:10:46,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 06:10:46,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 06:10:46,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 06:10:46,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 06:10:46,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 06:10:46,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 06:10:46,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 06:10:46,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 06:10:46,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 06:10:46,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 06:10:46,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 06:10:46,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 06:10:46,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 06:10:46,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 06:10:46,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 06:10:46,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 06:10:46,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 06:10:46,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 06:10:46,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 06:10:46,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 06:10:46,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 06:10:46,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 06:10:46,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 06:10:46,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 06:10:46,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 06:10:46,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 06:10:46,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 06:10:46,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 06:10:46,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 06:10:46,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 06:10:46,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 06:10:46,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 06:10:46,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 06:10:46,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-09-01 06:10:46,638 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 06:10:46,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 06:10:46,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 06:10:46,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 06:10:46,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 06:10:46,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 06:10:46,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 06:10:46,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 06:10:46,641 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 06:10:46,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 06:10:46,642 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 06:10:46,642 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 06:10:46,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 06:10:46,643 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 06:10:46,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 06:10:46,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 06:10:46,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 06:10:46,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 06:10:46,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 06:10:46,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 06:10:46,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 06:10:46,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 06:10:46,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 06:10:46,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 06:10:46,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 06:10:46,646 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 06:10:46,646 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a 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 06:10:46,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 06:10:46,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 06:10:46,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 06:10:46,947 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 06:10:46,947 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 06:10:46,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2023-09-01 06:10:48,188 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 06:10:48,429 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 06:10:48,433 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2023-09-01 06:10:48,454 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ef6a036/be5687e12210405688dae75f3e9baec0/FLAG6c4421b86 [2023-09-01 06:10:48,475 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ef6a036/be5687e12210405688dae75f3e9baec0 [2023-09-01 06:10:48,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 06:10:48,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 06:10:48,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 06:10:48,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 06:10:48,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 06:10:48,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:48,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370fde1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48, skipping insertion in model container [2023-09-01 06:10:48,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:48,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 06:10:48,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 06:10:48,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 06:10:48,892 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 06:10:48,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 06:10:48,973 INFO L208 MainTranslator]: Completed translation [2023-09-01 06:10:48,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48 WrapperNode [2023-09-01 06:10:48,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 06:10:48,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 06:10:48,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 06:10:48,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 06:10:48,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,020 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-09-01 06:10:49,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 06:10:49,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 06:10:49,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 06:10:49,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 06:10:49,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,060 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 06:10:49,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 06:10:49,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 06:10:49,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 06:10:49,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (1/1) ... [2023-09-01 06:10:49,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 06:10:49,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:49,094 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 06:10:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 06:10:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 06:10:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 06:10:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 06:10:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 06:10:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 06:10:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 06:10:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 06:10:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 06:10:49,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 06:10:49,113 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 06:10:49,133 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 06:10:49,224 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 06:10:49,225 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 06:10:49,381 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 06:10:49,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 06:10:49,390 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 06:10:49,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 06:10:49 BoogieIcfgContainer [2023-09-01 06:10:49,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 06:10:49,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 06:10:49,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 06:10:49,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 06:10:49,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 06:10:48" (1/3) ... [2023-09-01 06:10:49,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1e303b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 06:10:49, skipping insertion in model container [2023-09-01 06:10:49,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:48" (2/3) ... [2023-09-01 06:10:49,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1e303b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 06:10:49, skipping insertion in model container [2023-09-01 06:10:49,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 06:10:49" (3/3) ... [2023-09-01 06:10:49,398 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2023-09-01 06:10:49,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 06:10:49,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 06:10:49,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-09-01 06:10:49,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 06:10:49,452 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 06:10:49,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 104 transitions, 213 flow [2023-09-01 06:10:49,514 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-09-01 06:10:49,515 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:49,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 6/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-09-01 06:10:49,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 104 transitions, 213 flow [2023-09-01 06:10:49,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 103 transitions, 209 flow [2023-09-01 06:10:49,525 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 06:10:49,531 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 103 transitions, 209 flow [2023-09-01 06:10:49,532 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 103 transitions, 209 flow [2023-09-01 06:10:49,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 209 flow [2023-09-01 06:10:49,571 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-09-01 06:10:49,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:49,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 6/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-09-01 06:10:49,576 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-09-01 06:10:51,128 INFO L134 LiptonReduction]: Checked pairs total: 3603 [2023-09-01 06:10:51,128 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-09-01 06:10:51,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 06:10:51,151 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;@15b31fa3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 06:10:51,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-09-01 06:10:51,152 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-09-01 06:10:51,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:51,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:51,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 06:10:51,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:51,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 12550, now seen corresponding path program 1 times [2023-09-01 06:10:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532188303] [2023-09-01 06:10:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:51,348 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 06:10:51,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532188303] [2023-09-01 06:10:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532188303] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 06:10:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583491636] [2023-09-01 06:10:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:51,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:51,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-09-01 06:10:51,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 06:10:51,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:51,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-09-01 06:10:51,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:51,453 INFO L130 PetriNetUnfolder]: 152/306 cut-off events. [2023-09-01 06:10:51,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:51,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 306 events. 152/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1260 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 600. Up to 306 conditions per place. [2023-09-01 06:10:51,456 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-09-01 06:10:51,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 127 flow [2023-09-01 06:10:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-09-01 06:10:51,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-09-01 06:10:51,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-09-01 06:10:51,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-09-01 06:10:51,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:51,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-09-01 06:10:51,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 06:10:51,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:51,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:51,477 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 65 flow. Second operand 3 states and 323 transitions. [2023-09-01 06:10:51,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 127 flow [2023-09-01 06:10:51,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:51,480 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 76 flow [2023-09-01 06:10:51,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-09-01 06:10:51,483 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-09-01 06:10:51,483 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 76 flow [2023-09-01 06:10:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 06:10:51,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:51,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 06:10:51,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 06:10:51,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:51,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 390006, now seen corresponding path program 1 times [2023-09-01 06:10:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645944617] [2023-09-01 06:10:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:51,534 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 06:10:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645944617] [2023-09-01 06:10:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645944617] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403110870] [2023-09-01 06:10:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:51,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:51,538 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 06:10:51,552 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 06:10:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:51,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 06:10:51,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:51,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 06:10:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403110870] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 06:10:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-09-01 06:10:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568909119] [2023-09-01 06:10:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:51,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 06:10:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 06:10:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 06:10:51,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-09-01 06:10:51,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 06:10:51,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:51,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-09-01 06:10:51,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:51,715 INFO L130 PetriNetUnfolder]: 152/305 cut-off events. [2023-09-01 06:10:51,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:51,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 305 events. 152/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1274 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 610. Up to 304 conditions per place. [2023-09-01 06:10:51,717 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-09-01 06:10:51,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 132 flow [2023-09-01 06:10:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-09-01 06:10:51,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2023-09-01 06:10:51,720 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-09-01 06:10:51,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-09-01 06:10:51,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:51,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-09-01 06:10:51,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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 06:10:51,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:51,723 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:51,724 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 76 flow. Second operand 4 states and 415 transitions. [2023-09-01 06:10:51,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 132 flow [2023-09-01 06:10:51,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 128 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:51,725 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 72 flow [2023-09-01 06:10:51,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-09-01 06:10:51,725 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-09-01 06:10:51,726 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 72 flow [2023-09-01 06:10:51,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 06:10:51,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:51,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:51,732 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 06:10:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:51,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:51,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -573546742, now seen corresponding path program 1 times [2023-09-01 06:10:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705161656] [2023-09-01 06:10:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:52,042 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 06:10:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705161656] [2023-09-01 06:10:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705161656] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340772549] [2023-09-01 06:10:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:52,051 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 06:10:52,056 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 06:10:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:52,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 06:10:52,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:52,114 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 06:10:52,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:10:52,127 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 06:10:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340772549] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:10:52,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:10:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 06:10:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177273639] [2023-09-01 06:10:52,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:10:52,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 06:10:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 06:10:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 06:10:52,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-09-01 06:10:52,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 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 06:10:52,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:52,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-09-01 06:10:52,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:52,250 INFO L130 PetriNetUnfolder]: 152/308 cut-off events. [2023-09-01 06:10:52,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:52,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 308 events. 152/308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1258 event pairs, 126 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 619. Up to 305 conditions per place. [2023-09-01 06:10:52,252 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-09-01 06:10:52,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 150 flow [2023-09-01 06:10:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 06:10:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 06:10:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-09-01 06:10:52,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2023-09-01 06:10:52,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-09-01 06:10:52,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-09-01 06:10:52,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:52,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-09-01 06:10:52,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 06:10:52,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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 06:10:52,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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 06:10:52,261 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 72 flow. Second operand 6 states and 606 transitions. [2023-09-01 06:10:52,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 150 flow [2023-09-01 06:10:52,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 06:10:52,262 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 105 flow [2023-09-01 06:10:52,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-09-01 06:10:52,262 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-09-01 06:10:52,263 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 105 flow [2023-09-01 06:10:52,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 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 06:10:52,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:52,263 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:52,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 06:10:52,468 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,SelfDestructingSolverStorable2 [2023-09-01 06:10:52,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:52,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1594330982, now seen corresponding path program 2 times [2023-09-01 06:10:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929617431] [2023-09-01 06:10:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:52,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929617431] [2023-09-01 06:10:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929617431] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074434075] [2023-09-01 06:10:52,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:10:52,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:52,555 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 06:10:52,558 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 06:10:52,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-01 06:10:52,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:10:52,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 06:10:52,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:52,647 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 7 treesize of output 6 [2023-09-01 06:10:52,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:10:52,721 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 13 treesize of output 15 [2023-09-01 06:10:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-01 06:10:52,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 06:10:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074434075] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:52,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 06:10:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-09-01 06:10:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630925646] [2023-09-01 06:10:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:52,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 06:10:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 06:10:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-09-01 06:10:52,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-09-01 06:10:52,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 06:10:52,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:52,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-09-01 06:10:52,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:52,917 INFO L130 PetriNetUnfolder]: 196/391 cut-off events. [2023-09-01 06:10:52,917 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 06:10:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 391 events. 196/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1724 event pairs, 46 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 795. Up to 317 conditions per place. [2023-09-01 06:10:52,920 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-09-01 06:10:52,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 263 flow [2023-09-01 06:10:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-09-01 06:10:52,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325 [2023-09-01 06:10:52,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-09-01 06:10:52,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-09-01 06:10:52,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:52,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-09-01 06:10:52,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 06:10:52,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:52,927 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:52,927 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 105 flow. Second operand 4 states and 426 transitions. [2023-09-01 06:10:52,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 263 flow [2023-09-01 06:10:52,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:52,930 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 145 flow [2023-09-01 06:10:52,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-09-01 06:10:52,931 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-09-01 06:10:52,931 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 145 flow [2023-09-01 06:10:52,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 06:10:52,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:52,932 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:52,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-01 06:10:53,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:53,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:53,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1594329890, now seen corresponding path program 1 times [2023-09-01 06:10:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340022585] [2023-09-01 06:10:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340022585] [2023-09-01 06:10:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340022585] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:53,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100036620] [2023-09-01 06:10:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:53,237 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 06:10:53,239 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 06:10:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:53,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 06:10:53,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:53,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:10:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100036620] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:10:53,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:10:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-09-01 06:10:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504119487] [2023-09-01 06:10:53,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:10:53,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 06:10:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 06:10:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-09-01 06:10:53,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-09-01 06:10:53,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 145 flow. Second operand has 13 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 06:10:53,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:53,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-09-01 06:10:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:53,487 INFO L130 PetriNetUnfolder]: 196/397 cut-off events. [2023-09-01 06:10:53,487 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-09-01 06:10:53,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 397 events. 196/397 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1768 event pairs, 129 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 985. Up to 388 conditions per place. [2023-09-01 06:10:53,490 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 34 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2023-09-01 06:10:53,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 271 flow [2023-09-01 06:10:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 06:10:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 06:10:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1185 transitions. [2023-09-01 06:10:53,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2023-09-01 06:10:53,493 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1185 transitions. [2023-09-01 06:10:53,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1185 transitions. [2023-09-01 06:10:53,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:53,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1185 transitions. [2023-09-01 06:10:53,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.75) internal successors, (1185), 12 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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 06:10:53,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 200.0) internal successors, (2600), 13 states have internal predecessors, (2600), 0 states have call successors, (0), 0 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 06:10:53,500 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 200.0) internal successors, (2600), 13 states have internal predecessors, (2600), 0 states have call successors, (0), 0 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 06:10:53,501 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 145 flow. Second operand 12 states and 1185 transitions. [2023-09-01 06:10:53,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 271 flow [2023-09-01 06:10:53,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 06:10:53,506 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 229 flow [2023-09-01 06:10:53,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-09-01 06:10:53,507 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-09-01 06:10:53,507 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 229 flow [2023-09-01 06:10:53,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 06:10:53,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:53,509 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:53,526 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 06:10:53,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:53,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:53,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 90496734, now seen corresponding path program 2 times [2023-09-01 06:10:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937659840] [2023-09-01 06:10:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937659840] [2023-09-01 06:10:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937659840] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 06:10:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873389597] [2023-09-01 06:10:53,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:53,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 06:10:53,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:53,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 06:10:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 06:10:53,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-09-01 06:10:53,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 06:10:53,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:53,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-09-01 06:10:53,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:54,036 INFO L130 PetriNetUnfolder]: 186/377 cut-off events. [2023-09-01 06:10:54,036 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-09-01 06:10:54,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 377 events. 186/377 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1619 event pairs, 60 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 959. Up to 315 conditions per place. [2023-09-01 06:10:54,038 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 50 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-09-01 06:10:54,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 378 flow [2023-09-01 06:10:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-09-01 06:10:54,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-09-01 06:10:54,040 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-09-01 06:10:54,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-09-01 06:10:54,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:54,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-09-01 06:10:54,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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 06:10:54,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:54,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 06:10:54,043 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 229 flow. Second operand 4 states and 416 transitions. [2023-09-01 06:10:54,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 378 flow [2023-09-01 06:10:54,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 330 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-09-01 06:10:54,045 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 219 flow [2023-09-01 06:10:54,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-09-01 06:10:54,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-09-01 06:10:54,046 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 219 flow [2023-09-01 06:10:54,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 06:10:54,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:54,047 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 06:10:54,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:54,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1066976044, now seen corresponding path program 1 times [2023-09-01 06:10:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775994883] [2023-09-01 06:10:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:54,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775994883] [2023-09-01 06:10:54,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775994883] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:10:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738484735] [2023-09-01 06:10:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:54,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:54,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-09-01 06:10:54,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 06:10:54,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:54,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-09-01 06:10:54,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:54,168 INFO L130 PetriNetUnfolder]: 264/534 cut-off events. [2023-09-01 06:10:54,169 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-09-01 06:10:54,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 534 events. 264/534 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2526 event pairs, 98 based on Foata normal form. 20/431 useless extension candidates. Maximal degree in co-relation 1423. Up to 321 conditions per place. [2023-09-01 06:10:54,171 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 69 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-09-01 06:10:54,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 451 flow [2023-09-01 06:10:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-09-01 06:10:54,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683333333333334 [2023-09-01 06:10:54,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-09-01 06:10:54,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-09-01 06:10:54,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:54,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-09-01 06:10:54,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 06:10:54,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:54,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:54,186 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 219 flow. Second operand 3 states and 341 transitions. [2023-09-01 06:10:54,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 451 flow [2023-09-01 06:10:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:54,189 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 228 flow [2023-09-01 06:10:54,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-09-01 06:10:54,190 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2023-09-01 06:10:54,190 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 228 flow [2023-09-01 06:10:54,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 06:10:54,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:54,190 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:54,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 06:10:54,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:54,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1068025261, now seen corresponding path program 1 times [2023-09-01 06:10:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776287235] [2023-09-01 06:10:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776287235] [2023-09-01 06:10:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776287235] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:10:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689968993] [2023-09-01 06:10:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:54,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-09-01 06:10:54,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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 06:10:54,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:54,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-09-01 06:10:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:54,318 INFO L130 PetriNetUnfolder]: 318/646 cut-off events. [2023-09-01 06:10:54,318 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2023-09-01 06:10:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 646 events. 318/646 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2986 event pairs, 173 based on Foata normal form. 14/508 useless extension candidates. Maximal degree in co-relation 1824. Up to 493 conditions per place. [2023-09-01 06:10:54,322 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 63 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-09-01 06:10:54,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 421 flow [2023-09-01 06:10:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-09-01 06:10:54,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2023-09-01 06:10:54,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-09-01 06:10:54,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-09-01 06:10:54,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:54,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-09-01 06:10:54,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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 06:10:54,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:54,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:10:54,326 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 228 flow. Second operand 3 states and 333 transitions. [2023-09-01 06:10:54,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 421 flow [2023-09-01 06:10:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 415 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:54,328 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 226 flow [2023-09-01 06:10:54,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-09-01 06:10:54,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-09-01 06:10:54,329 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 226 flow [2023-09-01 06:10:54,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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 06:10:54,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:54,330 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:54,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 06:10:54,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:54,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1132939076, now seen corresponding path program 1 times [2023-09-01 06:10:54,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982393313] [2023-09-01 06:10:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:54,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982393313] [2023-09-01 06:10:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982393313] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:54,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46548498] [2023-09-01 06:10:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:54,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:54,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:10:54,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:54,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:54,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:10:54,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:55,049 INFO L130 PetriNetUnfolder]: 354/736 cut-off events. [2023-09-01 06:10:55,049 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-09-01 06:10:55,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 736 events. 354/736 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3697 event pairs, 159 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 2159. Up to 587 conditions per place. [2023-09-01 06:10:55,055 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2023-09-01 06:10:55,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 532 flow [2023-09-01 06:10:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 06:10:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 06:10:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2023-09-01 06:10:55,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474375 [2023-09-01 06:10:55,058 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2023-09-01 06:10:55,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2023-09-01 06:10:55,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:55,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2023-09-01 06:10:55,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 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 06:10:55,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 06:10:55,063 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 06:10:55,063 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 226 flow. Second operand 8 states and 759 transitions. [2023-09-01 06:10:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 532 flow [2023-09-01 06:10:55,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:55,067 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 355 flow [2023-09-01 06:10:55,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-09-01 06:10:55,068 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-09-01 06:10:55,068 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 355 flow [2023-09-01 06:10:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:55,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:55,069 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:55,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 06:10:55,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:55,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -436636914, now seen corresponding path program 1 times [2023-09-01 06:10:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482355] [2023-09-01 06:10:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:55,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482355] [2023-09-01 06:10:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482355] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784310275] [2023-09-01 06:10:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:55,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:55,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-09-01 06:10:55,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 355 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:55,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:55,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-09-01 06:10:55,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:55,876 INFO L130 PetriNetUnfolder]: 381/816 cut-off events. [2023-09-01 06:10:55,877 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-09-01 06:10:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 816 events. 381/816 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4347 event pairs, 181 based on Foata normal form. 21/697 useless extension candidates. Maximal degree in co-relation 2771. Up to 630 conditions per place. [2023-09-01 06:10:55,885 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 69 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2023-09-01 06:10:55,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 752 flow [2023-09-01 06:10:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1011 transitions. [2023-09-01 06:10:55,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45954545454545453 [2023-09-01 06:10:55,889 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1011 transitions. [2023-09-01 06:10:55,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1011 transitions. [2023-09-01 06:10:55,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:55,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1011 transitions. [2023-09-01 06:10:55,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.9090909090909) internal successors, (1011), 11 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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 06:10:55,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:55,895 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:55,895 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 355 flow. Second operand 11 states and 1011 transitions. [2023-09-01 06:10:55,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 752 flow [2023-09-01 06:10:55,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 712 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 06:10:55,901 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 538 flow [2023-09-01 06:10:55,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=538, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2023-09-01 06:10:55,902 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2023-09-01 06:10:55,902 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 538 flow [2023-09-01 06:10:55,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:55,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:55,903 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:55,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 06:10:55,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:55,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -436723406, now seen corresponding path program 2 times [2023-09-01 06:10:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748246968] [2023-09-01 06:10:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748246968] [2023-09-01 06:10:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748246968] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533460082] [2023-09-01 06:10:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:56,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:56,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:10:56,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 538 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:56,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:56,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:10:56,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:56,698 INFO L130 PetriNetUnfolder]: 400/853 cut-off events. [2023-09-01 06:10:56,699 INFO L131 PetriNetUnfolder]: For 2246/2246 co-relation queries the response was YES. [2023-09-01 06:10:56,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 853 events. 400/853 cut-off events. For 2246/2246 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4595 event pairs, 181 based on Foata normal form. 10/719 useless extension candidates. Maximal degree in co-relation 3303. Up to 714 conditions per place. [2023-09-01 06:10:56,707 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 76 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2023-09-01 06:10:56,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 878 flow [2023-09-01 06:10:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 06:10:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 06:10:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2023-09-01 06:10:56,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467 [2023-09-01 06:10:56,710 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2023-09-01 06:10:56,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2023-09-01 06:10:56,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:56,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2023-09-01 06:10:56,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 0 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 06:10:56,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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 06:10:56,717 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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 06:10:56,717 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 538 flow. Second operand 10 states and 934 transitions. [2023-09-01 06:10:56,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 878 flow [2023-09-01 06:10:56,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 101 transitions, 838 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-09-01 06:10:56,726 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 616 flow [2023-09-01 06:10:56,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=616, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2023-09-01 06:10:56,727 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2023-09-01 06:10:56,727 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 616 flow [2023-09-01 06:10:56,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:56,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:56,728 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 06:10:56,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:56,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -436704804, now seen corresponding path program 2 times [2023-09-01 06:10:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058946434] [2023-09-01 06:10:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058946434] [2023-09-01 06:10:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058946434] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999517063] [2023-09-01 06:10:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:56,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:56,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:57,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-09-01 06:10:57,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:57,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:57,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-09-01 06:10:57,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:57,406 INFO L130 PetriNetUnfolder]: 437/923 cut-off events. [2023-09-01 06:10:57,406 INFO L131 PetriNetUnfolder]: For 3149/3149 co-relation queries the response was YES. [2023-09-01 06:10:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 923 events. 437/923 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4962 event pairs, 107 based on Foata normal form. 9/789 useless extension candidates. Maximal degree in co-relation 3685. Up to 647 conditions per place. [2023-09-01 06:10:57,416 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 86 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2023-09-01 06:10:57,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 1122 flow [2023-09-01 06:10:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1027 transitions. [2023-09-01 06:10:57,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668181818181818 [2023-09-01 06:10:57,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1027 transitions. [2023-09-01 06:10:57,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1027 transitions. [2023-09-01 06:10:57,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:57,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1027 transitions. [2023-09-01 06:10:57,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 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 06:10:57,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:57,425 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:57,425 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 616 flow. Second operand 11 states and 1027 transitions. [2023-09-01 06:10:57,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 1122 flow [2023-09-01 06:10:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 126 transitions, 1071 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-09-01 06:10:57,436 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 789 flow [2023-09-01 06:10:57,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=789, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2023-09-01 06:10:57,437 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2023-09-01 06:10:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 789 flow [2023-09-01 06:10:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:57,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:57,438 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 06:10:57,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:57,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash -436704806, now seen corresponding path program 3 times [2023-09-01 06:10:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:57,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952790028] [2023-09-01 06:10:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952790028] [2023-09-01 06:10:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952790028] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527577078] [2023-09-01 06:10:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:57,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:10:57,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 789 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:57,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:57,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:10:57,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:58,051 INFO L130 PetriNetUnfolder]: 408/874 cut-off events. [2023-09-01 06:10:58,051 INFO L131 PetriNetUnfolder]: For 4142/4142 co-relation queries the response was YES. [2023-09-01 06:10:58,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 874 events. 408/874 cut-off events. For 4142/4142 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4631 event pairs, 115 based on Foata normal form. 26/778 useless extension candidates. Maximal degree in co-relation 3766. Up to 641 conditions per place. [2023-09-01 06:10:58,058 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 82 selfloop transitions, 40 changer transitions 0/122 dead transitions. [2023-09-01 06:10:58,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 122 transitions, 1173 flow [2023-09-01 06:10:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2023-09-01 06:10:58,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47045454545454546 [2023-09-01 06:10:58,061 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2023-09-01 06:10:58,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2023-09-01 06:10:58,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:58,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2023-09-01 06:10:58,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.0909090909091) internal successors, (1035), 11 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 06:10:58,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:58,065 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:58,065 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 789 flow. Second operand 11 states and 1035 transitions. [2023-09-01 06:10:58,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 122 transitions, 1173 flow [2023-09-01 06:10:58,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 1049 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-09-01 06:10:58,078 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 744 flow [2023-09-01 06:10:58,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=744, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2023-09-01 06:10:58,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2023-09-01 06:10:58,079 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 744 flow [2023-09-01 06:10:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:58,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:58,079 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:58,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 06:10:58,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:58,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -436729940, now seen corresponding path program 1 times [2023-09-01 06:10:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:58,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953032428] [2023-09-01 06:10:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953032428] [2023-09-01 06:10:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953032428] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412138058] [2023-09-01 06:10:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:58,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:58,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:10:58,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:58,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:58,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:10:58,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:58,622 INFO L130 PetriNetUnfolder]: 429/929 cut-off events. [2023-09-01 06:10:58,622 INFO L131 PetriNetUnfolder]: For 4043/4043 co-relation queries the response was YES. [2023-09-01 06:10:58,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 929 events. 429/929 cut-off events. For 4043/4043 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5091 event pairs, 177 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 4051. Up to 788 conditions per place. [2023-09-01 06:10:58,629 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 89 selfloop transitions, 29 changer transitions 0/118 dead transitions. [2023-09-01 06:10:58,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 1235 flow [2023-09-01 06:10:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 06:10:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 06:10:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 754 transitions. [2023-09-01 06:10:58,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47125 [2023-09-01 06:10:58,632 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 754 transitions. [2023-09-01 06:10:58,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 754 transitions. [2023-09-01 06:10:58,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:58,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 754 transitions. [2023-09-01 06:10:58,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 0 states have call successors, (0), 0 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 06:10:58,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 06:10:58,635 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 06:10:58,636 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 744 flow. Second operand 8 states and 754 transitions. [2023-09-01 06:10:58,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 1235 flow [2023-09-01 06:10:58,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 1167 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-09-01 06:10:58,645 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 946 flow [2023-09-01 06:10:58,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=946, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2023-09-01 06:10:58,646 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2023-09-01 06:10:58,646 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 946 flow [2023-09-01 06:10:58,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:10:58,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:58,647 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:58,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 06:10:58,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:58,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash -436729951, now seen corresponding path program 1 times [2023-09-01 06:10:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327513594] [2023-09-01 06:10:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327513594] [2023-09-01 06:10:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327513594] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089909363] [2023-09-01 06:10:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:58,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:58,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:58,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-09-01 06:10:58,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 946 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:58,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:58,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-09-01 06:10:58,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:59,171 INFO L130 PetriNetUnfolder]: 422/940 cut-off events. [2023-09-01 06:10:59,171 INFO L131 PetriNetUnfolder]: For 4829/4829 co-relation queries the response was YES. [2023-09-01 06:10:59,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4540 conditions, 940 events. 422/940 cut-off events. For 4829/4829 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5312 event pairs, 175 based on Foata normal form. 7/857 useless extension candidates. Maximal degree in co-relation 4490. Up to 807 conditions per place. [2023-09-01 06:10:59,179 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 94 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2023-09-01 06:10:59,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 1420 flow [2023-09-01 06:10:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 06:10:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 06:10:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2023-09-01 06:10:59,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2023-09-01 06:10:59,181 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 834 transitions. [2023-09-01 06:10:59,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 834 transitions. [2023-09-01 06:10:59,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:59,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 834 transitions. [2023-09-01 06:10:59,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 06:10:59,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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 06:10:59,186 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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 06:10:59,186 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 946 flow. Second operand 9 states and 834 transitions. [2023-09-01 06:10:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 1420 flow [2023-09-01 06:10:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 1380 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 06:10:59,196 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1097 flow [2023-09-01 06:10:59,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1097, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2023-09-01 06:10:59,197 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2023-09-01 06:10:59,197 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1097 flow [2023-09-01 06:10:59,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:59,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:59,198 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:59,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 06:10:59,198 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:59,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -440535511, now seen corresponding path program 2 times [2023-09-01 06:10:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558495412] [2023-09-01 06:10:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558495412] [2023-09-01 06:10:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558495412] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202514972] [2023-09-01 06:10:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:59,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:59,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-09-01 06:10:59,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 1097 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:59,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:59,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-09-01 06:10:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:59,765 INFO L130 PetriNetUnfolder]: 448/985 cut-off events. [2023-09-01 06:10:59,766 INFO L131 PetriNetUnfolder]: For 5847/5847 co-relation queries the response was YES. [2023-09-01 06:10:59,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4949 conditions, 985 events. 448/985 cut-off events. For 5847/5847 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5556 event pairs, 185 based on Foata normal form. 8/903 useless extension candidates. Maximal degree in co-relation 4897. Up to 816 conditions per place. [2023-09-01 06:10:59,774 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 97 selfloop transitions, 44 changer transitions 0/141 dead transitions. [2023-09-01 06:10:59,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 141 transitions, 1667 flow [2023-09-01 06:10:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1006 transitions. [2023-09-01 06:10:59,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572727272727273 [2023-09-01 06:10:59,778 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1006 transitions. [2023-09-01 06:10:59,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1006 transitions. [2023-09-01 06:10:59,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:59,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1006 transitions. [2023-09-01 06:10:59,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.45454545454545) internal successors, (1006), 11 states have internal predecessors, (1006), 0 states have call successors, (0), 0 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 06:10:59,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:59,784 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:10:59,784 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1097 flow. Second operand 11 states and 1006 transitions. [2023-09-01 06:10:59,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 141 transitions, 1667 flow [2023-09-01 06:10:59,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 141 transitions, 1623 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-09-01 06:10:59,801 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 1375 flow [2023-09-01 06:10:59,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2023-09-01 06:10:59,802 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2023-09-01 06:10:59,803 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 1375 flow [2023-09-01 06:10:59,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:10:59,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:59,803 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:59,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 06:10:59,803 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:10:59,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -440304860, now seen corresponding path program 2 times [2023-09-01 06:10:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030671992] [2023-09-01 06:10:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:11:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030671992] [2023-09-01 06:11:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030671992] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:11:00,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:11:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:11:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114829268] [2023-09-01 06:11:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:11:00,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:11:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:11:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:11:00,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:11:00,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 1375 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:11:00,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:11:00,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:11:00,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:11:00,448 INFO L130 PetriNetUnfolder]: 459/1008 cut-off events. [2023-09-01 06:11:00,448 INFO L131 PetriNetUnfolder]: For 7923/7923 co-relation queries the response was YES. [2023-09-01 06:11:00,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 1008 events. 459/1008 cut-off events. For 7923/7923 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5704 event pairs, 186 based on Foata normal form. 7/925 useless extension candidates. Maximal degree in co-relation 5528. Up to 875 conditions per place. [2023-09-01 06:11:00,462 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 107 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2023-09-01 06:11:00,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 143 transitions, 1861 flow [2023-09-01 06:11:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 06:11:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 06:11:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2023-09-01 06:11:00,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645 [2023-09-01 06:11:00,465 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2023-09-01 06:11:00,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2023-09-01 06:11:00,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:11:00,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2023-09-01 06:11:00,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.9) internal successors, (929), 10 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 06:11:00,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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 06:11:00,477 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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 06:11:00,477 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 1375 flow. Second operand 10 states and 929 transitions. [2023-09-01 06:11:00,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 143 transitions, 1861 flow [2023-09-01 06:11:00,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 143 transitions, 1840 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-09-01 06:11:00,521 INFO L231 Difference]: Finished difference. Result has 132 places, 125 transitions, 1538 flow [2023-09-01 06:11:00,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1538, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2023-09-01 06:11:00,522 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2023-09-01 06:11:00,522 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 1538 flow [2023-09-01 06:11:00,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:11:00,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:11:00,522 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:11:00,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 06:11:00,523 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:11:00,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:11:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash -440601530, now seen corresponding path program 3 times [2023-09-01 06:11:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:11:00,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863993444] [2023-09-01 06:11:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:11:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:11:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863993444] [2023-09-01 06:11:00,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863993444] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:11:00,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:11:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:11:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805449610] [2023-09-01 06:11:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:11:00,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:11:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:11:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:11:00,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-09-01 06:11:00,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 1538 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:11:00,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:11:00,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-09-01 06:11:00,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:11:01,217 INFO L130 PetriNetUnfolder]: 481/1058 cut-off events. [2023-09-01 06:11:01,218 INFO L131 PetriNetUnfolder]: For 9365/9365 co-relation queries the response was YES. [2023-09-01 06:11:01,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 1058 events. 481/1058 cut-off events. For 9365/9365 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6085 event pairs, 173 based on Foata normal form. 14/982 useless extension candidates. Maximal degree in co-relation 5922. Up to 824 conditions per place. [2023-09-01 06:11:01,237 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 109 selfloop transitions, 55 changer transitions 0/164 dead transitions. [2023-09-01 06:11:01,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 2203 flow [2023-09-01 06:11:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:11:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:11:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2023-09-01 06:11:01,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-09-01 06:11:01,241 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1025 transitions. [2023-09-01 06:11:01,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1025 transitions. [2023-09-01 06:11:01,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:11:01,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1025 transitions. [2023-09-01 06:11:01,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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 06:11:01,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:11:01,245 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:11:01,245 INFO L175 Difference]: Start difference. First operand has 132 places, 125 transitions, 1538 flow. Second operand 11 states and 1025 transitions. [2023-09-01 06:11:01,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 2203 flow [2023-09-01 06:11:01,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 164 transitions, 2080 flow, removed 15 selfloop flow, removed 8 redundant places. [2023-09-01 06:11:01,269 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 1702 flow [2023-09-01 06:11:01,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1702, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2023-09-01 06:11:01,271 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2023-09-01 06:11:01,271 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 1702 flow [2023-09-01 06:11:01,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 06:11:01,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:11:01,271 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:11:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 06:11:01,272 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:11:01,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:11:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash -440601541, now seen corresponding path program 3 times [2023-09-01 06:11:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:11:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695820879] [2023-09-01 06:11:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:11:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:11:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695820879] [2023-09-01 06:11:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695820879] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:11:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:11:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:11:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542571680] [2023-09-01 06:11:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:11:01,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:11:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:11:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:11:01,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-09-01 06:11:01,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 1702 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:11:01,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:11:01,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-09-01 06:11:01,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:11:01,860 INFO L130 PetriNetUnfolder]: 474/1044 cut-off events. [2023-09-01 06:11:01,860 INFO L131 PetriNetUnfolder]: For 9731/9731 co-relation queries the response was YES. [2023-09-01 06:11:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 1044 events. 474/1044 cut-off events. For 9731/9731 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5987 event pairs, 173 based on Foata normal form. 7/961 useless extension candidates. Maximal degree in co-relation 5991. Up to 823 conditions per place. [2023-09-01 06:11:01,893 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 108 selfloop transitions, 54 changer transitions 0/162 dead transitions. [2023-09-01 06:11:01,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 162 transitions, 2233 flow [2023-09-01 06:11:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:11:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:11:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions. [2023-09-01 06:11:01,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46045454545454545 [2023-09-01 06:11:01,895 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions. [2023-09-01 06:11:01,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions. [2023-09-01 06:11:01,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:11:01,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions. [2023-09-01 06:11:01,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.0909090909091) internal successors, (1013), 11 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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 06:11:01,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:11:01,899 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:11:01,899 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 1702 flow. Second operand 11 states and 1013 transitions. [2023-09-01 06:11:01,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 162 transitions, 2233 flow [2023-09-01 06:11:01,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 162 transitions, 2154 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-09-01 06:11:01,919 INFO L231 Difference]: Finished difference. Result has 140 places, 130 transitions, 1695 flow [2023-09-01 06:11:01,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1695, PETRI_PLACES=140, PETRI_TRANSITIONS=130} [2023-09-01 06:11:01,919 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2023-09-01 06:11:01,920 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 1695 flow [2023-09-01 06:11:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 06:11:01,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:11:01,920 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:11:01,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-09-01 06:11:01,920 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:11:01,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:11:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash -124884211, now seen corresponding path program 1 times [2023-09-01 06:11:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:11:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264864946] [2023-09-01 06:11:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:11:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:11:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264864946] [2023-09-01 06:11:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264864946] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:11:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958812341] [2023-09-01 06:11:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:11:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:11:02,106 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 06:11:02,108 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 06:11:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:02,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-09-01 06:11:02,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:11:02,198 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 7 treesize of output 6 [2023-09-01 06:11:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:11:02,245 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 13 treesize of output 15 [2023-09-01 06:11:02,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-09-01 06:11:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:05,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:11:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958812341] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:11:09,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:11:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-09-01 06:11:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163233394] [2023-09-01 06:11:09,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:11:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 06:11:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 06:11:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=267, Unknown=10, NotChecked=0, Total=380 [2023-09-01 06:11:13,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:14,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:16,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:17,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:18,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:20,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:23,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:25,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:26,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:27,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:28,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:29,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:30,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 200 [2023-09-01 06:11:30,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 130 transitions, 1695 flow. Second operand has 20 states, 20 states have (on average 68.55) internal successors, (1371), 20 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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 06:11:30,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:11:30,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 200 [2023-09-01 06:11:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:11:32,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:34,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:38,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:40,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:41,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:43,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:45,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:47,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:48,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:49,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:53,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:54,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:59,638 INFO L130 PetriNetUnfolder]: 488/1069 cut-off events. [2023-09-01 06:11:59,638 INFO L131 PetriNetUnfolder]: For 10882/10882 co-relation queries the response was YES. [2023-09-01 06:11:59,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 1069 events. 488/1069 cut-off events. For 10882/10882 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6110 event pairs, 90 based on Foata normal form. 28/1003 useless extension candidates. Maximal degree in co-relation 6253. Up to 650 conditions per place. [2023-09-01 06:11:59,647 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 139 selfloop transitions, 90 changer transitions 0/229 dead transitions. [2023-09-01 06:11:59,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 229 transitions, 3139 flow [2023-09-01 06:11:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-01 06:11:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-09-01 06:11:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1060 transitions. [2023-09-01 06:11:59,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2023-09-01 06:11:59,649 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1060 transitions. [2023-09-01 06:11:59,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1060 transitions. [2023-09-01 06:11:59,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:11:59,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1060 transitions. [2023-09-01 06:11:59,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.71428571428571) internal successors, (1060), 14 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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 06:11:59,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 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 06:11:59,654 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 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 06:11:59,654 INFO L175 Difference]: Start difference. First operand has 140 places, 130 transitions, 1695 flow. Second operand 14 states and 1060 transitions. [2023-09-01 06:11:59,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 229 transitions, 3139 flow [2023-09-01 06:11:59,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 229 transitions, 3012 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-09-01 06:11:59,673 INFO L231 Difference]: Finished difference. Result has 152 places, 164 transitions, 2437 flow [2023-09-01 06:11:59,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2437, PETRI_PLACES=152, PETRI_TRANSITIONS=164} [2023-09-01 06:11:59,674 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2023-09-01 06:11:59,674 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 164 transitions, 2437 flow [2023-09-01 06:11:59,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 68.55) internal successors, (1371), 20 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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 06:11:59,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:11:59,675 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:11:59,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 06:11:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:11:59,880 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:11:59,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:11:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1133195322, now seen corresponding path program 1 times [2023-09-01 06:11:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:11:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334628539] [2023-09-01 06:11:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:11:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:12:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:12:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:12:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334628539] [2023-09-01 06:12:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334628539] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:12:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089406038] [2023-09-01 06:12:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:12:00,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:12:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:12:00,089 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 06:12:00,125 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 06:12:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:12:00,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-09-01 06:12:00,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:12:00,197 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 7 treesize of output 6 [2023-09-01 06:12:00,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:12:00,243 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 13 treesize of output 15 [2023-09-01 06:12:00,286 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 18 treesize of output 13 [2023-09-01 06:12:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:12:03,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:12:07,696 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (v_ArrVal_662 Int) (v_ArrVal_661 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_661) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_662) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 2147483647))) is different from false [2023-09-01 06:12:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:12:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089406038] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:12:07,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:12:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-09-01 06:12:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953896009] [2023-09-01 06:12:07,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:12:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 06:12:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:12:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 06:12:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=216, Unknown=6, NotChecked=32, Total=342 [2023-09-01 06:12:09,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:10,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:11,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:13,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:14,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:15,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:17,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:19,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:20,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:21,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:23,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:24,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:25,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:26,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:27,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:29,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:31,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:32,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:33,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:34,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:34,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 200 [2023-09-01 06:12:34,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 164 transitions, 2437 flow. Second operand has 19 states, 19 states have (on average 75.63157894736842) internal successors, (1437), 19 states have internal predecessors, (1437), 0 states have call successors, (0), 0 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 06:12:34,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:12:34,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 200 [2023-09-01 06:12:34,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:12:36,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:37,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:39,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:40,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:41,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:43,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:45,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:48,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:49,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:50,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:51,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:53,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:56,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:59,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:59,616 INFO L130 PetriNetUnfolder]: 504/1095 cut-off events. [2023-09-01 06:12:59,616 INFO L131 PetriNetUnfolder]: For 13499/13499 co-relation queries the response was YES. [2023-09-01 06:12:59,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7129 conditions, 1095 events. 504/1095 cut-off events. For 13499/13499 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6261 event pairs, 108 based on Foata normal form. 35/1054 useless extension candidates. Maximal degree in co-relation 7059. Up to 682 conditions per place. [2023-09-01 06:12:59,629 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 146 selfloop transitions, 110 changer transitions 0/256 dead transitions. [2023-09-01 06:12:59,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 256 transitions, 4044 flow [2023-09-01 06:12:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:12:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:12:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 915 transitions. [2023-09-01 06:12:59,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2023-09-01 06:12:59,637 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 915 transitions. [2023-09-01 06:12:59,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 915 transitions. [2023-09-01 06:12:59,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:12:59,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 915 transitions. [2023-09-01 06:12:59,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.18181818181819) internal successors, (915), 11 states have internal predecessors, (915), 0 states have call successors, (0), 0 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 06:12:59,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:12:59,645 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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 06:12:59,645 INFO L175 Difference]: Start difference. First operand has 152 places, 164 transitions, 2437 flow. Second operand 11 states and 915 transitions. [2023-09-01 06:12:59,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 256 transitions, 4044 flow [2023-09-01 06:12:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 256 transitions, 3682 flow, removed 158 selfloop flow, removed 5 redundant places. [2023-09-01 06:12:59,695 INFO L231 Difference]: Finished difference. Result has 163 places, 204 transitions, 3222 flow [2023-09-01 06:12:59,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3222, PETRI_PLACES=163, PETRI_TRANSITIONS=204} [2023-09-01 06:12:59,696 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-09-01 06:12:59,696 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 204 transitions, 3222 flow [2023-09-01 06:12:59,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.63157894736842) internal successors, (1437), 19 states have internal predecessors, (1437), 0 states have call successors, (0), 0 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 06:12:59,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:12:59,697 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:12:59,715 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 06:12:59,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:12:59,904 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:12:59,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:12:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 245377895, now seen corresponding path program 1 times [2023-09-01 06:12:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:12:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254169736] [2023-09-01 06:12:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:12:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:12:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:12:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:12:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:12:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254169736] [2023-09-01 06:12:59,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254169736] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:12:59,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:12:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:12:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906588674] [2023-09-01 06:12:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:12:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:12:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:12:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:12:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:12:59,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-09-01 06:12:59,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 204 transitions, 3222 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 06:12:59,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:12:59,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-09-01 06:12:59,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:00,182 INFO L130 PetriNetUnfolder]: 486/1055 cut-off events. [2023-09-01 06:13:00,182 INFO L131 PetriNetUnfolder]: For 13385/13385 co-relation queries the response was YES. [2023-09-01 06:13:00,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 1055 events. 486/1055 cut-off events. For 13385/13385 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5915 event pairs, 182 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 7147. Up to 1024 conditions per place. [2023-09-01 06:13:00,195 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 217 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2023-09-01 06:13:00,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 218 transitions, 3807 flow [2023-09-01 06:13:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-09-01 06:13:00,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-09-01 06:13:00,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-09-01 06:13:00,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-09-01 06:13:00,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:00,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-09-01 06:13:00,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 06:13:00,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,199 INFO L175 Difference]: Start difference. First operand has 163 places, 204 transitions, 3222 flow. Second operand 3 states and 323 transitions. [2023-09-01 06:13:00,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 218 transitions, 3807 flow [2023-09-01 06:13:00,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 218 transitions, 3715 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-09-01 06:13:00,279 INFO L231 Difference]: Finished difference. Result has 162 places, 203 transitions, 3143 flow [2023-09-01 06:13:00,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3141, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3143, PETRI_PLACES=162, PETRI_TRANSITIONS=203} [2023-09-01 06:13:00,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2023-09-01 06:13:00,280 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 203 transitions, 3143 flow [2023-09-01 06:13:00,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 06:13:00,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:00,281 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:00,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 06:13:00,281 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:00,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 245377907, now seen corresponding path program 1 times [2023-09-01 06:13:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211471827] [2023-09-01 06:13:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-09-01 06:13:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211471827] [2023-09-01 06:13:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211471827] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:00,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962826676] [2023-09-01 06:13:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:00,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:00,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:00,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-09-01 06:13:00,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 203 transitions, 3143 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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 06:13:00,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:00,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-09-01 06:13:00,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:00,523 INFO L130 PetriNetUnfolder]: 468/1015 cut-off events. [2023-09-01 06:13:00,523 INFO L131 PetriNetUnfolder]: For 11963/11963 co-relation queries the response was YES. [2023-09-01 06:13:00,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 1015 events. 468/1015 cut-off events. For 11963/11963 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5648 event pairs, 152 based on Foata normal form. 22/1012 useless extension candidates. Maximal degree in co-relation 6731. Up to 601 conditions per place. [2023-09-01 06:13:00,532 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 216 selfloop transitions, 11 changer transitions 0/227 dead transitions. [2023-09-01 06:13:00,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 227 transitions, 3856 flow [2023-09-01 06:13:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-09-01 06:13:00,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2023-09-01 06:13:00,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-09-01 06:13:00,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-09-01 06:13:00,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:00,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-09-01 06:13:00,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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 06:13:00,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,537 INFO L175 Difference]: Start difference. First operand has 162 places, 203 transitions, 3143 flow. Second operand 3 states and 321 transitions. [2023-09-01 06:13:00,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 227 transitions, 3856 flow [2023-09-01 06:13:00,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 227 transitions, 3853 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:00,568 INFO L231 Difference]: Finished difference. Result has 163 places, 203 transitions, 3177 flow [2023-09-01 06:13:00,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3177, PETRI_PLACES=163, PETRI_TRANSITIONS=203} [2023-09-01 06:13:00,569 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-09-01 06:13:00,569 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 203 transitions, 3177 flow [2023-09-01 06:13:00,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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 06:13:00,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:00,570 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:00,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-09-01 06:13:00,570 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:00,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998744, now seen corresponding path program 1 times [2023-09-01 06:13:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573841922] [2023-09-01 06:13:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-09-01 06:13:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573841922] [2023-09-01 06:13:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573841922] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043515352] [2023-09-01 06:13:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:00,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-09-01 06:13:00,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 203 transitions, 3177 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 06:13:00,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:00,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-09-01 06:13:00,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:00,808 INFO L130 PetriNetUnfolder]: 447/969 cut-off events. [2023-09-01 06:13:00,808 INFO L131 PetriNetUnfolder]: For 11805/11805 co-relation queries the response was YES. [2023-09-01 06:13:00,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 969 events. 447/969 cut-off events. For 11805/11805 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5387 event pairs, 108 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 6665. Up to 774 conditions per place. [2023-09-01 06:13:00,816 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 221 selfloop transitions, 12 changer transitions 0/233 dead transitions. [2023-09-01 06:13:00,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 3964 flow [2023-09-01 06:13:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-09-01 06:13:00,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-09-01 06:13:00,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-09-01 06:13:00,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-09-01 06:13:00,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:00,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-09-01 06:13:00,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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 06:13:00,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:00,819 INFO L175 Difference]: Start difference. First operand has 163 places, 203 transitions, 3177 flow. Second operand 3 states and 326 transitions. [2023-09-01 06:13:00,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 233 transitions, 3964 flow [2023-09-01 06:13:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 233 transitions, 3945 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:00,847 INFO L231 Difference]: Finished difference. Result has 164 places, 203 transitions, 3208 flow [2023-09-01 06:13:00,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3208, PETRI_PLACES=164, PETRI_TRANSITIONS=203} [2023-09-01 06:13:00,848 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-09-01 06:13:00,848 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 3208 flow [2023-09-01 06:13:00,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 06:13:00,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:00,848 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:00,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 06:13:00,848 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:00,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998742, now seen corresponding path program 1 times [2023-09-01 06:13:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043428453] [2023-09-01 06:13:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043428453] [2023-09-01 06:13:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043428453] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638215460] [2023-09-01 06:13:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:00,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:00,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-09-01 06:13:00,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 203 transitions, 3208 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 06:13:00,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:00,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-09-01 06:13:00,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:01,063 INFO L130 PetriNetUnfolder]: 426/923 cut-off events. [2023-09-01 06:13:01,063 INFO L131 PetriNetUnfolder]: For 11742/11742 co-relation queries the response was YES. [2023-09-01 06:13:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 923 events. 426/923 cut-off events. For 11742/11742 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5002 event pairs, 126 based on Foata normal form. 25/948 useless extension candidates. Maximal degree in co-relation 6583. Up to 887 conditions per place. [2023-09-01 06:13:01,071 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 220 selfloop transitions, 1 changer transitions 0/221 dead transitions. [2023-09-01 06:13:01,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 221 transitions, 3818 flow [2023-09-01 06:13:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-09-01 06:13:01,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-09-01 06:13:01,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-09-01 06:13:01,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-09-01 06:13:01,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:01,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-09-01 06:13:01,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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 06:13:01,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:01,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 06:13:01,074 INFO L175 Difference]: Start difference. First operand has 164 places, 203 transitions, 3208 flow. Second operand 3 states and 326 transitions. [2023-09-01 06:13:01,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 221 transitions, 3818 flow [2023-09-01 06:13:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 221 transitions, 3804 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:01,108 INFO L231 Difference]: Finished difference. Result has 164 places, 202 transitions, 3192 flow [2023-09-01 06:13:01,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3190, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3192, PETRI_PLACES=164, PETRI_TRANSITIONS=202} [2023-09-01 06:13:01,109 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-09-01 06:13:01,109 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 3192 flow [2023-09-01 06:13:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 06:13:01,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:01,110 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:01,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-09-01 06:13:01,110 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:01,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1309607972, now seen corresponding path program 1 times [2023-09-01 06:13:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171393727] [2023-09-01 06:13:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171393727] [2023-09-01 06:13:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171393727] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461859198] [2023-09-01 06:13:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:01,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:01,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:01,157 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 06:13:01,185 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 06:13:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:01,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 06:13:01,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:01,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:13:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461859198] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:13:01,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:13:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 06:13:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29782910] [2023-09-01 06:13:01,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:13:01,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 06:13:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:01,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 06:13:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 06:13:01,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-09-01 06:13:01,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 3192 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 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 06:13:01,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:01,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-09-01 06:13:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:01,590 INFO L130 PetriNetUnfolder]: 569/1276 cut-off events. [2023-09-01 06:13:01,591 INFO L131 PetriNetUnfolder]: For 18036/18036 co-relation queries the response was YES. [2023-09-01 06:13:01,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9246 conditions, 1276 events. 569/1276 cut-off events. For 18036/18036 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6757 event pairs, 49 based on Foata normal form. 61/1337 useless extension candidates. Maximal degree in co-relation 9168. Up to 287 conditions per place. [2023-09-01 06:13:01,603 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 299 selfloop transitions, 14 changer transitions 0/313 dead transitions. [2023-09-01 06:13:01,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 313 transitions, 5423 flow [2023-09-01 06:13:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 06:13:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 06:13:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-09-01 06:13:01,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358333333333334 [2023-09-01 06:13:01,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-09-01 06:13:01,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-09-01 06:13:01,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:01,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-09-01 06:13:01,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 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 06:13:01,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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 06:13:01,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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 06:13:01,608 INFO L175 Difference]: Start difference. First operand has 164 places, 202 transitions, 3192 flow. Second operand 6 states and 643 transitions. [2023-09-01 06:13:01,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 313 transitions, 5423 flow [2023-09-01 06:13:01,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 313 transitions, 5372 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 06:13:01,652 INFO L231 Difference]: Finished difference. Result has 170 places, 199 transitions, 3091 flow [2023-09-01 06:13:01,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=2983, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3091, PETRI_PLACES=170, PETRI_TRANSITIONS=199} [2023-09-01 06:13:01,653 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2023-09-01 06:13:01,653 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 199 transitions, 3091 flow [2023-09-01 06:13:01,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 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 06:13:01,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:01,653 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:01,672 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 06:13:01,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:01,860 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:01,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -755877912, now seen corresponding path program 1 times [2023-09-01 06:13:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:01,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938687465] [2023-09-01 06:13:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:02,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938687465] [2023-09-01 06:13:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938687465] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114685818] [2023-09-01 06:13:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:02,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:02,185 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 06:13:02,233 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 06:13:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:02,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:13:02,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:02,335 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 7 treesize of output 6 [2023-09-01 06:13:02,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:13:02,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-09-01 06:13:02,548 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 18 treesize of output 13 [2023-09-01 06:13:02,708 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 21 treesize of output 16 [2023-09-01 06:13:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:02,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:13:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114685818] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:13:07,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:13:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:13:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529172250] [2023-09-01 06:13:07,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:13:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:13:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:07,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:13:07,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=775, Unknown=6, NotChecked=0, Total=930 [2023-09-01 06:13:08,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-09-01 06:13:08,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 199 transitions, 3091 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:13:08,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:08,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-09-01 06:13:08,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:09,637 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_962 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_962) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (v_ArrVal_965 Int) (v_ArrVal_961 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_961) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_965 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_962)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647)))) is different from false [2023-09-01 06:13:10,794 INFO L130 PetriNetUnfolder]: 682/1540 cut-off events. [2023-09-01 06:13:10,794 INFO L131 PetriNetUnfolder]: For 24670/24670 co-relation queries the response was YES. [2023-09-01 06:13:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11651 conditions, 1540 events. 682/1540 cut-off events. For 24670/24670 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9016 event pairs, 120 based on Foata normal form. 19/1559 useless extension candidates. Maximal degree in co-relation 11572. Up to 886 conditions per place. [2023-09-01 06:13:10,808 INFO L137 encePairwiseOnDemand]: 186/200 looper letters, 192 selfloop transitions, 181 changer transitions 0/373 dead transitions. [2023-09-01 06:13:10,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 373 transitions, 6435 flow [2023-09-01 06:13:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-01 06:13:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-09-01 06:13:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1805 transitions. [2023-09-01 06:13:10,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3471153846153846 [2023-09-01 06:13:10,811 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1805 transitions. [2023-09-01 06:13:10,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1805 transitions. [2023-09-01 06:13:10,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:10,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1805 transitions. [2023-09-01 06:13:10,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 69.42307692307692) internal successors, (1805), 26 states have internal predecessors, (1805), 0 states have call successors, (0), 0 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 06:13:10,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 200.0) internal successors, (5400), 27 states have internal predecessors, (5400), 0 states have call successors, (0), 0 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 06:13:10,818 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 200.0) internal successors, (5400), 27 states have internal predecessors, (5400), 0 states have call successors, (0), 0 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 06:13:10,818 INFO L175 Difference]: Start difference. First operand has 170 places, 199 transitions, 3091 flow. Second operand 26 states and 1805 transitions. [2023-09-01 06:13:10,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 373 transitions, 6435 flow [2023-09-01 06:13:10,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 373 transitions, 6399 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:10,870 INFO L231 Difference]: Finished difference. Result has 208 places, 282 transitions, 5312 flow [2023-09-01 06:13:10,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3079, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5312, PETRI_PLACES=208, PETRI_TRANSITIONS=282} [2023-09-01 06:13:10,871 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2023-09-01 06:13:10,871 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 282 transitions, 5312 flow [2023-09-01 06:13:10,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:13:10,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:10,872 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:10,891 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 06:13:11,077 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,SelfDestructingSolverStorable26 [2023-09-01 06:13:11,078 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:13:11,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash -445377907, now seen corresponding path program 1 times [2023-09-01 06:13:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:11,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596191383] [2023-09-01 06:13:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:11,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:11,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596191383] [2023-09-01 06:13:11,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596191383] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:11,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273169567] [2023-09-01 06:13:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:11,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:11,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:11,435 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 06:13:11,454 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 06:13:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:11,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:13:11,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:11,561 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 7 treesize of output 6 [2023-09-01 06:13:11,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:13:11,640 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 13 treesize of output 15 [2023-09-01 06:13:11,757 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 18 treesize of output 13 [2023-09-01 06:13:11,846 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 21 treesize of output 16 [2023-09-01 06:13:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:11,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:13:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273169567] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:13:14,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:13:14,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-09-01 06:13:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166951875] [2023-09-01 06:13:14,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:13:14,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:13:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:13:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=778, Unknown=7, NotChecked=0, Total=930 [2023-09-01 06:13:16,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-09-01 06:13:16,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 282 transitions, 5312 flow. Second operand has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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 06:13:16,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:16,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-09-01 06:13:16,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:16,355 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))))) is different from false [2023-09-01 06:13:16,458 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))))) is different from false [2023-09-01 06:13:22,876 WARN L222 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 71 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:13:59,525 WARN L222 SmtUtils]: Spent 36.45s on a formula simplification. DAG size of input: 94 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:14:01,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)))))) is different from false [2023-09-01 06:14:44,327 WARN L222 SmtUtils]: Spent 40.48s on a formula simplification. DAG size of input: 90 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:14:46,340 WARN L539 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 06:14:48,351 WARN L539 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 06:14:50,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:14:52,363 WARN L539 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 06:14:54,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:14:56,372 WARN L539 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 06:14:56,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1042 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))))) is different from false [2023-09-01 06:14:58,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:15:00,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:15:02,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 06:15:04,890 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 06:15:06,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:15:08,919 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 06:15:10,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:15:12,951 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 06:15:14,962 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 06:15:16,970 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 06:15:19,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 [0, 1] [2023-09-01 06:15:21,939 WARN L539 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 06:15:51,343 WARN L222 SmtUtils]: Spent 29.27s on a formula simplification. DAG size of input: 89 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:15:53,351 WARN L539 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 06:15:55,357 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 06:15:57,371 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 06:15:59,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:01,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:03,416 WARN L539 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 06:16:05,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:05,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1)) (.cse0 (+ .cse10 |c_~#cache~0.offset|)) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse9 (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))) (.cse8 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse10 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (= .cse1 (store .cse2 .cse3 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse4) (< 0 (+ 2147483650 (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= .cse1 (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (or (= .cse1 .cse2) (<= (+ .cse3 28) .cse0)) (exists ((v_ArrVal_1042 Int)) (= (store .cse1 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (or (and .cse7 (= (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse8) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) .cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) .cse9 (or (and .cse7 .cse9) (not .cse8)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse4) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse4)))))) is different from false [2023-09-01 06:16:07,463 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 06:16:07,495 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2) (< 0 (+ 2147483650 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2)))))) is different from false [2023-09-01 06:16:10,491 WARN L539 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 06:16:12,501 WARN L539 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 06:16:14,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:16,516 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 06:16:18,522 WARN L539 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 06:16:20,529 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 06:16:22,534 WARN L539 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 06:16:26,086 WARN L539 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 06:16:28,093 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 06:16:30,104 WARN L539 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 06:16:32,997 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 06:16:41,718 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 06:16:45,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:16:46,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:16:48,914 WARN L539 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 06:16:51,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:16:53,757 WARN L539 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 06:16:59,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:17:04,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:17:04,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ 2147483650 (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1045 Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))))) is different from false [2023-09-01 06:17:16,406 WARN L539 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 06:17:16,577 INFO L130 PetriNetUnfolder]: 1701/3742 cut-off events. [2023-09-01 06:17:16,578 INFO L131 PetriNetUnfolder]: For 93768/93768 co-relation queries the response was YES. [2023-09-01 06:17:16,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32420 conditions, 3742 events. 1701/3742 cut-off events. For 93768/93768 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 26811 event pairs, 251 based on Foata normal form. 95/3837 useless extension candidates. Maximal degree in co-relation 32325. Up to 1359 conditions per place. [2023-09-01 06:17:16,637 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 453 selfloop transitions, 510 changer transitions 0/963 dead transitions. [2023-09-01 06:17:16,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 963 transitions, 18303 flow [2023-09-01 06:17:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-09-01 06:17:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-09-01 06:17:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 5800 transitions. [2023-09-01 06:17:16,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2023-09-01 06:17:16,646 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 5800 transitions. [2023-09-01 06:17:16,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 5800 transitions. [2023-09-01 06:17:16,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:17:16,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 5800 transitions. [2023-09-01 06:17:16,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 62.365591397849464) internal successors, (5800), 93 states have internal predecessors, (5800), 0 states have call successors, (0), 0 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 06:17:16,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 200.0) internal successors, (18800), 94 states have internal predecessors, (18800), 0 states have call successors, (0), 0 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 06:17:16,672 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 200.0) internal successors, (18800), 94 states have internal predecessors, (18800), 0 states have call successors, (0), 0 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 06:17:16,672 INFO L175 Difference]: Start difference. First operand has 208 places, 282 transitions, 5312 flow. Second operand 93 states and 5800 transitions. [2023-09-01 06:17:16,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 963 transitions, 18303 flow [2023-09-01 06:17:16,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 963 transitions, 17700 flow, removed 262 selfloop flow, removed 3 redundant places. [2023-09-01 06:17:16,899 INFO L231 Difference]: Finished difference. Result has 345 places, 725 transitions, 14733 flow [2023-09-01 06:17:16,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=4920, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=14733, PETRI_PLACES=345, PETRI_TRANSITIONS=725} [2023-09-01 06:17:16,905 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 313 predicate places. [2023-09-01 06:17:16,905 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 725 transitions, 14733 flow [2023-09-01 06:17:16,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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 06:17:16,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:17:16,917 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:17:16,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-01 06:17:17,122 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,SelfDestructingSolverStorable27 [2023-09-01 06:17:17,122 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:17:17,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:17:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash -440057652, now seen corresponding path program 2 times [2023-09-01 06:17:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:17:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133501142] [2023-09-01 06:17:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:17:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:17:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:17:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:17:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:17:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133501142] [2023-09-01 06:17:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133501142] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:17:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316886419] [2023-09-01 06:17:17,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:17:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:17:17,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:17:17,577 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 06:17:17,587 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 06:17:17,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:17:17,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:17:17,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:17:17,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:17:17,706 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 7 treesize of output 6 [2023-09-01 06:17:17,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:17:17,800 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 13 treesize of output 15 [2023-09-01 06:17:17,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-09-01 06:17:18,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-09-01 06:17:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:17:18,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:17:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:17:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316886419] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:17:18,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:17:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:17:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805882903] [2023-09-01 06:17:18,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:17:18,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:17:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:17:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:17:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=745, Unknown=5, NotChecked=0, Total=930 [2023-09-01 06:17:19,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-09-01 06:17:19,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 725 transitions, 14733 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:17:19,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:17:19,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-09-01 06:17:19,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:17:20,277 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1125 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) is different from false [2023-09-01 06:17:22,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:17:26,281 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1125 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))))) is different from false [2023-09-01 06:17:27,150 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1122 Int) (v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1122)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1125 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) is different from false [2023-09-01 06:17:27,178 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1122 Int) (v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1122)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1122 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1122) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:17:51,188 WARN L222 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:17:55,855 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse3 (select |c_#memory_int| 1))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1122 Int) (v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1122)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1122 Int)) (= (store .cse2 0 v_ArrVal_1122) .cse3)) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1125 Int)) (= (store .cse2 0 v_ArrVal_1125) .cse3)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:18:02,228 WARN L539 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 06:18:04,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:18:04,418 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (@diff .cse5 .cse4)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse7 (+ .cse3 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1122 Int) (v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1122)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse3 28 |c_~#cache~0.offset|)))) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= .cse4 (store .cse5 .cse6 0)) (or (<= (+ .cse6 28) .cse7) (= .cse4 .cse5)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1125 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) .cse7)))) is different from false [2023-09-01 06:18:07,175 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (@diff .cse5 .cse4)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse7 (+ .cse3 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0))) (forall ((v_ArrVal_1122 Int) (v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1122)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse3 28 |c_~#cache~0.offset|)))) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= .cse4 (store .cse5 .cse6 0)) (or (<= (+ .cse6 28) .cse7) (= .cse4 .cse5)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1125 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| .cse0) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1125)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) .cse7)))) is different from false [2023-09-01 06:18:09,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 06:18:37,063 WARN L539 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 06:18:50,824 INFO L130 PetriNetUnfolder]: 2062/4536 cut-off events. [2023-09-01 06:18:50,825 INFO L131 PetriNetUnfolder]: For 262494/262494 co-relation queries the response was YES. [2023-09-01 06:18:50,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 4536 events. 2062/4536 cut-off events. For 262494/262494 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 34407 event pairs, 325 based on Foata normal form. 97/4633 useless extension candidates. Maximal degree in co-relation 51556. Up to 2891 conditions per place. [2023-09-01 06:18:50,955 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 628 selfloop transitions, 734 changer transitions 0/1362 dead transitions. [2023-09-01 06:18:50,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1362 transitions, 31621 flow [2023-09-01 06:18:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-09-01 06:18:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-09-01 06:18:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 5555 transitions. [2023-09-01 06:18:50,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.338719512195122 [2023-09-01 06:18:50,965 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 5555 transitions. [2023-09-01 06:18:50,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 5555 transitions. [2023-09-01 06:18:50,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:18:50,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 5555 transitions. [2023-09-01 06:18:50,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 67.7439024390244) internal successors, (5555), 82 states have internal predecessors, (5555), 0 states have call successors, (0), 0 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 06:18:51,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 200.0) internal successors, (16600), 83 states have internal predecessors, (16600), 0 states have call successors, (0), 0 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 06:18:51,023 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 200.0) internal successors, (16600), 83 states have internal predecessors, (16600), 0 states have call successors, (0), 0 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 06:18:51,023 INFO L175 Difference]: Start difference. First operand has 345 places, 725 transitions, 14733 flow. Second operand 82 states and 5555 transitions. [2023-09-01 06:18:51,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 1362 transitions, 31621 flow [2023-09-01 06:18:52,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 1362 transitions, 28478 flow, removed 1554 selfloop flow, removed 3 redundant places. [2023-09-01 06:18:52,459 INFO L231 Difference]: Finished difference. Result has 471 places, 1172 transitions, 25635 flow [2023-09-01 06:18:52,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=12909, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=25635, PETRI_PLACES=471, PETRI_TRANSITIONS=1172} [2023-09-01 06:18:52,463 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 439 predicate places. [2023-09-01 06:18:52,463 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 1172 transitions, 25635 flow [2023-09-01 06:18:52,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:18:52,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:18:52,464 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:18:52,469 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 06:18:52,673 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,SelfDestructingSolverStorable28 [2023-09-01 06:18:52,673 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:18:52,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:18:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash -610735556, now seen corresponding path program 1 times [2023-09-01 06:18:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:18:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440865964] [2023-09-01 06:18:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:18:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:18:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:18:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:18:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:18:53,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440865964] [2023-09-01 06:18:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440865964] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:18:53,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948520443] [2023-09-01 06:18:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:18:53,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:18:53,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:18:53,074 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 06:18:53,076 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 06:18:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:18:53,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:18:53,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:18:53,189 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 7 treesize of output 6 [2023-09-01 06:18:53,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:18:53,282 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 13 treesize of output 15 [2023-09-01 06:18:53,406 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 18 treesize of output 13 [2023-09-01 06:18:53,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-09-01 06:18:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:18:53,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:18:53,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_1201 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1204 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1201) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1204) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44|) 2147483647))) is different from false [2023-09-01 06:18:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:18:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948520443] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:18:54,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:18:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-09-01 06:18:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554285272] [2023-09-01 06:18:54,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:18:54,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 06:18:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:18:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 06:18:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=774, Unknown=1, NotChecked=58, Total=992 [2023-09-01 06:18:54,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-09-01 06:18:54,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1172 transitions, 25635 flow. Second operand has 32 states, 32 states have (on average 64.40625) internal successors, (2061), 32 states have internal predecessors, (2061), 0 states have call successors, (0), 0 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 06:18:54,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:18:54,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-09-01 06:18:54,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:19:09,508 INFO L130 PetriNetUnfolder]: 2965/6551 cut-off events. [2023-09-01 06:19:09,509 INFO L131 PetriNetUnfolder]: For 676922/676922 co-relation queries the response was YES. [2023-09-01 06:19:09,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87402 conditions, 6551 events. 2965/6551 cut-off events. For 676922/676922 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 53185 event pairs, 306 based on Foata normal form. 240/6791 useless extension candidates. Maximal degree in co-relation 87207. Up to 1903 conditions per place. [2023-09-01 06:19:09,617 INFO L137 encePairwiseOnDemand]: 184/200 looper letters, 826 selfloop transitions, 1230 changer transitions 0/2056 dead transitions. [2023-09-01 06:19:09,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2056 transitions, 49737 flow [2023-09-01 06:19:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-09-01 06:19:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-09-01 06:19:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4432 transitions. [2023-09-01 06:19:09,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34092307692307694 [2023-09-01 06:19:09,629 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 4432 transitions. [2023-09-01 06:19:09,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 4432 transitions. [2023-09-01 06:19:09,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:19:09,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 4432 transitions. [2023-09-01 06:19:09,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 68.18461538461538) internal successors, (4432), 65 states have internal predecessors, (4432), 0 states have call successors, (0), 0 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 06:19:09,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 200.0) internal successors, (13200), 66 states have internal predecessors, (13200), 0 states have call successors, (0), 0 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 06:19:09,645 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 200.0) internal successors, (13200), 66 states have internal predecessors, (13200), 0 states have call successors, (0), 0 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 06:19:09,645 INFO L175 Difference]: Start difference. First operand has 471 places, 1172 transitions, 25635 flow. Second operand 65 states and 4432 transitions. [2023-09-01 06:19:09,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2056 transitions, 49737 flow [2023-09-01 06:19:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 2056 transitions, 46658 flow, removed 1468 selfloop flow, removed 16 redundant places. [2023-09-01 06:19:14,376 INFO L231 Difference]: Finished difference. Result has 560 places, 1766 transitions, 42300 flow [2023-09-01 06:19:14,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=22194, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=654, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=42300, PETRI_PLACES=560, PETRI_TRANSITIONS=1766} [2023-09-01 06:19:14,377 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 528 predicate places. [2023-09-01 06:19:14,378 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 1766 transitions, 42300 flow [2023-09-01 06:19:14,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 64.40625) internal successors, (2061), 32 states have internal predecessors, (2061), 0 states have call successors, (0), 0 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 06:19:14,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:19:14,378 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:19:14,384 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 06:19:14,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:19:14,580 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:19:14,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:19:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1935379416, now seen corresponding path program 1 times [2023-09-01 06:19:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:19:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865614067] [2023-09-01 06:19:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:19:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:19:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:19:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:19:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:19:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865614067] [2023-09-01 06:19:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865614067] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:19:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551007857] [2023-09-01 06:19:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:19:15,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:19:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:19:15,092 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 06:19:15,094 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 06:19:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:19:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:19:15,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:19:15,210 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 7 treesize of output 6 [2023-09-01 06:19:15,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:19:15,301 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 13 treesize of output 15 [2023-09-01 06:19:15,476 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 18 treesize of output 13 [2023-09-01 06:19:15,531 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 21 treesize of output 16 [2023-09-01 06:19:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:19:15,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:19:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:19:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551007857] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:19:18,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:19:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-09-01 06:19:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625902567] [2023-09-01 06:19:18,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:19:18,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 06:19:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:19:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 06:19:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=845, Unknown=10, NotChecked=0, Total=1056 [2023-09-01 06:19:18,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-09-01 06:19:18,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 1766 transitions, 42300 flow. Second operand has 33 states, 33 states have (on average 58.36363636363637) internal successors, (1926), 33 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 06:19:18,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:19:18,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-09-01 06:19:18,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:19:25,650 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))))) is different from false [2023-09-01 06:19:31,088 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1284 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1284) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1284)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|) 2147483650)))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:19:44,059 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse3) (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1282) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (or (= .cse0 .cse1) (and (<= .cse2 |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1284))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1284 Int)) (= (store .cse0 0 v_ArrVal_1284) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse3) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse3) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 0 (+ (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))))) is different from false [2023-09-01 06:19:49,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:19:52,206 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1282) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1284))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1284 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1284) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2023-09-01 06:19:57,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:19:59,146 WARN L539 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 06:20:00,220 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse5 (+ 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= .cse0 (store .cse1 .cse2 0)) (or (= .cse0 .cse1) (and (<= .cse2 |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1284))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1284 Int)) (= (store .cse0 0 v_ArrVal_1284) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse5) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse5) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 0 (+ (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))))) is different from false [2023-09-01 06:20:04,713 WARN L539 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 06:20:06,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:20:14,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:20:21,271 WARN L539 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 06:20:22,159 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (store .cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1282) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ .cse2 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1284))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1281) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< 0 (+ 2147483650 (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ .cse2 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1282 Int) (v_ArrVal_1284 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1282)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1284) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (<= 0 (+ (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))) is different from false [2023-09-01 06:20:25,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:20:36,254 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 [1] [2023-09-01 06:20:45,699 INFO L130 PetriNetUnfolder]: 3751/8333 cut-off events. [2023-09-01 06:20:45,699 INFO L131 PetriNetUnfolder]: For 996609/996609 co-relation queries the response was YES. [2023-09-01 06:20:45,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124757 conditions, 8333 events. 3751/8333 cut-off events. For 996609/996609 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 72610 event pairs, 265 based on Foata normal form. 172/8505 useless extension candidates. Maximal degree in co-relation 124522. Up to 4038 conditions per place. [2023-09-01 06:20:45,938 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 1365 selfloop transitions, 1851 changer transitions 0/3216 dead transitions. [2023-09-01 06:20:45,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 3216 transitions, 90447 flow [2023-09-01 06:20:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-09-01 06:20:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-09-01 06:20:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 5821 transitions. [2023-09-01 06:20:45,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30636842105263157 [2023-09-01 06:20:45,948 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 5821 transitions. [2023-09-01 06:20:45,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 5821 transitions. [2023-09-01 06:20:45,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:20:45,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 5821 transitions. [2023-09-01 06:20:45,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 61.27368421052632) internal successors, (5821), 95 states have internal predecessors, (5821), 0 states have call successors, (0), 0 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 06:20:45,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 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 06:20:45,972 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 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 06:20:45,972 INFO L175 Difference]: Start difference. First operand has 560 places, 1766 transitions, 42300 flow. Second operand 95 states and 5821 transitions. [2023-09-01 06:20:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 3216 transitions, 90447 flow [2023-09-01 06:21:00,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 3216 transitions, 80905 flow, removed 4729 selfloop flow, removed 12 redundant places. [2023-09-01 06:21:00,266 INFO L231 Difference]: Finished difference. Result has 687 places, 2687 transitions, 70069 flow [2023-09-01 06:21:00,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38267, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=70069, PETRI_PLACES=687, PETRI_TRANSITIONS=2687} [2023-09-01 06:21:00,268 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 655 predicate places. [2023-09-01 06:21:00,268 INFO L495 AbstractCegarLoop]: Abstraction has has 687 places, 2687 transitions, 70069 flow [2023-09-01 06:21:00,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 58.36363636363637) internal successors, (1926), 33 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 06:21:00,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:21:00,269 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:21:00,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-09-01 06:21:00,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:21:00,475 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:21:00,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:21:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash -112100257, now seen corresponding path program 2 times [2023-09-01 06:21:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:21:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008968591] [2023-09-01 06:21:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:21:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:21:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:21:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:21:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:21:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008968591] [2023-09-01 06:21:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008968591] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:21:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282467606] [2023-09-01 06:21:00,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:21:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:21:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:21:00,867 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 06:21:00,870 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 06:21:00,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:21:00,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:21:00,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:21:00,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:21:00,988 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 7 treesize of output 6 [2023-09-01 06:21:01,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:21:01,067 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 13 treesize of output 15 [2023-09-01 06:21:01,170 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 18 treesize of output 13 [2023-09-01 06:21:01,299 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 21 treesize of output 16 [2023-09-01 06:21:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:21:01,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:21:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:21:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282467606] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:21:01,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:21:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-09-01 06:21:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474609701] [2023-09-01 06:21:01,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:21:01,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:21:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:21:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:21:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=753, Unknown=8, NotChecked=0, Total=930 [2023-09-01 06:21:04,887 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 06:21:06,916 WARN L539 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 06:21:09,108 WARN L539 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 06:21:11,572 WARN L539 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 06:21:11,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-09-01 06:21:11,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 2687 transitions, 70069 flow. Second operand has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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 06:21:11,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:21:11,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-09-01 06:21:11,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:21:14,526 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1365 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1361 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1361) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1365 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))))) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1362)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-09-01 06:21:17,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1365 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1361 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1361) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1365 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0) (< 0 (+ 2147483650 (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 Int)) (let ((.cse2 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ .cse2 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (store .cse1 (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_1362) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483650))))))) is different from false [2023-09-01 06:21:18,418 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ .cse0 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 ((as const (Array Int Int)) 0))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1362)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1365 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1361 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1361) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= .cse3 (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1362)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1365) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|))))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_1362 Int)) (= (store .cse3 0 v_ArrVal_1362) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2023-09-01 06:21:25,280 WARN L539 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 06:21:55,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:21:59,704 INFO L130 PetriNetUnfolder]: 6029/13195 cut-off events. [2023-09-01 06:21:59,705 INFO L131 PetriNetUnfolder]: For 1124597/1124597 co-relation queries the response was YES. [2023-09-01 06:21:59,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188820 conditions, 13195 events. 6029/13195 cut-off events. For 1124597/1124597 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 119758 event pairs, 423 based on Foata normal form. 539/13734 useless extension candidates. Maximal degree in co-relation 188566. Up to 4605 conditions per place. [2023-09-01 06:22:00,138 INFO L137 encePairwiseOnDemand]: 182/200 looper letters, 1722 selfloop transitions, 2748 changer transitions 0/4470 dead transitions. [2023-09-01 06:22:00,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 4470 transitions, 128084 flow [2023-09-01 06:22:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-09-01 06:22:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-09-01 06:22:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 5240 transitions. [2023-09-01 06:22:00,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3156626506024096 [2023-09-01 06:22:00,143 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 5240 transitions. [2023-09-01 06:22:00,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 5240 transitions. [2023-09-01 06:22:00,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:22:00,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 5240 transitions. [2023-09-01 06:22:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 63.13253012048193) internal successors, (5240), 83 states have internal predecessors, (5240), 0 states have call successors, (0), 0 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 06:22:00,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 200.0) internal successors, (16800), 84 states have internal predecessors, (16800), 0 states have call successors, (0), 0 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 06:22:00,157 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 200.0) internal successors, (16800), 84 states have internal predecessors, (16800), 0 states have call successors, (0), 0 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 06:22:00,157 INFO L175 Difference]: Start difference. First operand has 687 places, 2687 transitions, 70069 flow. Second operand 83 states and 5240 transitions. [2023-09-01 06:22:00,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 4470 transitions, 128084 flow [2023-09-01 06:22:15,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 4470 transitions, 119274 flow, removed 4157 selfloop flow, removed 23 redundant places. [2023-09-01 06:22:15,116 INFO L231 Difference]: Finished difference. Result has 787 places, 3861 transitions, 106927 flow [2023-09-01 06:22:15,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=61549, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1624, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=106927, PETRI_PLACES=787, PETRI_TRANSITIONS=3861} [2023-09-01 06:22:15,119 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 755 predicate places. [2023-09-01 06:22:15,119 INFO L495 AbstractCegarLoop]: Abstraction has has 787 places, 3861 transitions, 106927 flow [2023-09-01 06:22:15,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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 06:22:15,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:22:15,119 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:22:15,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-09-01 06:22:15,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-09-01 06:22:15,325 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:22:15,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:22:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1991882933, now seen corresponding path program 1 times [2023-09-01 06:22:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:22:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106734060] [2023-09-01 06:22:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:22:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:22:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:22:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:22:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106734060] [2023-09-01 06:22:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106734060] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:22:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481582296] [2023-09-01 06:22:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:22:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:22:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:22:15,767 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:22:15,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-09-01 06:22:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:22:15,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2023-09-01 06:22:15,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:22:16,063 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 06:22:16,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:22:16,193 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 06:22:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:16,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:22:16,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:22:16,408 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 24 treesize of output 25 [2023-09-01 06:22:16,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:22:16,415 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 26 treesize of output 30 [2023-09-01 06:22:16,429 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 7 treesize of output 5 [2023-09-01 06:22:16,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:22:16,443 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 45 treesize of output 49 [2023-09-01 06:22:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481582296] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:22:16,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:22:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-09-01 06:22:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502703638] [2023-09-01 06:22:16,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:22:16,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:22:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:22:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:22:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2023-09-01 06:22:18,769 WARN L539 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 06:22:21,601 WARN L539 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 06:22:24,356 WARN L539 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 06:22:27,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:22:27,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 200 [2023-09-01 06:22:27,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 3861 transitions, 106927 flow. Second operand has 31 states, 31 states have (on average 74.45161290322581) internal successors, (2308), 31 states have internal predecessors, (2308), 0 states have call successors, (0), 0 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 06:22:27,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:22:27,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 200 [2023-09-01 06:22:27,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:22:58,926 INFO L130 PetriNetUnfolder]: 6508/14243 cut-off events. [2023-09-01 06:22:58,926 INFO L131 PetriNetUnfolder]: For 1252983/1252983 co-relation queries the response was YES. [2023-09-01 06:22:59,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221378 conditions, 14243 events. 6508/14243 cut-off events. For 1252983/1252983 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 131558 event pairs, 671 based on Foata normal form. 67/14310 useless extension candidates. Maximal degree in co-relation 221084. Up to 7940 conditions per place. [2023-09-01 06:23:00,045 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 2347 selfloop transitions, 2379 changer transitions 0/4726 dead transitions. [2023-09-01 06:23:00,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 4726 transitions, 140112 flow [2023-09-01 06:23:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-09-01 06:23:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-09-01 06:23:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 7313 transitions. [2023-09-01 06:23:00,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3848947368421053 [2023-09-01 06:23:00,051 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 7313 transitions. [2023-09-01 06:23:00,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 7313 transitions. [2023-09-01 06:23:00,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:23:00,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 7313 transitions. [2023-09-01 06:23:00,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 76.97894736842105) internal successors, (7313), 95 states have internal predecessors, (7313), 0 states have call successors, (0), 0 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 06:23:00,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 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 06:23:00,071 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 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 06:23:00,071 INFO L175 Difference]: Start difference. First operand has 787 places, 3861 transitions, 106927 flow. Second operand 95 states and 7313 transitions. [2023-09-01 06:23:00,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 881 places, 4726 transitions, 140112 flow [2023-09-01 06:23:25,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 4726 transitions, 133482 flow, removed 3021 selfloop flow, removed 26 redundant places. [2023-09-01 06:23:25,927 INFO L231 Difference]: Finished difference. Result has 888 places, 4398 transitions, 125922 flow [2023-09-01 06:23:25,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=101614, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1899, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=125922, PETRI_PLACES=888, PETRI_TRANSITIONS=4398} [2023-09-01 06:23:25,930 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 856 predicate places. [2023-09-01 06:23:25,930 INFO L495 AbstractCegarLoop]: Abstraction has has 888 places, 4398 transitions, 125922 flow [2023-09-01 06:23:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 74.45161290322581) internal successors, (2308), 31 states have internal predecessors, (2308), 0 states have call successors, (0), 0 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 06:23:25,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:23:25,931 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:23:25,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-09-01 06:23:26,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:23:26,136 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:23:26,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:23:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash -727764562, now seen corresponding path program 2 times [2023-09-01 06:23:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:23:26,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983489670] [2023-09-01 06:23:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:23:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:23:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:23:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:23:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983489670] [2023-09-01 06:23:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983489670] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:23:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63654640] [2023-09-01 06:23:26,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:23:26,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:23:26,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:23:26,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:23:26,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-09-01 06:23:26,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:23:26,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:23:26,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:23:26,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:23:26,562 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 7 treesize of output 6 [2023-09-01 06:23:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:23:26,642 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 13 treesize of output 15 [2023-09-01 06:23:26,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-09-01 06:23:26,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-09-01 06:23:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:26,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:23:27,396 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1523 Int) (v_ArrVal_1519 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1519) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1523) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|))) is different from false [2023-09-01 06:23:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63654640] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:23:27,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:23:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:23:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910484496] [2023-09-01 06:23:27,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:23:27,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:23:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:23:27,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:23:27,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=711, Unknown=1, NotChecked=56, Total=930 [2023-09-01 06:23:27,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-09-01 06:23:27,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 888 places, 4398 transitions, 125922 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:23:27,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:23:27,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-09-01 06:23:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:24:06,533 INFO L130 PetriNetUnfolder]: 7965/17347 cut-off events. [2023-09-01 06:24:06,533 INFO L131 PetriNetUnfolder]: For 1460705/1460705 co-relation queries the response was YES. [2023-09-01 06:24:07,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269525 conditions, 17347 events. 7965/17347 cut-off events. For 1460705/1460705 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 163353 event pairs, 771 based on Foata normal form. 291/17638 useless extension candidates. Maximal degree in co-relation 269208. Up to 9362 conditions per place. [2023-09-01 06:24:08,045 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 2680 selfloop transitions, 2621 changer transitions 0/5301 dead transitions. [2023-09-01 06:24:08,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 918 places, 5301 transitions, 163185 flow [2023-09-01 06:24:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-01 06:24:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-09-01 06:24:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2534 transitions. [2023-09-01 06:24:08,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35194444444444445 [2023-09-01 06:24:08,048 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2534 transitions. [2023-09-01 06:24:08,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2534 transitions. [2023-09-01 06:24:08,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:24:08,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2534 transitions. [2023-09-01 06:24:08,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 70.38888888888889) internal successors, (2534), 36 states have internal predecessors, (2534), 0 states have call successors, (0), 0 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 06:24:08,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 200.0) internal successors, (7400), 37 states have internal predecessors, (7400), 0 states have call successors, (0), 0 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 06:24:08,059 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 200.0) internal successors, (7400), 37 states have internal predecessors, (7400), 0 states have call successors, (0), 0 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 06:24:08,059 INFO L175 Difference]: Start difference. First operand has 888 places, 4398 transitions, 125922 flow. Second operand 36 states and 2534 transitions. [2023-09-01 06:24:08,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 918 places, 5301 transitions, 163185 flow [2023-09-01 06:24:37,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 5301 transitions, 159348 flow, removed 1505 selfloop flow, removed 34 redundant places. [2023-09-01 06:24:37,971 INFO L231 Difference]: Finished difference. Result has 903 places, 4957 transitions, 148522 flow [2023-09-01 06:24:37,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=119832, PETRI_DIFFERENCE_MINUEND_PLACES=849, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2067, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2097, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=148522, PETRI_PLACES=903, PETRI_TRANSITIONS=4957} [2023-09-01 06:24:37,975 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 871 predicate places. [2023-09-01 06:24:37,975 INFO L495 AbstractCegarLoop]: Abstraction has has 903 places, 4957 transitions, 148522 flow [2023-09-01 06:24:37,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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 06:24:37,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:24:37,975 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:24:37,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-09-01 06:24:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:24:38,181 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-09-01 06:24:38,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:24:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash 702349839, now seen corresponding path program 2 times [2023-09-01 06:24:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:24:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121755347] [2023-09-01 06:24:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:24:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:24:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:24:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:38,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:24:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121755347] [2023-09-01 06:24:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121755347] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:24:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728438445] [2023-09-01 06:24:38,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:24:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:24:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:24:38,548 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:24:38,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-09-01 06:24:38,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:24:38,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:24:38,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2023-09-01 06:24:38,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:24:38,853 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 06:24:38,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:24:38,969 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 06:24:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:39,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:24:42,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:24:42,383 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 24 treesize of output 25 [2023-09-01 06:24:42,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:24:42,390 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 26 treesize of output 30 [2023-09-01 06:24:42,399 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 34 treesize of output 28 [2023-09-01 06:24:42,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 06:24:42,416 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 46 treesize of output 50 [2023-09-01 06:24:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728438445] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:24:42,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:24:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-09-01 06:24:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087353878] [2023-09-01 06:24:42,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:24:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:24:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:24:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:24:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=791, Unknown=1, NotChecked=0, Total=930 [2023-09-01 06:24:44,682 WARN L539 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 06:24:46,786 WARN L539 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 06:24:48,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:24:50,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:24:52,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:24:55,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 [1] [2023-09-01 06:24:57,146 WARN L539 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 06:24:59,251 WARN L539 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 06:25:01,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 [1] [2023-09-01 06:25:03,370 WARN L539 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 06:25:05,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15