./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 10:16:06,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 10:16:06,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 10:16:06,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 10:16:06,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 10:16:06,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 10:16:06,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 10:16:06,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 10:16:06,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 10:16:06,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 10:16:06,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 10:16:06,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 10:16:06,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 10:16:06,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 10:16:06,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 10:16:06,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 10:16:06,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 10:16:06,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 10:16:06,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 10:16:06,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 10:16:06,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 10:16:06,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 10:16:06,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 10:16:06,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 10:16:06,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 10:16:06,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 10:16:06,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 10:16:06,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 10:16:06,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 10:16:06,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 10:16:06,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 10:16:06,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 10:16:06,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 10:16:06,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 10:16:06,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 10:16:06,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 10:16:06,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 10:16:06,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 10:16:06,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 10:16:06,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 10:16:06,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 10:16:06,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 10:16:06,729 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 10:16:06,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 10:16:06,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 10:16:06,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 10:16:06,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 10:16:06,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 10:16:06,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 10:16:06,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 10:16:06,732 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 10:16:06,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 10:16:06,732 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 10:16:06,732 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 10:16:06,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 10:16:06,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 10:16:06,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 10:16:06,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 10:16:06,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:16:06,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 10:16:06,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 10:16:06,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 10:16:06,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 10:16:06,736 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 10:16:06,737 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 10:16:06,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 10:16:07,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 10:16:07,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 10:16:07,015 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 10:16:07,015 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 10:16:07,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-08-30 10:16:07,942 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 10:16:08,115 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 10:16:08,115 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-08-30 10:16:08,126 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4817001c/ab1bb8af5971495cb69a1fe69ae9b73c/FLAG718418035 [2023-08-30 10:16:08,134 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4817001c/ab1bb8af5971495cb69a1fe69ae9b73c [2023-08-30 10:16:08,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 10:16:08,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 10:16:08,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 10:16:08,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 10:16:08,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 10:16:08,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1538b2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08, skipping insertion in model container [2023-08-30 10:16:08,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 10:16:08,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 10:16:08,431 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-08-30 10:16:08,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:16:08,468 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 10:16:08,505 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-08-30 10:16:08,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:16:08,570 INFO L208 MainTranslator]: Completed translation [2023-08-30 10:16:08,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08 WrapperNode [2023-08-30 10:16:08,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 10:16:08,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 10:16:08,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 10:16:08,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 10:16:08,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,616 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2023-08-30 10:16:08,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 10:16:08,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 10:16:08,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 10:16:08,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 10:16:08,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,650 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 10:16:08,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 10:16:08,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 10:16:08,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 10:16:08,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (1/1) ... [2023-08-30 10:16:08,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:16:08,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:08,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 10:16:08,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 10:16:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 10:16:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 10:16:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 10:16:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 10:16:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 10:16:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 10:16:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 10:16:08,729 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 10:16:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 10:16:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 10:16:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 10:16:08,731 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 10:16:08,865 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 10:16:08,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 10:16:09,200 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 10:16:09,215 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 10:16:09,215 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-30 10:16:09,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:16:09 BoogieIcfgContainer [2023-08-30 10:16:09,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 10:16:09,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 10:16:09,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 10:16:09,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 10:16:09,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:16:08" (1/3) ... [2023-08-30 10:16:09,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408561d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:16:09, skipping insertion in model container [2023-08-30 10:16:09,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:16:08" (2/3) ... [2023-08-30 10:16:09,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408561d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:16:09, skipping insertion in model container [2023-08-30 10:16:09,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:16:09" (3/3) ... [2023-08-30 10:16:09,223 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-08-30 10:16:09,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 10:16:09,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 10:16:09,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-08-30 10:16:09,235 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 10:16:09,312 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 10:16:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 284 transitions, 576 flow [2023-08-30 10:16:09,460 INFO L130 PetriNetUnfolder]: 73/434 cut-off events. [2023-08-30 10:16:09,461 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:16:09,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 434 events. 73/434 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2040 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-30 10:16:09,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 284 transitions, 576 flow [2023-08-30 10:16:09,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 281 transitions, 570 flow [2023-08-30 10:16:09,482 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:16:09,497 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 281 transitions, 570 flow [2023-08-30 10:16:09,500 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 281 transitions, 570 flow [2023-08-30 10:16:09,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 281 transitions, 570 flow [2023-08-30 10:16:09,545 INFO L130 PetriNetUnfolder]: 72/431 cut-off events. [2023-08-30 10:16:09,545 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:16:09,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 431 events. 72/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2031 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-30 10:16:09,558 INFO L119 LiptonReduction]: Number of co-enabled transitions 25600 [2023-08-30 10:16:12,442 INFO L134 LiptonReduction]: Checked pairs total: 44481 [2023-08-30 10:16:12,442 INFO L136 LiptonReduction]: Total number of compositions: 241 [2023-08-30 10:16:12,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 10:16:12,471 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;@78c6814a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:16:12,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-08-30 10:16:12,474 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 10:16:12,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:16:12,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:12,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 10:16:12,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:12,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 35072, now seen corresponding path program 1 times [2023-08-30 10:16:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635817973] [2023-08-30 10:16:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635817973] [2023-08-30 10:16:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635817973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 10:16:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647098620] [2023-08-30 10:16:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:16:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:16:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:16:12,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 525 [2023-08-30 10:16:12,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 119 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:12,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:12,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 525 [2023-08-30 10:16:12,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:12,930 INFO L130 PetriNetUnfolder]: 1078/2231 cut-off events. [2023-08-30 10:16:12,930 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:16:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 2231 events. 1078/2231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14691 event pairs, 924 based on Foata normal form. 268/1802 useless extension candidates. Maximal degree in co-relation 4153. Up to 2029 conditions per place. [2023-08-30 10:16:12,938 INFO L137 encePairwiseOnDemand]: 491/525 looper letters, 73 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-08-30 10:16:12,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 328 flow [2023-08-30 10:16:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:16:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:16:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2023-08-30 10:16:12,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193650793650794 [2023-08-30 10:16:12,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 818 transitions. [2023-08-30 10:16:12,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 818 transitions. [2023-08-30 10:16:12,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:12,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 818 transitions. [2023-08-30 10:16:12,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:12,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:12,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:12,964 INFO L175 Difference]: Start difference. First operand has 85 places, 119 transitions, 246 flow. Second operand 3 states and 818 transitions. [2023-08-30 10:16:12,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 328 flow [2023-08-30 10:16:12,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:16:12,969 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 182 flow [2023-08-30 10:16:12,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2023-08-30 10:16:12,974 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 0 predicate places. [2023-08-30 10:16:12,974 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 182 flow [2023-08-30 10:16:12,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:12,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:12,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 10:16:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 10:16:12,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:12,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1046270261, now seen corresponding path program 1 times [2023-08-30 10:16:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565048086] [2023-08-30 10:16:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565048086] [2023-08-30 10:16:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565048086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:13,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:16:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788013591] [2023-08-30 10:16:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:13,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:16:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:16:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:16:13,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 525 [2023-08-30 10:16:13,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:13,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 525 [2023-08-30 10:16:13,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:13,307 INFO L130 PetriNetUnfolder]: 1078/2232 cut-off events. [2023-08-30 10:16:13,308 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:16:13,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 2232 events. 1078/2232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14661 event pairs, 924 based on Foata normal form. 0/1535 useless extension candidates. Maximal degree in co-relation 4265. Up to 2030 conditions per place. [2023-08-30 10:16:13,319 INFO L137 encePairwiseOnDemand]: 522/525 looper letters, 73 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 10:16:13,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 334 flow [2023-08-30 10:16:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:16:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:16:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-08-30 10:16:13,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4996825396825397 [2023-08-30 10:16:13,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-08-30 10:16:13,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-08-30 10:16:13,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:13,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-08-30 10:16:13,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,330 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 182 flow. Second operand 3 states and 787 transitions. [2023-08-30 10:16:13,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 334 flow [2023-08-30 10:16:13,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:16:13,334 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 193 flow [2023-08-30 10:16:13,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2023-08-30 10:16:13,335 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 2 predicate places. [2023-08-30 10:16:13,335 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 193 flow [2023-08-30 10:16:13,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:13,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 10:16:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 10:16:13,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:13,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1886971998, now seen corresponding path program 1 times [2023-08-30 10:16:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754815105] [2023-08-30 10:16:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:13,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754815105] [2023-08-30 10:16:13,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754815105] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897496557] [2023-08-30 10:16:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:13,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:13,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:13,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:13,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 10:16:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:13,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:16:13,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:13,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897496557] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:13,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:13,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 10:16:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780299543] [2023-08-30 10:16:13,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:13,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:16:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:16:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:16:13,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 525 [2023-08-30 10:16:13,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:13,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 525 [2023-08-30 10:16:13,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:13,806 INFO L130 PetriNetUnfolder]: 1078/2235 cut-off events. [2023-08-30 10:16:13,806 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:16:13,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2235 events. 1078/2235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14690 event pairs, 924 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 4278. Up to 2030 conditions per place. [2023-08-30 10:16:13,814 INFO L137 encePairwiseOnDemand]: 522/525 looper letters, 73 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2023-08-30 10:16:13,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 90 transitions, 361 flow [2023-08-30 10:16:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:16:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:16:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1497 transitions. [2023-08-30 10:16:13,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47523809523809524 [2023-08-30 10:16:13,817 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1497 transitions. [2023-08-30 10:16:13,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1497 transitions. [2023-08-30 10:16:13,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:13,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1497 transitions. [2023-08-30 10:16:13,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.5) internal successors, (1497), 6 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,825 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 193 flow. Second operand 6 states and 1497 transitions. [2023-08-30 10:16:13,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 90 transitions, 361 flow [2023-08-30 10:16:13,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 357 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:16:13,827 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 225 flow [2023-08-30 10:16:13,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2023-08-30 10:16:13,828 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 9 predicate places. [2023-08-30 10:16:13,828 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 225 flow [2023-08-30 10:16:13,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:13,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:13,829 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2023-08-30 10:16:13,836 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-08-30 10:16:14,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:14,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:14,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1509000283, now seen corresponding path program 1 times [2023-08-30 10:16:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376013289] [2023-08-30 10:16:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 10:16:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376013289] [2023-08-30 10:16:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376013289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:16:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962794331] [2023-08-30 10:16:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:14,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:16:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:16:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:16:14,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 525 [2023-08-30 10:16:14,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:14,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 525 [2023-08-30 10:16:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:14,279 INFO L130 PetriNetUnfolder]: 1033/2119 cut-off events. [2023-08-30 10:16:14,279 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 10:16:14,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2119 events. 1033/2119 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14117 event pairs, 410 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 4055. Up to 1880 conditions per place. [2023-08-30 10:16:14,286 INFO L137 encePairwiseOnDemand]: 520/525 looper letters, 97 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-30 10:16:14,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 465 flow [2023-08-30 10:16:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:16:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:16:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2023-08-30 10:16:14,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136507936507937 [2023-08-30 10:16:14,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2023-08-30 10:16:14,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2023-08-30 10:16:14,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:14,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2023-08-30 10:16:14,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,293 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 225 flow. Second operand 3 states and 809 transitions. [2023-08-30 10:16:14,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 465 flow [2023-08-30 10:16:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 451 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:16:14,297 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 215 flow [2023-08-30 10:16:14,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2023-08-30 10:16:14,299 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 9 predicate places. [2023-08-30 10:16:14,300 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 215 flow [2023-08-30 10:16:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:14,300 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 10:16:14,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:14,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 803050762, now seen corresponding path program 1 times [2023-08-30 10:16:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697238075] [2023-08-30 10:16:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697238075] [2023-08-30 10:16:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697238075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101126492] [2023-08-30 10:16:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:14,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:14,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:14,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 10:16:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:14,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:16:14,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:14,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:16:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101126492] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:14,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:14,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-30 10:16:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415601741] [2023-08-30 10:16:14,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 10:16:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 10:16:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-30 10:16:14,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 525 [2023-08-30 10:16:14,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 215 flow. Second operand has 12 states, 12 states have (on average 237.5) internal successors, (2850), 12 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:14,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 525 [2023-08-30 10:16:14,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:14,762 INFO L130 PetriNetUnfolder]: 1033/2101 cut-off events. [2023-08-30 10:16:14,763 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2023-08-30 10:16:14,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 2101 events. 1033/2101 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13601 event pairs, 882 based on Foata normal form. 6/1507 useless extension candidates. Maximal degree in co-relation 4102. Up to 1901 conditions per place. [2023-08-30 10:16:14,770 INFO L137 encePairwiseOnDemand]: 522/525 looper letters, 71 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2023-08-30 10:16:14,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 415 flow [2023-08-30 10:16:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:16:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:16:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2920 transitions. [2023-08-30 10:16:14,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2023-08-30 10:16:14,775 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2920 transitions. [2023-08-30 10:16:14,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2920 transitions. [2023-08-30 10:16:14,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:14,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2920 transitions. [2023-08-30 10:16:14,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 243.33333333333334) internal successors, (2920), 12 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 525.0) internal successors, (6825), 13 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,788 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 525.0) internal successors, (6825), 13 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,788 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 215 flow. Second operand 12 states and 2920 transitions. [2023-08-30 10:16:14,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 415 flow [2023-08-30 10:16:14,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 94 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:16:14,792 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 295 flow [2023-08-30 10:16:14,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=295, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2023-08-30 10:16:14,794 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 24 predicate places. [2023-08-30 10:16:14,795 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 295 flow [2023-08-30 10:16:14,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 237.5) internal successors, (2850), 12 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:14,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:14,796 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:14,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:15,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:15,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:15,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1140268986, now seen corresponding path program 1 times [2023-08-30 10:16:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877259086] [2023-08-30 10:16:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877259086] [2023-08-30 10:16:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877259086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:16:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470038917] [2023-08-30 10:16:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:15,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:16:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:16:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:16:15,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 525 [2023-08-30 10:16:15,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:15,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:15,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 525 [2023-08-30 10:16:15,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:15,799 INFO L130 PetriNetUnfolder]: 1737/3585 cut-off events. [2023-08-30 10:16:15,799 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 10:16:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7087 conditions, 3585 events. 1737/3585 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 25163 event pairs, 233 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 7066. Up to 1943 conditions per place. [2023-08-30 10:16:15,811 INFO L137 encePairwiseOnDemand]: 510/525 looper letters, 218 selfloop transitions, 22 changer transitions 2/254 dead transitions. [2023-08-30 10:16:15,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 254 transitions, 1117 flow [2023-08-30 10:16:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:16:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:16:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1822 transitions. [2023-08-30 10:16:15,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49578231292517005 [2023-08-30 10:16:15,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1822 transitions. [2023-08-30 10:16:15,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1822 transitions. [2023-08-30 10:16:15,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:15,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1822 transitions. [2023-08-30 10:16:15,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 260.2857142857143) internal successors, (1822), 7 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:15,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 525.0) internal successors, (4200), 8 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:15,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 525.0) internal successors, (4200), 8 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:15,824 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 295 flow. Second operand 7 states and 1822 transitions. [2023-08-30 10:16:15,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 254 transitions, 1117 flow [2023-08-30 10:16:15,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 254 transitions, 1069 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 10:16:15,829 INFO L231 Difference]: Finished difference. Result has 116 places, 114 transitions, 419 flow [2023-08-30 10:16:15,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=116, PETRI_TRANSITIONS=114} [2023-08-30 10:16:15,831 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 31 predicate places. [2023-08-30 10:16:15,831 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 114 transitions, 419 flow [2023-08-30 10:16:15,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:15,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:15,832 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:15,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 10:16:15,832 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:15,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1106022340, now seen corresponding path program 1 times [2023-08-30 10:16:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943100474] [2023-08-30 10:16:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943100474] [2023-08-30 10:16:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943100474] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608307155] [2023-08-30 10:16:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:15,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:15,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 10:16:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:15,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:16:15,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:15,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608307155] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:15,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 10:16:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884933450] [2023-08-30 10:16:15,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:15,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:16:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:16:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:16:16,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 525 [2023-08-30 10:16:16,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 114 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:16,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:16,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 525 [2023-08-30 10:16:16,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:16,059 INFO L130 PetriNetUnfolder]: 91/283 cut-off events. [2023-08-30 10:16:16,059 INFO L131 PetriNetUnfolder]: For 187/192 co-relation queries the response was YES. [2023-08-30 10:16:16,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 283 events. 91/283 cut-off events. For 187/192 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1163 event pairs, 2 based on Foata normal form. 42/288 useless extension candidates. Maximal degree in co-relation 778. Up to 183 conditions per place. [2023-08-30 10:16:16,060 INFO L137 encePairwiseOnDemand]: 522/525 looper letters, 69 selfloop transitions, 2 changer transitions 2/78 dead transitions. [2023-08-30 10:16:16,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 460 flow [2023-08-30 10:16:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:16:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:16:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 996 transitions. [2023-08-30 10:16:16,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2023-08-30 10:16:16,063 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 996 transitions. [2023-08-30 10:16:16,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 996 transitions. [2023-08-30 10:16:16,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:16,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 996 transitions. [2023-08-30 10:16:16,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:16,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 525.0) internal successors, (2625), 5 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:16,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 525.0) internal successors, (2625), 5 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:16,067 INFO L175 Difference]: Start difference. First operand has 116 places, 114 transitions, 419 flow. Second operand 4 states and 996 transitions. [2023-08-30 10:16:16,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 460 flow [2023-08-30 10:16:16,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 442 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 10:16:16,070 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 210 flow [2023-08-30 10:16:16,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2023-08-30 10:16:16,070 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -19 predicate places. [2023-08-30 10:16:16,070 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 210 flow [2023-08-30 10:16:16,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:16,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:16,071 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:16,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:16,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:16,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:16,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -309350980, now seen corresponding path program 1 times [2023-08-30 10:16:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183343496] [2023-08-30 10:16:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183343496] [2023-08-30 10:16:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183343496] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716121789] [2023-08-30 10:16:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:16,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:16,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:16,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 10:16:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:16,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 10:16:16,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:16,547 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-08-30 10:16:16,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:16,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:16,625 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-08-30 10:16:16,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:16:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:16,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716121789] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:16,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-30 10:16:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721192096] [2023-08-30 10:16:16,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:16,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:16:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:16,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:16:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=115, Unknown=6, NotChecked=0, Total=156 [2023-08-30 10:16:17,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 525 [2023-08-30 10:16:17,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 210 flow. Second operand has 13 states, 13 states have (on average 201.3846153846154) internal successors, (2618), 13 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:17,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 525 [2023-08-30 10:16:17,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:17,342 INFO L130 PetriNetUnfolder]: 85/247 cut-off events. [2023-08-30 10:16:17,342 INFO L131 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2023-08-30 10:16:17,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 247 events. 85/247 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 762 event pairs, 11 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 676. Up to 110 conditions per place. [2023-08-30 10:16:17,344 INFO L137 encePairwiseOnDemand]: 517/525 looper letters, 58 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-30 10:16:17,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 400 flow [2023-08-30 10:16:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:16:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:16:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions. [2023-08-30 10:16:17,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39650793650793653 [2023-08-30 10:16:17,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1249 transitions. [2023-08-30 10:16:17,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1249 transitions. [2023-08-30 10:16:17,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:17,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1249 transitions. [2023-08-30 10:16:17,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,357 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,357 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 210 flow. Second operand 6 states and 1249 transitions. [2023-08-30 10:16:17,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 400 flow [2023-08-30 10:16:17,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:16:17,360 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 240 flow [2023-08-30 10:16:17,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-30 10:16:17,361 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2023-08-30 10:16:17,361 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 240 flow [2023-08-30 10:16:17,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 201.3846153846154) internal successors, (2618), 13 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:17,363 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:17,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:17,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:17,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:17,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -451539779, now seen corresponding path program 1 times [2023-08-30 10:16:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105836687] [2023-08-30 10:16:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105836687] [2023-08-30 10:16:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105836687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:16:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288105246] [2023-08-30 10:16:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:16:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:16:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:16:17,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 525 [2023-08-30 10:16:17,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:17,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 525 [2023-08-30 10:16:17,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:17,711 INFO L130 PetriNetUnfolder]: 119/354 cut-off events. [2023-08-30 10:16:17,711 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2023-08-30 10:16:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 354 events. 119/354 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1383 event pairs, 67 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 975. Up to 219 conditions per place. [2023-08-30 10:16:17,713 INFO L137 encePairwiseOnDemand]: 521/525 looper letters, 64 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-30 10:16:17,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 443 flow [2023-08-30 10:16:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:16:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:16:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2023-08-30 10:16:17,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812698412698413 [2023-08-30 10:16:17,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 758 transitions. [2023-08-30 10:16:17,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 758 transitions. [2023-08-30 10:16:17,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:17,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 758 transitions. [2023-08-30 10:16:17,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,721 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 240 flow. Second operand 3 states and 758 transitions. [2023-08-30 10:16:17,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 443 flow [2023-08-30 10:16:17,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 71 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 10:16:17,724 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 243 flow [2023-08-30 10:16:17,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-08-30 10:16:17,724 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2023-08-30 10:16:17,724 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 243 flow [2023-08-30 10:16:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:17,725 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:17,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 10:16:17,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:17,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash -771239210, now seen corresponding path program 1 times [2023-08-30 10:16:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998625285] [2023-08-30 10:16:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998625285] [2023-08-30 10:16:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998625285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 10:16:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204477703] [2023-08-30 10:16:17,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:17,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:16:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:16:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 10:16:17,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 525 [2023-08-30 10:16:17,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 230.25) internal successors, (921), 4 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:17,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 525 [2023-08-30 10:16:17,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:17,942 INFO L130 PetriNetUnfolder]: 114/393 cut-off events. [2023-08-30 10:16:17,942 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2023-08-30 10:16:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 393 events. 114/393 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1758 event pairs, 26 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1090. Up to 153 conditions per place. [2023-08-30 10:16:17,946 INFO L137 encePairwiseOnDemand]: 515/525 looper letters, 49 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2023-08-30 10:16:17,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 456 flow [2023-08-30 10:16:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:16:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:16:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1179 transitions. [2023-08-30 10:16:17,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491428571428571 [2023-08-30 10:16:17,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1179 transitions. [2023-08-30 10:16:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1179 transitions. [2023-08-30 10:16:17,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:17,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1179 transitions. [2023-08-30 10:16:17,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.8) internal successors, (1179), 5 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 525.0) internal successors, (3150), 6 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 525.0) internal successors, (3150), 6 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,955 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 243 flow. Second operand 5 states and 1179 transitions. [2023-08-30 10:16:17,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 456 flow [2023-08-30 10:16:17,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:16:17,958 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 370 flow [2023-08-30 10:16:17,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-30 10:16:17,958 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -9 predicate places. [2023-08-30 10:16:17,958 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 370 flow [2023-08-30 10:16:17,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 230.25) internal successors, (921), 4 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:17,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:17,959 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:17,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 10:16:17,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:17,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash -771239254, now seen corresponding path program 1 times [2023-08-30 10:16:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768243727] [2023-08-30 10:16:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768243727] [2023-08-30 10:16:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768243727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 10:16:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23730375] [2023-08-30 10:16:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:18,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:16:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:18,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:16:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:16:18,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 525 [2023-08-30 10:16:18,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 223.625) internal successors, (1789), 8 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:18,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:18,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 525 [2023-08-30 10:16:18,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:18,524 INFO L130 PetriNetUnfolder]: 118/412 cut-off events. [2023-08-30 10:16:18,524 INFO L131 PetriNetUnfolder]: For 681/689 co-relation queries the response was YES. [2023-08-30 10:16:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 412 events. 118/412 cut-off events. For 681/689 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1871 event pairs, 9 based on Foata normal form. 10/387 useless extension candidates. Maximal degree in co-relation 1327. Up to 143 conditions per place. [2023-08-30 10:16:18,526 INFO L137 encePairwiseOnDemand]: 513/525 looper letters, 74 selfloop transitions, 23 changer transitions 0/102 dead transitions. [2023-08-30 10:16:18,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 102 transitions, 722 flow [2023-08-30 10:16:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 10:16:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 10:16:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2517 transitions. [2023-08-30 10:16:18,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43584415584415587 [2023-08-30 10:16:18,532 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2517 transitions. [2023-08-30 10:16:18,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2517 transitions. [2023-08-30 10:16:18,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:18,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2517 transitions. [2023-08-30 10:16:18,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 228.8181818181818) internal successors, (2517), 11 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:18,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 525.0) internal successors, (6300), 12 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:18,542 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 525.0) internal successors, (6300), 12 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:18,542 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 370 flow. Second operand 11 states and 2517 transitions. [2023-08-30 10:16:18,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 102 transitions, 722 flow [2023-08-30 10:16:18,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 102 transitions, 714 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 10:16:18,546 INFO L231 Difference]: Finished difference. Result has 90 places, 69 transitions, 491 flow [2023-08-30 10:16:18,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=90, PETRI_TRANSITIONS=69} [2023-08-30 10:16:18,546 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 5 predicate places. [2023-08-30 10:16:18,546 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 69 transitions, 491 flow [2023-08-30 10:16:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 223.625) internal successors, (1789), 8 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:18,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:18,547 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 10:16:18,547 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:18,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -135866652, now seen corresponding path program 1 times [2023-08-30 10:16:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72160793] [2023-08-30 10:16:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:18,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72160793] [2023-08-30 10:16:18,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72160793] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:18,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819890927] [2023-08-30 10:16:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:18,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:18,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 10:16:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:18,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 10:16:18,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:18,817 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-08-30 10:16:18,860 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:18,876 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-08-30 10:16:18,938 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 27 treesize of output 20 [2023-08-30 10:16:18,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:16:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:18,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:19,006 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))) is different from false [2023-08-30 10:16:19,022 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 Int)) (or (< v_ArrVal_402 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1)) (< 0 (+ (select (select (store (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_402)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))) is different from false [2023-08-30 10:16:19,032 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (< v_ArrVal_402 (+ (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))))) is different from false [2023-08-30 10:16:19,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (or (< v_ArrVal_402 (+ (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))))) is different from false [2023-08-30 10:16:19,083 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_400))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#cache~0.base| (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)) (< v_ArrVal_402 (+ (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) is different from false [2023-08-30 10:16:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:16:19,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819890927] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:19,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 18 [2023-08-30 10:16:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265186926] [2023-08-30 10:16:19,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:16:19,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:16:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=169, Unknown=5, NotChecked=150, Total=380 [2023-08-30 10:16:19,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 525 [2023-08-30 10:16:19,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 69 transitions, 491 flow. Second operand has 20 states, 20 states have (on average 195.15) internal successors, (3903), 20 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:19,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:19,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 525 [2023-08-30 10:16:19,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:19,550 INFO L130 PetriNetUnfolder]: 123/422 cut-off events. [2023-08-30 10:16:19,550 INFO L131 PetriNetUnfolder]: For 1086/1098 co-relation queries the response was YES. [2023-08-30 10:16:19,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 422 events. 123/422 cut-off events. For 1086/1098 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1875 event pairs, 24 based on Foata normal form. 4/391 useless extension candidates. Maximal degree in co-relation 1534. Up to 138 conditions per place. [2023-08-30 10:16:19,552 INFO L137 encePairwiseOnDemand]: 514/525 looper letters, 77 selfloop transitions, 19 changer transitions 0/100 dead transitions. [2023-08-30 10:16:19,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 802 flow [2023-08-30 10:16:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:16:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:16:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2000 transitions. [2023-08-30 10:16:19,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2023-08-30 10:16:19,556 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2000 transitions. [2023-08-30 10:16:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2000 transitions. [2023-08-30 10:16:19,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:19,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2000 transitions. [2023-08-30 10:16:19,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 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-08-30 10:16:19,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 525.0) internal successors, (5775), 11 states have internal predecessors, (5775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:19,564 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 525.0) internal successors, (5775), 11 states have internal predecessors, (5775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:19,564 INFO L175 Difference]: Start difference. First operand has 90 places, 69 transitions, 491 flow. Second operand 10 states and 2000 transitions. [2023-08-30 10:16:19,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 802 flow [2023-08-30 10:16:19,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 769 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 10:16:19,569 INFO L231 Difference]: Finished difference. Result has 99 places, 73 transitions, 557 flow [2023-08-30 10:16:19,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=557, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2023-08-30 10:16:19,569 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 14 predicate places. [2023-08-30 10:16:19,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 557 flow [2023-08-30 10:16:19,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 195.15) internal successors, (3903), 20 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:19,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:19,571 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:19,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:19,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 10:16:19,776 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:19,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash -135866608, now seen corresponding path program 1 times [2023-08-30 10:16:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:19,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18902123] [2023-08-30 10:16:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:19,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:19,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18902123] [2023-08-30 10:16:19,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18902123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:19,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624421174] [2023-08-30 10:16:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:19,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:19,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:19,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 10:16:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:20,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 10:16:20,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:20,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:20,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:20,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 10:16:20,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 10:16:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:20,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:20,204 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_480) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483649)) is different from false [2023-08-30 10:16:20,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:16:20,212 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 18 treesize of output 19 [2023-08-30 10:16:20,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 23 [2023-08-30 10:16:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:16:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624421174] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:20,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 10:16:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160351853] [2023-08-30 10:16:20,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:20,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:16:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:16:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=279, Unknown=1, NotChecked=34, Total=380 [2023-08-30 10:16:20,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 525 [2023-08-30 10:16:20,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 557 flow. Second operand has 20 states, 20 states have (on average 195.25) internal successors, (3905), 20 states have internal predecessors, (3905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:20,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 525 [2023-08-30 10:16:20,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:20,652 INFO L130 PetriNetUnfolder]: 123/421 cut-off events. [2023-08-30 10:16:20,653 INFO L131 PetriNetUnfolder]: For 1224/1236 co-relation queries the response was YES. [2023-08-30 10:16:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 421 events. 123/421 cut-off events. For 1224/1236 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1877 event pairs, 33 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 1584. Up to 105 conditions per place. [2023-08-30 10:16:20,655 INFO L137 encePairwiseOnDemand]: 514/525 looper letters, 71 selfloop transitions, 25 changer transitions 0/100 dead transitions. [2023-08-30 10:16:20,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 852 flow [2023-08-30 10:16:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:16:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:16:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2383 transitions. [2023-08-30 10:16:20,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37825396825396823 [2023-08-30 10:16:20,660 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2383 transitions. [2023-08-30 10:16:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2383 transitions. [2023-08-30 10:16:20,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:20,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2383 transitions. [2023-08-30 10:16:20,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 198.58333333333334) internal successors, (2383), 12 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 525.0) internal successors, (6825), 13 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,669 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 525.0) internal successors, (6825), 13 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,669 INFO L175 Difference]: Start difference. First operand has 99 places, 73 transitions, 557 flow. Second operand 12 states and 2383 transitions. [2023-08-30 10:16:20,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 852 flow [2023-08-30 10:16:20,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 814 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 10:16:20,674 INFO L231 Difference]: Finished difference. Result has 104 places, 74 transitions, 584 flow [2023-08-30 10:16:20,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=584, PETRI_PLACES=104, PETRI_TRANSITIONS=74} [2023-08-30 10:16:20,675 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 19 predicate places. [2023-08-30 10:16:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 74 transitions, 584 flow [2023-08-30 10:16:20,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 195.25) internal successors, (3905), 20 states have internal predecessors, (3905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:20,676 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:20,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-30 10:16:20,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:20,882 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:20,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1981281391, now seen corresponding path program 1 times [2023-08-30 10:16:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369501680] [2023-08-30 10:16:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:16:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:20,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369501680] [2023-08-30 10:16:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369501680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:20,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:16:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:16:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863107578] [2023-08-30 10:16:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:16:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:16:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:16:20,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 525 [2023-08-30 10:16:20,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 74 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:20,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 525 [2023-08-30 10:16:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:20,983 INFO L130 PetriNetUnfolder]: 111/397 cut-off events. [2023-08-30 10:16:20,983 INFO L131 PetriNetUnfolder]: For 1227/1255 co-relation queries the response was YES. [2023-08-30 10:16:20,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 397 events. 111/397 cut-off events. For 1227/1255 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1763 event pairs, 25 based on Foata normal form. 6/378 useless extension candidates. Maximal degree in co-relation 1504. Up to 283 conditions per place. [2023-08-30 10:16:20,985 INFO L137 encePairwiseOnDemand]: 521/525 looper letters, 64 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2023-08-30 10:16:20,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 78 transitions, 773 flow [2023-08-30 10:16:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:16:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:16:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-08-30 10:16:20,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46793650793650793 [2023-08-30 10:16:20,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-08-30 10:16:20,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-08-30 10:16:20,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:20,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-08-30 10:16:20,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,990 INFO L175 Difference]: Start difference. First operand has 104 places, 74 transitions, 584 flow. Second operand 3 states and 737 transitions. [2023-08-30 10:16:20,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 78 transitions, 773 flow [2023-08-30 10:16:20,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 78 transitions, 747 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 10:16:20,994 INFO L231 Difference]: Finished difference. Result has 98 places, 73 transitions, 572 flow [2023-08-30 10:16:20,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=98, PETRI_TRANSITIONS=73} [2023-08-30 10:16:20,995 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 13 predicate places. [2023-08-30 10:16:20,995 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 73 transitions, 572 flow [2023-08-30 10:16:20,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:20,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:20,996 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:20,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 10:16:20,996 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:20,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1981281493, now seen corresponding path program 1 times [2023-08-30 10:16:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603005641] [2023-08-30 10:16:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603005641] [2023-08-30 10:16:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603005641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394818446] [2023-08-30 10:16:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:21,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:21,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 10:16:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:21,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 10:16:21,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:21,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 10:16:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394818446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:16:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 10:16:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-30 10:16:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686456000] [2023-08-30 10:16:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:16:21,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:16:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:21,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:16:21,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:16:21,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 525 [2023-08-30 10:16:21,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 73 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:21,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:21,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 525 [2023-08-30 10:16:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:21,258 INFO L130 PetriNetUnfolder]: 105/377 cut-off events. [2023-08-30 10:16:21,258 INFO L131 PetriNetUnfolder]: For 1074/1094 co-relation queries the response was YES. [2023-08-30 10:16:21,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 377 events. 105/377 cut-off events. For 1074/1094 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1641 event pairs, 20 based on Foata normal form. 15/380 useless extension candidates. Maximal degree in co-relation 1440. Up to 199 conditions per place. [2023-08-30 10:16:21,261 INFO L137 encePairwiseOnDemand]: 522/525 looper letters, 95 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-08-30 10:16:21,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 1008 flow [2023-08-30 10:16:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:16:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:16:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 10:16:21,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4719047619047619 [2023-08-30 10:16:21,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 10:16:21,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 10:16:21,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:21,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 10:16:21,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:21,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 525.0) internal successors, (2625), 5 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:21,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 525.0) internal successors, (2625), 5 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:21,267 INFO L175 Difference]: Start difference. First operand has 98 places, 73 transitions, 572 flow. Second operand 4 states and 991 transitions. [2023-08-30 10:16:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 1008 flow [2023-08-30 10:16:21,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 999 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:16:21,272 INFO L231 Difference]: Finished difference. Result has 99 places, 72 transitions, 563 flow [2023-08-30 10:16:21,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=563, PETRI_PLACES=99, PETRI_TRANSITIONS=72} [2023-08-30 10:16:21,273 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 14 predicate places. [2023-08-30 10:16:21,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 72 transitions, 563 flow [2023-08-30 10:16:21,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:21,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:21,273 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:21,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:21,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:21,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:21,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash -62801015, now seen corresponding path program 1 times [2023-08-30 10:16:21,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:21,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814890475] [2023-08-30 10:16:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814890475] [2023-08-30 10:16:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814890475] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327994538] [2023-08-30 10:16:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:21,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:21,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 10:16:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:21,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 10:16:21,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:21,967 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-08-30 10:16:22,013 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:22,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:22,035 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-08-30 10:16:22,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-30 10:16:22,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 10:16:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:16:22,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:22,307 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_695 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_695) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483647)) is different from false [2023-08-30 10:16:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:16:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327994538] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:22,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2023-08-30 10:16:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951777017] [2023-08-30 10:16:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 10:16:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 10:16:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=395, Unknown=1, NotChecked=42, Total=552 [2023-08-30 10:16:22,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 525 [2023-08-30 10:16:22,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 72 transitions, 563 flow. Second operand has 24 states, 24 states have (on average 187.41666666666666) internal successors, (4498), 24 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:22,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:22,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 525 [2023-08-30 10:16:22,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:23,151 INFO L130 PetriNetUnfolder]: 109/401 cut-off events. [2023-08-30 10:16:23,152 INFO L131 PetriNetUnfolder]: For 1135/1147 co-relation queries the response was YES. [2023-08-30 10:16:23,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 401 events. 109/401 cut-off events. For 1135/1147 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1814 event pairs, 13 based on Foata normal form. 9/398 useless extension candidates. Maximal degree in co-relation 1503. Up to 93 conditions per place. [2023-08-30 10:16:23,153 INFO L137 encePairwiseOnDemand]: 511/525 looper letters, 72 selfloop transitions, 26 changer transitions 10/112 dead transitions. [2023-08-30 10:16:23,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 112 transitions, 993 flow [2023-08-30 10:16:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 10:16:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 10:16:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2479 transitions. [2023-08-30 10:16:23,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36322344322344324 [2023-08-30 10:16:23,159 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2479 transitions. [2023-08-30 10:16:23,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2479 transitions. [2023-08-30 10:16:23,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:23,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2479 transitions. [2023-08-30 10:16:23,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 190.69230769230768) internal successors, (2479), 13 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:23,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 525.0) internal successors, (7350), 14 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:23,172 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 525.0) internal successors, (7350), 14 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:23,172 INFO L175 Difference]: Start difference. First operand has 99 places, 72 transitions, 563 flow. Second operand 13 states and 2479 transitions. [2023-08-30 10:16:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 112 transitions, 993 flow [2023-08-30 10:16:23,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:16:23,179 INFO L231 Difference]: Finished difference. Result has 117 places, 75 transitions, 698 flow [2023-08-30 10:16:23,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=698, PETRI_PLACES=117, PETRI_TRANSITIONS=75} [2023-08-30 10:16:23,180 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 32 predicate places. [2023-08-30 10:16:23,180 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 75 transitions, 698 flow [2023-08-30 10:16:23,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 187.41666666666666) internal successors, (4498), 24 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:23,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:23,181 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:23,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:23,386 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,SelfDestructingSolverStorable15 [2023-08-30 10:16:23,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:23,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -661567715, now seen corresponding path program 1 times [2023-08-30 10:16:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000414419] [2023-08-30 10:16:23,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000414419] [2023-08-30 10:16:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000414419] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128518335] [2023-08-30 10:16:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:23,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:23,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 10:16:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:23,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-30 10:16:23,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:23,815 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-08-30 10:16:23,853 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:23,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:23,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:16:23,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-30 10:16:23,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 23 [2023-08-30 10:16:24,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 10:16:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:24,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:16:24,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_798 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (< (select (select (let ((.cse0 (store (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_798))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|) 2147483647)) is different from false [2023-08-30 10:16:24,251 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_798 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (< (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_798))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|) 2147483647)) is different from false [2023-08-30 10:16:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 55 trivial. 4 not checked. [2023-08-30 10:16:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128518335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:16:24,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:16:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-08-30 10:16:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391017426] [2023-08-30 10:16:24,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:16:24,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 10:16:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:16:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 10:16:24,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=462, Unknown=13, NotChecked=94, Total=702 [2023-08-30 10:16:24,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 525 [2023-08-30 10:16:24,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 75 transitions, 698 flow. Second operand has 27 states, 27 states have (on average 187.37037037037038) internal successors, (5059), 27 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:24,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:16:24,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 525 [2023-08-30 10:16:24,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:16:37,281 INFO L130 PetriNetUnfolder]: 128/504 cut-off events. [2023-08-30 10:16:37,281 INFO L131 PetriNetUnfolder]: For 2178/2178 co-relation queries the response was YES. [2023-08-30 10:16:37,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 504 events. 128/504 cut-off events. For 2178/2178 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1975 event pairs, 5 based on Foata normal form. 8/493 useless extension candidates. Maximal degree in co-relation 2099. Up to 96 conditions per place. [2023-08-30 10:16:37,284 INFO L137 encePairwiseOnDemand]: 509/525 looper letters, 89 selfloop transitions, 37 changer transitions 41/171 dead transitions. [2023-08-30 10:16:37,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 171 transitions, 1674 flow [2023-08-30 10:16:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 10:16:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 10:16:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4941 transitions. [2023-08-30 10:16:37,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.361978021978022 [2023-08-30 10:16:37,289 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4941 transitions. [2023-08-30 10:16:37,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4941 transitions. [2023-08-30 10:16:37,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:16:37,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4941 transitions. [2023-08-30 10:16:37,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 190.03846153846155) internal successors, (4941), 26 states have internal predecessors, (4941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:37,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 525.0) internal successors, (14175), 27 states have internal predecessors, (14175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:37,303 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 525.0) internal successors, (14175), 27 states have internal predecessors, (14175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:37,303 INFO L175 Difference]: Start difference. First operand has 117 places, 75 transitions, 698 flow. Second operand 26 states and 4941 transitions. [2023-08-30 10:16:37,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 171 transitions, 1674 flow [2023-08-30 10:16:37,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 171 transitions, 1557 flow, removed 43 selfloop flow, removed 12 redundant places. [2023-08-30 10:16:37,311 INFO L231 Difference]: Finished difference. Result has 146 places, 81 transitions, 812 flow [2023-08-30 10:16:37,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=812, PETRI_PLACES=146, PETRI_TRANSITIONS=81} [2023-08-30 10:16:37,311 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 61 predicate places. [2023-08-30 10:16:37,311 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 81 transitions, 812 flow [2023-08-30 10:16:37,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 187.37037037037038) internal successors, (5059), 27 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:16:37,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:16:37,313 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:16:37,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 10:16:37,517 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,SelfDestructingSolverStorable16 [2023-08-30 10:16:37,518 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:16:37,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:16:37,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2110398506, now seen corresponding path program 1 times [2023-08-30 10:16:37,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:16:37,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902971774] [2023-08-30 10:16:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:16:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:16:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:16:39,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902971774] [2023-08-30 10:16:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902971774] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:16:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305044290] [2023-08-30 10:16:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:16:39,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:16:39,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:16:39,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:16:39,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 10:16:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:16:39,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 10:16:39,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:16:39,411 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-08-30 10:16:39,623 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:16:39,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:16:39,688 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-08-30 10:16:39,946 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-08-30 10:16:40,120 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-08-30 10:16:50,645 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-08-30 10:16:54,955 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 24 treesize of output 19 [2023-08-30 10:17:21,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 16 [2023-08-30 10:17:21,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 10:17:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:17:21,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:17:29,476 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| Int) (v_ArrVal_943 Int) (v_ArrVal_940 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|)) (< 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_940) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| v_ArrVal_943) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85|))))) is different from false [2023-08-30 10:17:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:17:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305044290] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:17:29,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:17:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 37 [2023-08-30 10:17:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918160757] [2023-08-30 10:17:29,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:17:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-30 10:17:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:17:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-30 10:17:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1122, Unknown=24, NotChecked=72, Total=1482 [2023-08-30 10:17:30,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 525 [2023-08-30 10:17:30,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 81 transitions, 812 flow. Second operand has 39 states, 39 states have (on average 189.7948717948718) internal successors, (7402), 39 states have internal predecessors, (7402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:17:30,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:17:30,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 525 [2023-08-30 10:17:30,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:17:32,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:34,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:36,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:38,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:40,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:42,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:44,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 [0] [2023-08-30 10:17:46,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:48,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:56,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:17:58,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:00,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:02,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:04,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:06,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] [2023-08-30 10:18:08,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:10,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:12,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:14,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:16,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:18,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:20,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:22,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:24,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:26,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:28,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:30,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:44,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:46,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:48,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:50,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:52,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:54,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:56,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:18:58,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:00,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:02,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:04,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:06,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:08,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:10,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:12,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:14,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:16,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:18,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:20,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:22,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:24,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:26,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:28,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:30,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:32,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:34,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:36,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:39,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:41,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:43,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:45,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:47,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:49,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:51,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:53,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:55,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:57,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:19:59,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:01,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:03,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 [0] [2023-08-30 10:20:05,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:07,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:11,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:13,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:17,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:19,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:34,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:20:36,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:21:11,225 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 51 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:21:30,499 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 54 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:21:50,951 WARN L222 SmtUtils]: Spent 10.13s on a formula simplification. DAG size of input: 55 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:22:10,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:23:11,192 WARN L222 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 71 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:23:13,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:17,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:24,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:36,604 INFO L130 PetriNetUnfolder]: 128/563 cut-off events. [2023-08-30 10:23:36,604 INFO L131 PetriNetUnfolder]: For 3158/3158 co-relation queries the response was YES. [2023-08-30 10:23:36,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 563 events. 128/563 cut-off events. For 3158/3158 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2055 event pairs, 5 based on Foata normal form. 3/566 useless extension candidates. Maximal degree in co-relation 2792. Up to 119 conditions per place. [2023-08-30 10:23:36,607 INFO L137 encePairwiseOnDemand]: 511/525 looper letters, 136 selfloop transitions, 66 changer transitions 0/206 dead transitions. [2023-08-30 10:23:36,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 206 transitions, 2206 flow [2023-08-30 10:23:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-30 10:23:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-30 10:23:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 8965 transitions. [2023-08-30 10:23:36,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36332320162107395 [2023-08-30 10:23:36,618 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 8965 transitions. [2023-08-30 10:23:36,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 8965 transitions. [2023-08-30 10:23:36,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:36,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 8965 transitions. [2023-08-30 10:23:36,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 190.74468085106383) internal successors, (8965), 47 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:36,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 525.0) internal successors, (25200), 48 states have internal predecessors, (25200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:36,654 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 525.0) internal successors, (25200), 48 states have internal predecessors, (25200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:36,654 INFO L175 Difference]: Start difference. First operand has 146 places, 81 transitions, 812 flow. Second operand 47 states and 8965 transitions. [2023-08-30 10:23:36,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 206 transitions, 2206 flow [2023-08-30 10:23:36,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 206 transitions, 1937 flow, removed 47 selfloop flow, removed 19 redundant places. [2023-08-30 10:23:36,674 INFO L231 Difference]: Finished difference. Result has 178 places, 117 transitions, 1156 flow [2023-08-30 10:23:36,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1156, PETRI_PLACES=178, PETRI_TRANSITIONS=117} [2023-08-30 10:23:36,674 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 93 predicate places. [2023-08-30 10:23:36,674 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 117 transitions, 1156 flow [2023-08-30 10:23:36,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 189.7948717948718) internal successors, (7402), 39 states have internal predecessors, (7402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:36,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:36,676 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:36,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-30 10:23:36,882 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,SelfDestructingSolverStorable17 [2023-08-30 10:23:36,883 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:36,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1512774503, now seen corresponding path program 2 times [2023-08-30 10:23:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982779352] [2023-08-30 10:23:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:41,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982779352] [2023-08-30 10:23:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982779352] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782620152] [2023-08-30 10:23:41,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:23:41,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:41,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 10:23:42,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:23:42,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:23:42,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-30 10:23:42,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:42,045 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-08-30 10:23:42,249 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:42,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:42,347 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-08-30 10:23:42,613 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-08-30 10:23:42,805 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-08-30 10:23:49,397 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-08-30 10:23:53,705 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 24 treesize of output 19 [2023-08-30 10:24:14,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-30 10:24:18,921 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 24 treesize of output 19 [2023-08-30 10:24:27,798 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 27 treesize of output 22 [2023-08-30 10:25:06,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 10:25:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:06,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:25:07,722 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1135))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))))) is different from false [2023-08-30 10:25:07,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2023-08-30 10:25:10,781 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_74| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1129 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_74| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_74| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_1129)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|)))))) is different from false [2023-08-30 10:25:10,834 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_74| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1129 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_74| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_74| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ .cse1 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_1129)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| 28)))))) is different from false [2023-08-30 10:25:11,018 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_74| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1125 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1129 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_74| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_74| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ .cse1 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store (let ((.cse2 (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_1125)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_1129))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 2147483649)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| 28)))))) is different from false [2023-08-30 10:25:11,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1125 Int) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1129 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| 84)) (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_1129)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 2147483649)))) is different from false [2023-08-30 10:25:11,504 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_1125 Int) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1135 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1129 Int)) (or (< 0 (+ 2147483649 (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1122))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_1129))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1131) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_1135) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| 84)))) is different from false [2023-08-30 10:25:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 49 not checked. [2023-08-30 10:25:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782620152] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:25:12,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:25:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 51 [2023-08-30 10:25:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633067747] [2023-08-30 10:25:12,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:25:12,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-08-30 10:25:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:25:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-08-30 10:25:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1663, Unknown=51, NotChecked=658, Total=2756 [2023-08-30 10:25:12,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 525 [2023-08-30 10:25:12,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 117 transitions, 1156 flow. Second operand has 53 states, 53 states have (on average 189.67924528301887) internal successors, (10053), 53 states have internal predecessors, (10053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:12,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:25:12,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 525 [2023-08-30 10:25:12,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:14,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:16,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:18,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:20,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25: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] [2023-08-30 10:25:24,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:26,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:28,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:30,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:42,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:44,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:46,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:48,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:25:50,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:02,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:04,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:06,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:08,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:10,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:12,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:14,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:16,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:19,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:21,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:23,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:25,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:27,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:29,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:31,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:33,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:35,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:37,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:39,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] [2023-08-30 10:26:41,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:43,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:45,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:47,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:49,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:51,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:26:53,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:17,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:19,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:21,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:23,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:25,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:27,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:29,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:31,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:33,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] [2023-08-30 10:27:35,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:37,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:39,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:41,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:43,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:45,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:47,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:49,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:51,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:53,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:55,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:27:57,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:19,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:21,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:23,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:25,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:27,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:29,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:31,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:33,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:35,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 [0] [2023-08-30 10:28:37,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:39,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:41,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:43,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:46,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:28:48,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:04,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:06,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:08,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:10,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:12,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:14,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:32,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:34,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:36,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:38,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:40,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:42,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:44,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:46,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:48,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] [2023-08-30 10:29:50,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:52,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 [0] [2023-08-30 10:29:54,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:56,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:29:58,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:00,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:02,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:04,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:06,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:08,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:10,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:12,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] [2023-08-30 10:30:14,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:16,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:18,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:20,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:22,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:24,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:26,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:28,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:30:30,500 WARN L539 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] Killed by 15