./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations 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/06-symbeq_05-funloop_hard2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 09:35:00,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 09:35:00,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 09:35:00,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 09:35:00,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 09:35:00,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 09:35:00,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 09:35:00,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 09:35:00,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 09:35:00,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 09:35:00,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 09:35:00,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 09:35:00,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 09:35:00,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 09:35:00,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 09:35:00,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 09:35:00,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 09:35:00,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 09:35:00,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 09:35:00,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 09:35:00,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 09:35:00,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 09:35:00,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 09:35:00,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 09:35:00,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 09:35:00,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 09:35:00,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 09:35:00,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 09:35:00,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 09:35:00,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 09:35:00,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 09:35:00,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 09:35:00,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 09:35:00,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 09:35:00,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 09:35:00,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 09:35:00,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 09:35:00,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 09:35:00,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 09:35:00,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 09:35:00,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 09:35:00,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 09:35:01,006 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 09:35:01,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 09:35:01,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 09:35:01,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 09:35:01,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 09:35:01,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 09:35:01,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 09:35:01,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 09:35:01,009 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 09:35:01,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 09:35:01,010 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 09:35:01,010 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 09:35:01,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 09:35:01,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 09:35:01,011 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 09:35:01,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 09:35:01,012 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 09:35:01,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 09:35:01,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 09:35:01,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 09:35:01,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 09:35:01,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 09:35:01,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 09:35:01,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 09:35:01,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 09:35:01,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 09:35:01,014 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 09:35:01,015 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 09:35:01,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 09:35:01,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 09:35:01,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 09:35:01,322 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 09:35:01,322 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 09:35:01,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2023-08-30 09:35:02,553 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 09:35:02,750 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 09:35:02,751 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2023-08-30 09:35:02,764 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f86392/0a43996dbcf44e978c44a7516cb2316c/FLAGc642f8206 [2023-08-30 09:35:02,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f86392/0a43996dbcf44e978c44a7516cb2316c [2023-08-30 09:35:02,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 09:35:02,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 09:35:02,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 09:35:02,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 09:35:02,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 09:35:02,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:35:02" (1/1) ... [2023-08-30 09:35:02,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5228fa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:02, skipping insertion in model container [2023-08-30 09:35:02,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:35:02" (1/1) ... [2023-08-30 09:35:02,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 09:35:02,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 09:35:03,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 09:35:03,183 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 09:35:03,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 09:35:03,278 INFO L208 MainTranslator]: Completed translation [2023-08-30 09:35:03,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03 WrapperNode [2023-08-30 09:35:03,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 09:35:03,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 09:35:03,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 09:35:03,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 09:35:03,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,317 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-08-30 09:35:03,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 09:35:03,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 09:35:03,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 09:35:03,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 09:35:03,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 09:35:03,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 09:35:03,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 09:35:03,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 09:35:03,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (1/1) ... [2023-08-30 09:35:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 09:35:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:03,373 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 09:35:03,375 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 09:35:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 09:35:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 09:35:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 09:35:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 09:35:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 09:35:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 09:35:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 09:35:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 09:35:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 09:35:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 09:35:03,403 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 09:35:03,559 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 09:35:03,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 09:35:03,761 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 09:35:03,774 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 09:35:03,774 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 09:35:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:35:03 BoogieIcfgContainer [2023-08-30 09:35:03,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 09:35:03,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 09:35:03,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 09:35:03,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 09:35:03,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 09:35:02" (1/3) ... [2023-08-30 09:35:03,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@854dc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:35:03, skipping insertion in model container [2023-08-30 09:35:03,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:35:03" (2/3) ... [2023-08-30 09:35:03,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@854dc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:35:03, skipping insertion in model container [2023-08-30 09:35:03,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:35:03" (3/3) ... [2023-08-30 09:35:03,782 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2023-08-30 09:35:03,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 09:35:03,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 09:35:03,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 09:35:03,799 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 09:35:03,882 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 09:35:03,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 104 transitions, 213 flow [2023-08-30 09:35:03,988 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-08-30 09:35:03,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:03,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 6/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-30 09:35:03,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 104 transitions, 213 flow [2023-08-30 09:35:03,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 103 transitions, 209 flow [2023-08-30 09:35:04,003 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 09:35:04,020 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 103 transitions, 209 flow [2023-08-30 09:35:04,027 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 103 transitions, 209 flow [2023-08-30 09:35:04,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 209 flow [2023-08-30 09:35:04,061 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-08-30 09:35:04,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:04,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 6/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-30 09:35:04,066 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-08-30 09:35:05,935 INFO L134 LiptonReduction]: Checked pairs total: 3603 [2023-08-30 09:35:05,936 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-30 09:35:05,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 09:35:05,953 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;@2c014a96, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 09:35:05,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-30 09:35:05,954 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 09:35:05,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:05,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:05,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 09:35:05,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:05,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 12550, now seen corresponding path program 1 times [2023-08-30 09:35:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830426003] [2023-08-30 09:35:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,167 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 09:35:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830426003] [2023-08-30 09:35:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830426003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 09:35:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965612643] [2023-08-30 09:35:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:06,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:35:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:35:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:35:06,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 09:35:06,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:06,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 09:35:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:06,350 INFO L130 PetriNetUnfolder]: 152/306 cut-off events. [2023-08-30 09:35:06,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:06,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 306 events. 152/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1260 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 600. Up to 306 conditions per place. [2023-08-30 09:35:06,354 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-30 09:35:06,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 127 flow [2023-08-30 09:35:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:35:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:35:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 09:35:06,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-08-30 09:35:06,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 09:35:06,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 09:35:06,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:06,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 09:35:06,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,379 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 65 flow. Second operand 3 states and 323 transitions. [2023-08-30 09:35:06,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 127 flow [2023-08-30 09:35:06,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:06,383 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 76 flow [2023-08-30 09:35:06,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-08-30 09:35:06,387 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-08-30 09:35:06,387 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 76 flow [2023-08-30 09:35:06,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:06,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 09:35:06,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 09:35:06,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:06,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash 390006, now seen corresponding path program 1 times [2023-08-30 09:35:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:06,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620564710] [2023-08-30 09:35:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,438 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 09:35:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620564710] [2023-08-30 09:35:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620564710] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876707464] [2023-08-30 09:35:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:06,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 09:35:06,490 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 09:35:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 09:35:06,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:35:06,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:35:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876707464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:35:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 09:35:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092342557] [2023-08-30 09:35:06,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:06,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 09:35:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 09:35:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 09:35:06,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 09:35:06,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:06,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 09:35:06,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:06,683 INFO L130 PetriNetUnfolder]: 152/305 cut-off events. [2023-08-30 09:35:06,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:06,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 305 events. 152/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1274 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 610. Up to 304 conditions per place. [2023-08-30 09:35:06,685 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-30 09:35:06,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 132 flow [2023-08-30 09:35:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:35:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:35:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-30 09:35:06,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2023-08-30 09:35:06,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-30 09:35:06,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-30 09:35:06,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:06,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-30 09:35:06,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,698 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,699 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 76 flow. Second operand 4 states and 415 transitions. [2023-08-30 09:35:06,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 132 flow [2023-08-30 09:35:06,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 128 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:06,700 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 72 flow [2023-08-30 09:35:06,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-30 09:35:06,705 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-30 09:35:06,705 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 72 flow [2023-08-30 09:35:06,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:06,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:06,715 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 09:35:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:06,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:06,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash -573546742, now seen corresponding path program 1 times [2023-08-30 09:35:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533881150] [2023-08-30 09:35:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,976 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 09:35:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533881150] [2023-08-30 09:35:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533881150] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061440259] [2023-08-30 09:35:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:06,979 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 09:35:06,982 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 09:35:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:07,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 09:35:07,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:07,045 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 09:35:07,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:35:07,062 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 09:35:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061440259] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:35:07,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:35:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 09:35:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456253196] [2023-08-30 09:35:07,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:35:07,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 09:35:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 09:35:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 09:35:07,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 09:35:07,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:07,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 09:35:07,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:07,206 INFO L130 PetriNetUnfolder]: 152/308 cut-off events. [2023-08-30 09:35:07,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:35:07,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 308 events. 152/308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1258 event pairs, 126 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 619. Up to 305 conditions per place. [2023-08-30 09:35:07,208 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-08-30 09:35:07,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 150 flow [2023-08-30 09:35:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:35:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:35:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-30 09:35:07,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2023-08-30 09:35:07,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-30 09:35:07,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-30 09:35:07,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:07,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-30 09:35:07,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,220 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,220 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 72 flow. Second operand 6 states and 606 transitions. [2023-08-30 09:35:07,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 150 flow [2023-08-30 09:35:07,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 09:35:07,233 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 105 flow [2023-08-30 09:35:07,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-30 09:35:07,234 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-30 09:35:07,234 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 105 flow [2023-08-30 09:35:07,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:07,235 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:07,245 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 09:35:07,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-30 09:35:07,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:07,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1594330982, now seen corresponding path program 2 times [2023-08-30 09:35:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:07,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215407689] [2023-08-30 09:35:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:07,532 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 09:35:07,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215407689] [2023-08-30 09:35:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215407689] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171872718] [2023-08-30 09:35:07,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:35:07,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:07,535 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 09:35:07,543 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 09:35:07,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 09:35:07,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:35:07,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 09:35:07,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:07,623 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 09:35:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:35:07,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:35:07,727 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 09:35:07,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:35:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171872718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:35:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-30 09:35:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577995497] [2023-08-30 09:35:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:07,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 09:35:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 09:35:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 09:35:07,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-30 09:35:07,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:07,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-30 09:35:07,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:07,929 INFO L130 PetriNetUnfolder]: 196/391 cut-off events. [2023-08-30 09:35:07,930 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 09:35:07,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 391 events. 196/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1724 event pairs, 46 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 795. Up to 317 conditions per place. [2023-08-30 09:35:07,932 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-30 09:35:07,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 263 flow [2023-08-30 09:35:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:35:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:35:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-30 09:35:07,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325 [2023-08-30 09:35:07,935 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-30 09:35:07,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-30 09:35:07,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:07,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-30 09:35:07,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,940 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,940 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 105 flow. Second operand 4 states and 426 transitions. [2023-08-30 09:35:07,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 263 flow [2023-08-30 09:35:07,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:07,942 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 145 flow [2023-08-30 09:35:07,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-30 09:35:07,943 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-30 09:35:07,943 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 145 flow [2023-08-30 09:35:07,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:07,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:07,944 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:07,955 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 09:35:08,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:08,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:08,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1594329890, now seen corresponding path program 1 times [2023-08-30 09:35:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323383490] [2023-08-30 09:35:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:08,263 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 09:35:08,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:08,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323383490] [2023-08-30 09:35:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323383490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851726495] [2023-08-30 09:35:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:08,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:08,265 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 09:35:08,276 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 09:35:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:08,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 09:35:08,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:08,350 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 09:35:08,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:35:08,406 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 09:35:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851726495] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:35:08,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:35:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 09:35:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985260020] [2023-08-30 09:35:08,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:35:08,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 09:35:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 09:35:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 09:35:08,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 09:35:08,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 145 flow. Second operand has 13 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:08,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:08,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 09:35:08,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:08,547 INFO L130 PetriNetUnfolder]: 196/397 cut-off events. [2023-08-30 09:35:08,548 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-30 09:35:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 397 events. 196/397 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1768 event pairs, 129 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 985. Up to 388 conditions per place. [2023-08-30 09:35:08,552 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 34 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2023-08-30 09:35:08,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 271 flow [2023-08-30 09:35:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 09:35:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 09:35:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1185 transitions. [2023-08-30 09:35:08,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2023-08-30 09:35:08,556 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1185 transitions. [2023-08-30 09:35:08,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1185 transitions. [2023-08-30 09:35:08,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:08,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1185 transitions. [2023-08-30 09:35:08,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.75) internal successors, (1185), 12 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:08,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 200.0) internal successors, (2600), 13 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:08,565 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 200.0) internal successors, (2600), 13 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:08,565 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 145 flow. Second operand 12 states and 1185 transitions. [2023-08-30 09:35:08,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 271 flow [2023-08-30 09:35:08,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 09:35:08,570 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 229 flow [2023-08-30 09:35:08,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-08-30 09:35:08,572 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-08-30 09:35:08,573 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 229 flow [2023-08-30 09:35:08,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:08,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:08,575 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:08,584 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 09:35:08,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:08,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:08,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash 90496734, now seen corresponding path program 2 times [2023-08-30 09:35:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114070256] [2023-08-30 09:35:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:09,040 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 09:35:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114070256] [2023-08-30 09:35:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114070256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 09:35:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283386059] [2023-08-30 09:35:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:09,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 09:35:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 09:35:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 09:35:09,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-30 09:35:09,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:09,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-30 09:35:09,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:09,181 INFO L130 PetriNetUnfolder]: 186/377 cut-off events. [2023-08-30 09:35:09,182 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-30 09:35:09,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 377 events. 186/377 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1619 event pairs, 60 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 959. Up to 315 conditions per place. [2023-08-30 09:35:09,184 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 50 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-08-30 09:35:09,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 378 flow [2023-08-30 09:35:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:35:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:35:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-30 09:35:09,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-08-30 09:35:09,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-30 09:35:09,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-30 09:35:09,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:09,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-30 09:35:09,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,190 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 229 flow. Second operand 4 states and 416 transitions. [2023-08-30 09:35:09,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 378 flow [2023-08-30 09:35:09,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 330 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 09:35:09,193 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 219 flow [2023-08-30 09:35:09,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-30 09:35:09,194 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-08-30 09:35:09,194 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 219 flow [2023-08-30 09:35:09,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:09,194 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:09,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 09:35:09,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:09,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1066976044, now seen corresponding path program 1 times [2023-08-30 09:35:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921842207] [2023-08-30 09:35:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:09,252 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 09:35:09,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:09,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921842207] [2023-08-30 09:35:09,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921842207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:09,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:35:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830970190] [2023-08-30 09:35:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:09,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:35:09,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:35:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:35:09,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 09:35:09,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:09,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 09:35:09,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:09,359 INFO L130 PetriNetUnfolder]: 264/534 cut-off events. [2023-08-30 09:35:09,359 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-30 09:35:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 534 events. 264/534 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2526 event pairs, 98 based on Foata normal form. 20/431 useless extension candidates. Maximal degree in co-relation 1423. Up to 321 conditions per place. [2023-08-30 09:35:09,363 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 69 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-30 09:35:09,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 451 flow [2023-08-30 09:35:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:35:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:35:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-30 09:35:09,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683333333333334 [2023-08-30 09:35:09,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-30 09:35:09,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-30 09:35:09,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:09,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-30 09:35:09,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,367 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 219 flow. Second operand 3 states and 341 transitions. [2023-08-30 09:35:09,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 451 flow [2023-08-30 09:35:09,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:09,370 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 228 flow [2023-08-30 09:35:09,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-30 09:35:09,371 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2023-08-30 09:35:09,371 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 228 flow [2023-08-30 09:35:09,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:09,372 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:09,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 09:35:09,372 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:09,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1068025261, now seen corresponding path program 1 times [2023-08-30 09:35:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808087743] [2023-08-30 09:35:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:09,430 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 09:35:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808087743] [2023-08-30 09:35:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808087743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:35:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116794000] [2023-08-30 09:35:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:09,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:35:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:09,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:35:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:35:09,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 09:35:09,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:09,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 09:35:09,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:09,551 INFO L130 PetriNetUnfolder]: 318/646 cut-off events. [2023-08-30 09:35:09,551 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2023-08-30 09:35:09,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 646 events. 318/646 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2986 event pairs, 173 based on Foata normal form. 14/508 useless extension candidates. Maximal degree in co-relation 1824. Up to 493 conditions per place. [2023-08-30 09:35:09,556 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 63 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 09:35:09,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 421 flow [2023-08-30 09:35:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:35:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:35:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-30 09:35:09,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2023-08-30 09:35:09,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-30 09:35:09,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-30 09:35:09,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:09,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-30 09:35:09,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,560 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 228 flow. Second operand 3 states and 333 transitions. [2023-08-30 09:35:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 421 flow [2023-08-30 09:35:09,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 415 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:09,563 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 226 flow [2023-08-30 09:35:09,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-08-30 09:35:09,564 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-08-30 09:35:09,564 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 226 flow [2023-08-30 09:35:09,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:09,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:09,565 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:09,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 09:35:09,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:09,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1132939076, now seen corresponding path program 1 times [2023-08-30 09:35:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521700637] [2023-08-30 09:35:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:09,928 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 09:35:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521700637] [2023-08-30 09:35:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521700637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700980707] [2023-08-30 09:35:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:10,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:10,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:10,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:10,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:10,369 INFO L130 PetriNetUnfolder]: 354/736 cut-off events. [2023-08-30 09:35:10,370 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-08-30 09:35:10,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 736 events. 354/736 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3697 event pairs, 159 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 2159. Up to 587 conditions per place. [2023-08-30 09:35:10,374 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2023-08-30 09:35:10,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 532 flow [2023-08-30 09:35:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 09:35:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 09:35:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2023-08-30 09:35:10,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474375 [2023-08-30 09:35:10,377 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2023-08-30 09:35:10,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2023-08-30 09:35:10,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:10,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2023-08-30 09:35:10,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,382 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,382 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 226 flow. Second operand 8 states and 759 transitions. [2023-08-30 09:35:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 532 flow [2023-08-30 09:35:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:10,386 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 355 flow [2023-08-30 09:35:10,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-08-30 09:35:10,386 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-08-30 09:35:10,386 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 355 flow [2023-08-30 09:35:10,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:10,387 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 09:35:10,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:10,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash -436636914, now seen corresponding path program 1 times [2023-08-30 09:35:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466787473] [2023-08-30 09:35:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:10,654 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 09:35:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466787473] [2023-08-30 09:35:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466787473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380952451] [2023-08-30 09:35:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:10,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 09:35:10,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 355 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:10,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:10,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 09:35:10,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:11,181 INFO L130 PetriNetUnfolder]: 381/816 cut-off events. [2023-08-30 09:35:11,182 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-08-30 09:35:11,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 816 events. 381/816 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4347 event pairs, 181 based on Foata normal form. 21/697 useless extension candidates. Maximal degree in co-relation 2771. Up to 630 conditions per place. [2023-08-30 09:35:11,187 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 69 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2023-08-30 09:35:11,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 752 flow [2023-08-30 09:35:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1011 transitions. [2023-08-30 09:35:11,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45954545454545453 [2023-08-30 09:35:11,191 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1011 transitions. [2023-08-30 09:35:11,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1011 transitions. [2023-08-30 09:35:11,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:11,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1011 transitions. [2023-08-30 09:35:11,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.9090909090909) internal successors, (1011), 11 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:11,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:11,197 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:11,197 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 355 flow. Second operand 11 states and 1011 transitions. [2023-08-30 09:35:11,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 752 flow [2023-08-30 09:35:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 712 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 09:35:11,202 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 538 flow [2023-08-30 09:35:11,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=538, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2023-08-30 09:35:11,204 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2023-08-30 09:35:11,204 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 538 flow [2023-08-30 09:35:11,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:11,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:11,205 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:11,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 09:35:11,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:11,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -436723406, now seen corresponding path program 2 times [2023-08-30 09:35:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072315754] [2023-08-30 09:35:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:11,535 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 09:35:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072315754] [2023-08-30 09:35:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072315754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448347815] [2023-08-30 09:35:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:11,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:11,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:11,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 538 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:11,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:11,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:11,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:12,036 INFO L130 PetriNetUnfolder]: 400/853 cut-off events. [2023-08-30 09:35:12,037 INFO L131 PetriNetUnfolder]: For 2246/2246 co-relation queries the response was YES. [2023-08-30 09:35:12,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 853 events. 400/853 cut-off events. For 2246/2246 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4595 event pairs, 181 based on Foata normal form. 10/719 useless extension candidates. Maximal degree in co-relation 3303. Up to 714 conditions per place. [2023-08-30 09:35:12,043 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 76 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2023-08-30 09:35:12,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 878 flow [2023-08-30 09:35:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 09:35:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 09:35:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2023-08-30 09:35:12,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467 [2023-08-30 09:35:12,047 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2023-08-30 09:35:12,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2023-08-30 09:35:12,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:12,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2023-08-30 09:35:12,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,052 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,052 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 538 flow. Second operand 10 states and 934 transitions. [2023-08-30 09:35:12,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 878 flow [2023-08-30 09:35:12,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 101 transitions, 838 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 09:35:12,059 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 616 flow [2023-08-30 09:35:12,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=616, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2023-08-30 09:35:12,060 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2023-08-30 09:35:12,060 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 616 flow [2023-08-30 09:35:12,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:12,062 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 09:35:12,062 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:12,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash -436704804, now seen corresponding path program 2 times [2023-08-30 09:35:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863707073] [2023-08-30 09:35:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:12,352 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 09:35:12,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:12,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863707073] [2023-08-30 09:35:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863707073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:12,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821870487] [2023-08-30 09:35:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:12,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:12,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 09:35:12,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:12,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 09:35:12,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:12,845 INFO L130 PetriNetUnfolder]: 437/923 cut-off events. [2023-08-30 09:35:12,846 INFO L131 PetriNetUnfolder]: For 3149/3149 co-relation queries the response was YES. [2023-08-30 09:35:12,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 923 events. 437/923 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4962 event pairs, 107 based on Foata normal form. 9/789 useless extension candidates. Maximal degree in co-relation 3685. Up to 647 conditions per place. [2023-08-30 09:35:12,853 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 86 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2023-08-30 09:35:12,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 1122 flow [2023-08-30 09:35:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1027 transitions. [2023-08-30 09:35:12,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668181818181818 [2023-08-30 09:35:12,856 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1027 transitions. [2023-08-30 09:35:12,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1027 transitions. [2023-08-30 09:35:12,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:12,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1027 transitions. [2023-08-30 09:35:12,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,863 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,863 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 616 flow. Second operand 11 states and 1027 transitions. [2023-08-30 09:35:12,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 1122 flow [2023-08-30 09:35:12,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 126 transitions, 1071 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-30 09:35:12,878 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 789 flow [2023-08-30 09:35:12,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=789, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2023-08-30 09:35:12,879 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2023-08-30 09:35:12,879 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 789 flow [2023-08-30 09:35:12,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:12,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:12,880 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:12,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 09:35:12,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:12,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -436704806, now seen corresponding path program 3 times [2023-08-30 09:35:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407341962] [2023-08-30 09:35:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:13,149 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 09:35:13,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407341962] [2023-08-30 09:35:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407341962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96921477] [2023-08-30 09:35:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:13,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:13,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:13,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 789 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:13,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:13,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:13,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:13,640 INFO L130 PetriNetUnfolder]: 408/874 cut-off events. [2023-08-30 09:35:13,641 INFO L131 PetriNetUnfolder]: For 4142/4142 co-relation queries the response was YES. [2023-08-30 09:35:13,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 874 events. 408/874 cut-off events. For 4142/4142 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4631 event pairs, 115 based on Foata normal form. 26/778 useless extension candidates. Maximal degree in co-relation 3766. Up to 641 conditions per place. [2023-08-30 09:35:13,648 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 82 selfloop transitions, 40 changer transitions 0/122 dead transitions. [2023-08-30 09:35:13,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 122 transitions, 1173 flow [2023-08-30 09:35:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2023-08-30 09:35:13,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47045454545454546 [2023-08-30 09:35:13,651 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2023-08-30 09:35:13,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2023-08-30 09:35:13,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:13,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2023-08-30 09:35:13,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.0909090909091) internal successors, (1035), 11 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:13,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:13,657 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:13,658 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 789 flow. Second operand 11 states and 1035 transitions. [2023-08-30 09:35:13,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 122 transitions, 1173 flow [2023-08-30 09:35:13,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 1049 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-30 09:35:13,668 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 744 flow [2023-08-30 09:35:13,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=744, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2023-08-30 09:35:13,668 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2023-08-30 09:35:13,669 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 744 flow [2023-08-30 09:35:13,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:13,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:13,669 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:13,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 09:35:13,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:13,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash -436729940, now seen corresponding path program 1 times [2023-08-30 09:35:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878059458] [2023-08-30 09:35:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:13,944 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 09:35:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878059458] [2023-08-30 09:35:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878059458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:13,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128301034] [2023-08-30 09:35:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:13,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:13,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:13,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:14,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:14,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:14,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:14,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:14,367 INFO L130 PetriNetUnfolder]: 429/929 cut-off events. [2023-08-30 09:35:14,368 INFO L131 PetriNetUnfolder]: For 4043/4043 co-relation queries the response was YES. [2023-08-30 09:35:14,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 929 events. 429/929 cut-off events. For 4043/4043 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5091 event pairs, 177 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 4051. Up to 788 conditions per place. [2023-08-30 09:35:14,376 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 89 selfloop transitions, 29 changer transitions 0/118 dead transitions. [2023-08-30 09:35:14,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 1235 flow [2023-08-30 09:35:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 09:35:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 09:35:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 754 transitions. [2023-08-30 09:35:14,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47125 [2023-08-30 09:35:14,379 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 754 transitions. [2023-08-30 09:35:14,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 754 transitions. [2023-08-30 09:35:14,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:14,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 754 transitions. [2023-08-30 09:35:14,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,384 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,384 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 744 flow. Second operand 8 states and 754 transitions. [2023-08-30 09:35:14,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 1235 flow [2023-08-30 09:35:14,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 1167 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-30 09:35:14,394 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 946 flow [2023-08-30 09:35:14,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=946, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2023-08-30 09:35:14,395 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2023-08-30 09:35:14,395 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 946 flow [2023-08-30 09:35:14,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:14,396 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 09:35:14,396 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:14,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash -436729951, now seen corresponding path program 1 times [2023-08-30 09:35:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536394639] [2023-08-30 09:35:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:14,647 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 09:35:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536394639] [2023-08-30 09:35:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536394639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443407222] [2023-08-30 09:35:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:14,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:14,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 09:35:14,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 946 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:14,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:14,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 09:35:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:15,080 INFO L130 PetriNetUnfolder]: 422/940 cut-off events. [2023-08-30 09:35:15,080 INFO L131 PetriNetUnfolder]: For 4829/4829 co-relation queries the response was YES. [2023-08-30 09:35:15,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4540 conditions, 940 events. 422/940 cut-off events. For 4829/4829 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5312 event pairs, 175 based on Foata normal form. 7/857 useless extension candidates. Maximal degree in co-relation 4490. Up to 807 conditions per place. [2023-08-30 09:35:15,089 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 94 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2023-08-30 09:35:15,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 1420 flow [2023-08-30 09:35:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 09:35:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 09:35:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2023-08-30 09:35:15,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2023-08-30 09:35:15,094 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 834 transitions. [2023-08-30 09:35:15,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 834 transitions. [2023-08-30 09:35:15,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:15,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 834 transitions. [2023-08-30 09:35:15,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,101 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,101 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 946 flow. Second operand 9 states and 834 transitions. [2023-08-30 09:35:15,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 1420 flow [2023-08-30 09:35:15,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 1380 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 09:35:15,114 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1097 flow [2023-08-30 09:35:15,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1097, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2023-08-30 09:35:15,114 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2023-08-30 09:35:15,115 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1097 flow [2023-08-30 09:35:15,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:15,116 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:15,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 09:35:15,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:15,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -440535511, now seen corresponding path program 2 times [2023-08-30 09:35:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337401531] [2023-08-30 09:35:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:15,331 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 09:35:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337401531] [2023-08-30 09:35:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337401531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:15,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:15,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951221599] [2023-08-30 09:35:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:15,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:15,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 09:35:15,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 1097 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:15,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 09:35:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:15,817 INFO L130 PetriNetUnfolder]: 448/985 cut-off events. [2023-08-30 09:35:15,817 INFO L131 PetriNetUnfolder]: For 5847/5847 co-relation queries the response was YES. [2023-08-30 09:35:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4949 conditions, 985 events. 448/985 cut-off events. For 5847/5847 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5556 event pairs, 185 based on Foata normal form. 8/903 useless extension candidates. Maximal degree in co-relation 4897. Up to 816 conditions per place. [2023-08-30 09:35:15,827 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 97 selfloop transitions, 44 changer transitions 0/141 dead transitions. [2023-08-30 09:35:15,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 141 transitions, 1667 flow [2023-08-30 09:35:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1006 transitions. [2023-08-30 09:35:15,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572727272727273 [2023-08-30 09:35:15,830 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1006 transitions. [2023-08-30 09:35:15,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1006 transitions. [2023-08-30 09:35:15,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:15,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1006 transitions. [2023-08-30 09:35:15,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.45454545454545) internal successors, (1006), 11 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,837 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,837 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1097 flow. Second operand 11 states and 1006 transitions. [2023-08-30 09:35:15,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 141 transitions, 1667 flow [2023-08-30 09:35:15,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 141 transitions, 1623 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 09:35:15,856 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 1375 flow [2023-08-30 09:35:15,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2023-08-30 09:35:15,858 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2023-08-30 09:35:15,858 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 1375 flow [2023-08-30 09:35:15,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:15,858 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:15,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 09:35:15,859 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:15,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -440304860, now seen corresponding path program 2 times [2023-08-30 09:35:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731297801] [2023-08-30 09:35:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:16,082 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 09:35:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731297801] [2023-08-30 09:35:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731297801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665791490] [2023-08-30 09:35:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:16,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:16,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:16,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 1375 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:16,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:16,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:16,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:16,615 INFO L130 PetriNetUnfolder]: 459/1008 cut-off events. [2023-08-30 09:35:16,615 INFO L131 PetriNetUnfolder]: For 7923/7923 co-relation queries the response was YES. [2023-08-30 09:35:16,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 1008 events. 459/1008 cut-off events. For 7923/7923 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5704 event pairs, 186 based on Foata normal form. 7/925 useless extension candidates. Maximal degree in co-relation 5528. Up to 875 conditions per place. [2023-08-30 09:35:16,631 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 107 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2023-08-30 09:35:16,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 143 transitions, 1861 flow [2023-08-30 09:35:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 09:35:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 09:35:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2023-08-30 09:35:16,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645 [2023-08-30 09:35:16,633 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2023-08-30 09:35:16,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2023-08-30 09:35:16,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:16,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2023-08-30 09:35:16,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.9) internal successors, (929), 10 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:16,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:16,647 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:16,647 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 1375 flow. Second operand 10 states and 929 transitions. [2023-08-30 09:35:16,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 143 transitions, 1861 flow [2023-08-30 09:35:16,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 143 transitions, 1840 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 09:35:16,668 INFO L231 Difference]: Finished difference. Result has 132 places, 125 transitions, 1538 flow [2023-08-30 09:35:16,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1538, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2023-08-30 09:35:16,668 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2023-08-30 09:35:16,669 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 1538 flow [2023-08-30 09:35:16,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:16,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:16,669 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:16,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 09:35:16,669 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:16,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -440601530, now seen corresponding path program 3 times [2023-08-30 09:35:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761564694] [2023-08-30 09:35:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:16,895 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 09:35:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761564694] [2023-08-30 09:35:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761564694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140165566] [2023-08-30 09:35:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:17,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 09:35:17,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 1538 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:17,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 09:35:17,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:17,408 INFO L130 PetriNetUnfolder]: 481/1058 cut-off events. [2023-08-30 09:35:17,408 INFO L131 PetriNetUnfolder]: For 9365/9365 co-relation queries the response was YES. [2023-08-30 09:35:17,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 1058 events. 481/1058 cut-off events. For 9365/9365 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6085 event pairs, 173 based on Foata normal form. 14/982 useless extension candidates. Maximal degree in co-relation 5922. Up to 824 conditions per place. [2023-08-30 09:35:17,420 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 109 selfloop transitions, 55 changer transitions 0/164 dead transitions. [2023-08-30 09:35:17,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 2203 flow [2023-08-30 09:35:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2023-08-30 09:35:17,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-08-30 09:35:17,439 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1025 transitions. [2023-08-30 09:35:17,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1025 transitions. [2023-08-30 09:35:17,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:17,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1025 transitions. [2023-08-30 09:35:17,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,444 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,444 INFO L175 Difference]: Start difference. First operand has 132 places, 125 transitions, 1538 flow. Second operand 11 states and 1025 transitions. [2023-08-30 09:35:17,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 2203 flow [2023-08-30 09:35:17,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 164 transitions, 2080 flow, removed 15 selfloop flow, removed 8 redundant places. [2023-08-30 09:35:17,470 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 1702 flow [2023-08-30 09:35:17,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1702, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2023-08-30 09:35:17,470 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2023-08-30 09:35:17,471 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 1702 flow [2023-08-30 09:35:17,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:17,471 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:17,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 09:35:17,472 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:17,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -440601541, now seen corresponding path program 3 times [2023-08-30 09:35:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096574940] [2023-08-30 09:35:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:17,668 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 09:35:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096574940] [2023-08-30 09:35:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096574940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:17,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345554881] [2023-08-30 09:35:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:17,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 09:35:17,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 1702 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:17,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:17,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 09:35:17,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:18,186 INFO L130 PetriNetUnfolder]: 474/1044 cut-off events. [2023-08-30 09:35:18,186 INFO L131 PetriNetUnfolder]: For 9731/9731 co-relation queries the response was YES. [2023-08-30 09:35:18,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 1044 events. 474/1044 cut-off events. For 9731/9731 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5987 event pairs, 173 based on Foata normal form. 7/961 useless extension candidates. Maximal degree in co-relation 5991. Up to 823 conditions per place. [2023-08-30 09:35:18,199 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 108 selfloop transitions, 54 changer transitions 0/162 dead transitions. [2023-08-30 09:35:18,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 162 transitions, 2233 flow [2023-08-30 09:35:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions. [2023-08-30 09:35:18,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46045454545454545 [2023-08-30 09:35:18,201 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions. [2023-08-30 09:35:18,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions. [2023-08-30 09:35:18,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:18,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions. [2023-08-30 09:35:18,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.0909090909091) internal successors, (1013), 11 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:18,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:18,206 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:18,206 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 1702 flow. Second operand 11 states and 1013 transitions. [2023-08-30 09:35:18,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 162 transitions, 2233 flow [2023-08-30 09:35:18,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 162 transitions, 2154 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 09:35:18,233 INFO L231 Difference]: Finished difference. Result has 140 places, 130 transitions, 1695 flow [2023-08-30 09:35:18,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1695, PETRI_PLACES=140, PETRI_TRANSITIONS=130} [2023-08-30 09:35:18,234 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2023-08-30 09:35:18,234 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 1695 flow [2023-08-30 09:35:18,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:18,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:18,234 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:18,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 09:35:18,235 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:35:18,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -124884211, now seen corresponding path program 1 times [2023-08-30 09:35:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727361560] [2023-08-30 09:35:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727361560] [2023-08-30 09:35:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727361560] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783096715] [2023-08-30 09:35:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:18,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:18,485 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 09:35:18,514 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 09:35:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:18,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 09:35:18,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:18,604 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 09:35:18,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:35:18,668 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 09:35:18,723 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 09:35:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:21,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:35:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783096715] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:35:26,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:35:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 09:35:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009183738] [2023-08-30 09:35:26,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:35:26,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 09:35:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 09:35:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=267, Unknown=10, NotChecked=0, Total=380 [2023-08-30 09:35:28,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:31,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:32,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:33,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:34,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:35,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:36,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:39,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:44,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:45,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:46,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:46,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 200 [2023-08-30 09:35:46,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 130 transitions, 1695 flow. Second operand has 20 states, 20 states have (on average 68.55) internal successors, (1371), 20 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:46,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:46,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 200 [2023-08-30 09:35:46,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:48,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:49,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:52,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:54,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:56,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:57,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:00,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:01,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:03,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:04,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:08,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:15,237 INFO L130 PetriNetUnfolder]: 488/1069 cut-off events. [2023-08-30 09:36:15,238 INFO L131 PetriNetUnfolder]: For 10882/10882 co-relation queries the response was YES. [2023-08-30 09:36:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 1069 events. 488/1069 cut-off events. For 10882/10882 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6110 event pairs, 90 based on Foata normal form. 28/1003 useless extension candidates. Maximal degree in co-relation 6253. Up to 650 conditions per place. [2023-08-30 09:36:15,246 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 139 selfloop transitions, 90 changer transitions 0/229 dead transitions. [2023-08-30 09:36:15,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 229 transitions, 3139 flow [2023-08-30 09:36:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 09:36:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 09:36:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1060 transitions. [2023-08-30 09:36:15,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2023-08-30 09:36:15,249 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1060 transitions. [2023-08-30 09:36:15,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1060 transitions. [2023-08-30 09:36:15,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:36:15,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1060 transitions. [2023-08-30 09:36:15,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.71428571428571) internal successors, (1060), 14 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:15,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:15,254 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:15,255 INFO L175 Difference]: Start difference. First operand has 140 places, 130 transitions, 1695 flow. Second operand 14 states and 1060 transitions. [2023-08-30 09:36:15,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 229 transitions, 3139 flow [2023-08-30 09:36:15,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 229 transitions, 3012 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-08-30 09:36:15,278 INFO L231 Difference]: Finished difference. Result has 152 places, 164 transitions, 2437 flow [2023-08-30 09:36:15,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2437, PETRI_PLACES=152, PETRI_TRANSITIONS=164} [2023-08-30 09:36:15,279 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2023-08-30 09:36:15,279 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 164 transitions, 2437 flow [2023-08-30 09:36:15,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 68.55) internal successors, (1371), 20 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:15,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:36:15,280 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:36:15,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 09:36:15,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:36:15,485 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:36:15,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:36:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1133195322, now seen corresponding path program 1 times [2023-08-30 09:36:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:36:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862313741] [2023-08-30 09:36:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:36:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:36:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:36:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:36:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:36:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862313741] [2023-08-30 09:36:15,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862313741] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:36:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707025665] [2023-08-30 09:36:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:36:15,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:36:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:36:15,706 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 09:36:15,728 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 09:36:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:36:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 09:36:15,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:36:15,819 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 09:36:15,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:36:15,874 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 09:36:15,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:36:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:36:19,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:36:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:36:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707025665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:36:23,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:36:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-30 09:36:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036127510] [2023-08-30 09:36:23,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:36:23,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 09:36:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:36:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 09:36:23,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=244, Unknown=9, NotChecked=0, Total=342 [2023-08-30 09:36:24,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:25,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:27,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:28,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:29,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:30,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:32,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:33,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:34,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:37,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:41,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:46,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:46,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 200 [2023-08-30 09:36:46,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 164 transitions, 2437 flow. Second operand has 19 states, 19 states have (on average 75.63157894736842) internal successors, (1437), 19 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:46,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:36:46,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 200 [2023-08-30 09:36:46,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:36:48,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:50,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:51,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:52,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:54,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:55,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:57,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:58,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:59,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:01,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:02,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:05,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:06,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:08,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:08,791 INFO L130 PetriNetUnfolder]: 504/1095 cut-off events. [2023-08-30 09:37:08,791 INFO L131 PetriNetUnfolder]: For 13499/13499 co-relation queries the response was YES. [2023-08-30 09:37:08,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7129 conditions, 1095 events. 504/1095 cut-off events. For 13499/13499 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6261 event pairs, 108 based on Foata normal form. 35/1054 useless extension candidates. Maximal degree in co-relation 7059. Up to 682 conditions per place. [2023-08-30 09:37:08,802 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 146 selfloop transitions, 110 changer transitions 0/256 dead transitions. [2023-08-30 09:37:08,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 256 transitions, 4044 flow [2023-08-30 09:37:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:37:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:37:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 915 transitions. [2023-08-30 09:37:08,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2023-08-30 09:37:08,805 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 915 transitions. [2023-08-30 09:37:08,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 915 transitions. [2023-08-30 09:37:08,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:08,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 915 transitions. [2023-08-30 09:37:08,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.18181818181819) internal successors, (915), 11 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:08,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:08,810 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:08,810 INFO L175 Difference]: Start difference. First operand has 152 places, 164 transitions, 2437 flow. Second operand 11 states and 915 transitions. [2023-08-30 09:37:08,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 256 transitions, 4044 flow [2023-08-30 09:37:08,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 256 transitions, 3682 flow, removed 158 selfloop flow, removed 5 redundant places. [2023-08-30 09:37:08,853 INFO L231 Difference]: Finished difference. Result has 163 places, 204 transitions, 3222 flow [2023-08-30 09:37:08,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3222, PETRI_PLACES=163, PETRI_TRANSITIONS=204} [2023-08-30 09:37:08,854 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-08-30 09:37:08,854 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 204 transitions, 3222 flow [2023-08-30 09:37:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.63157894736842) internal successors, (1437), 19 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:08,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:08,855 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:08,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 09:37:09,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:09,061 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:09,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 245377895, now seen corresponding path program 1 times [2023-08-30 09:37:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919348438] [2023-08-30 09:37:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:09,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919348438] [2023-08-30 09:37:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919348438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:09,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178112540] [2023-08-30 09:37:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:09,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:09,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:09,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 09:37:09,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 204 transitions, 3222 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:09,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 09:37:09,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:09,350 INFO L130 PetriNetUnfolder]: 486/1055 cut-off events. [2023-08-30 09:37:09,350 INFO L131 PetriNetUnfolder]: For 13385/13385 co-relation queries the response was YES. [2023-08-30 09:37:09,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 1055 events. 486/1055 cut-off events. For 13385/13385 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5923 event pairs, 182 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 7147. Up to 1024 conditions per place. [2023-08-30 09:37:09,362 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 217 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2023-08-30 09:37:09,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 218 transitions, 3807 flow [2023-08-30 09:37:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 09:37:09,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-08-30 09:37:09,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 09:37:09,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 09:37:09,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:09,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 09:37:09,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,371 INFO L175 Difference]: Start difference. First operand has 163 places, 204 transitions, 3222 flow. Second operand 3 states and 323 transitions. [2023-08-30 09:37:09,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 218 transitions, 3807 flow [2023-08-30 09:37:09,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 218 transitions, 3715 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-08-30 09:37:09,414 INFO L231 Difference]: Finished difference. Result has 162 places, 203 transitions, 3143 flow [2023-08-30 09:37:09,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3141, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3143, PETRI_PLACES=162, PETRI_TRANSITIONS=203} [2023-08-30 09:37:09,414 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2023-08-30 09:37:09,415 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 203 transitions, 3143 flow [2023-08-30 09:37:09,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:09,415 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:09,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 09:37:09,415 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:09,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 245377907, now seen corresponding path program 1 times [2023-08-30 09:37:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808248760] [2023-08-30 09:37:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 09:37:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:09,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808248760] [2023-08-30 09:37:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808248760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552067076] [2023-08-30 09:37:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:09,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:09,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 09:37:09,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 203 transitions, 3143 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:09,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 09:37:09,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:09,655 INFO L130 PetriNetUnfolder]: 468/1015 cut-off events. [2023-08-30 09:37:09,655 INFO L131 PetriNetUnfolder]: For 11963/11963 co-relation queries the response was YES. [2023-08-30 09:37:09,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 1015 events. 468/1015 cut-off events. For 11963/11963 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5637 event pairs, 152 based on Foata normal form. 22/1012 useless extension candidates. Maximal degree in co-relation 6731. Up to 601 conditions per place. [2023-08-30 09:37:09,664 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 216 selfloop transitions, 11 changer transitions 0/227 dead transitions. [2023-08-30 09:37:09,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 227 transitions, 3856 flow [2023-08-30 09:37:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-30 09:37:09,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2023-08-30 09:37:09,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-30 09:37:09,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-30 09:37:09,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:09,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-30 09:37:09,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,669 INFO L175 Difference]: Start difference. First operand has 162 places, 203 transitions, 3143 flow. Second operand 3 states and 321 transitions. [2023-08-30 09:37:09,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 227 transitions, 3856 flow [2023-08-30 09:37:09,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 227 transitions, 3853 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:09,708 INFO L231 Difference]: Finished difference. Result has 163 places, 203 transitions, 3177 flow [2023-08-30 09:37:09,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3177, PETRI_PLACES=163, PETRI_TRANSITIONS=203} [2023-08-30 09:37:09,709 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-08-30 09:37:09,709 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 203 transitions, 3177 flow [2023-08-30 09:37:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:09,710 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:09,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 09:37:09,710 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:09,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998744, now seen corresponding path program 1 times [2023-08-30 09:37:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450316845] [2023-08-30 09:37:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 09:37:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450316845] [2023-08-30 09:37:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450316845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:09,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091104027] [2023-08-30 09:37:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:09,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:09,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:09,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 09:37:09,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 203 transitions, 3177 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:09,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 09:37:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:09,956 INFO L130 PetriNetUnfolder]: 447/969 cut-off events. [2023-08-30 09:37:09,956 INFO L131 PetriNetUnfolder]: For 11805/11805 co-relation queries the response was YES. [2023-08-30 09:37:09,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 969 events. 447/969 cut-off events. For 11805/11805 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5372 event pairs, 108 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 6665. Up to 774 conditions per place. [2023-08-30 09:37:09,996 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 221 selfloop transitions, 12 changer transitions 0/233 dead transitions. [2023-08-30 09:37:09,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 3964 flow [2023-08-30 09:37:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 09:37:09,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-08-30 09:37:09,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 09:37:09,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 09:37:09,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:09,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 09:37:09,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:09,999 INFO L175 Difference]: Start difference. First operand has 163 places, 203 transitions, 3177 flow. Second operand 3 states and 326 transitions. [2023-08-30 09:37:09,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 233 transitions, 3964 flow [2023-08-30 09:37:10,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 233 transitions, 3945 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:10,037 INFO L231 Difference]: Finished difference. Result has 164 places, 203 transitions, 3208 flow [2023-08-30 09:37:10,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3208, PETRI_PLACES=164, PETRI_TRANSITIONS=203} [2023-08-30 09:37:10,038 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-08-30 09:37:10,038 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 3208 flow [2023-08-30 09:37:10,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:10,039 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:10,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 09:37:10,039 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:10,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998742, now seen corresponding path program 1 times [2023-08-30 09:37:10,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:10,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979725155] [2023-08-30 09:37:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:10,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979725155] [2023-08-30 09:37:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979725155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:10,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:10,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725632459] [2023-08-30 09:37:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:10,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:10,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:10,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:10,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 09:37:10,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 203 transitions, 3208 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:10,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 09:37:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:10,262 INFO L130 PetriNetUnfolder]: 426/923 cut-off events. [2023-08-30 09:37:10,263 INFO L131 PetriNetUnfolder]: For 11742/11742 co-relation queries the response was YES. [2023-08-30 09:37:10,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 923 events. 426/923 cut-off events. For 11742/11742 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4991 event pairs, 126 based on Foata normal form. 25/948 useless extension candidates. Maximal degree in co-relation 6583. Up to 887 conditions per place. [2023-08-30 09:37:10,272 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 220 selfloop transitions, 1 changer transitions 0/221 dead transitions. [2023-08-30 09:37:10,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 221 transitions, 3818 flow [2023-08-30 09:37:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 09:37:10,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-08-30 09:37:10,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 09:37:10,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 09:37:10,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:10,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 09:37:10,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,275 INFO L175 Difference]: Start difference. First operand has 164 places, 203 transitions, 3208 flow. Second operand 3 states and 326 transitions. [2023-08-30 09:37:10,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 221 transitions, 3818 flow [2023-08-30 09:37:10,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 221 transitions, 3804 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:10,317 INFO L231 Difference]: Finished difference. Result has 164 places, 202 transitions, 3192 flow [2023-08-30 09:37:10,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3190, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3192, PETRI_PLACES=164, PETRI_TRANSITIONS=202} [2023-08-30 09:37:10,317 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-08-30 09:37:10,317 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 3192 flow [2023-08-30 09:37:10,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:10,318 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:10,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 09:37:10,318 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:10,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1309607972, now seen corresponding path program 1 times [2023-08-30 09:37:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772057172] [2023-08-30 09:37:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:10,365 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 09:37:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772057172] [2023-08-30 09:37:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772057172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419084185] [2023-08-30 09:37:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:10,367 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 09:37:10,370 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 09:37:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:10,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 09:37:10,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:10,494 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 09:37:10,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:37:10,507 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 09:37:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419084185] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:37:10,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:37:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 09:37:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610148172] [2023-08-30 09:37:10,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:37:10,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 09:37:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 09:37:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 09:37:10,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 09:37:10,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 3192 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:10,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 09:37:10,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:10,791 INFO L130 PetriNetUnfolder]: 569/1276 cut-off events. [2023-08-30 09:37:10,791 INFO L131 PetriNetUnfolder]: For 18036/18036 co-relation queries the response was YES. [2023-08-30 09:37:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9246 conditions, 1276 events. 569/1276 cut-off events. For 18036/18036 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6747 event pairs, 49 based on Foata normal form. 61/1337 useless extension candidates. Maximal degree in co-relation 9168. Up to 287 conditions per place. [2023-08-30 09:37:10,803 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 299 selfloop transitions, 14 changer transitions 0/313 dead transitions. [2023-08-30 09:37:10,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 313 transitions, 5423 flow [2023-08-30 09:37:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:37:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:37:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-30 09:37:10,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358333333333334 [2023-08-30 09:37:10,805 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-30 09:37:10,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-30 09:37:10,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:10,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-30 09:37:10,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,808 INFO L175 Difference]: Start difference. First operand has 164 places, 202 transitions, 3192 flow. Second operand 6 states and 643 transitions. [2023-08-30 09:37:10,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 313 transitions, 5423 flow [2023-08-30 09:37:10,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 313 transitions, 5372 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 09:37:10,877 INFO L231 Difference]: Finished difference. Result has 170 places, 199 transitions, 3091 flow [2023-08-30 09:37:10,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=2983, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3091, PETRI_PLACES=170, PETRI_TRANSITIONS=199} [2023-08-30 09:37:10,877 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2023-08-30 09:37:10,877 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 199 transitions, 3091 flow [2023-08-30 09:37:10,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:10,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:10,878 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:10,888 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 09:37:11,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:11,084 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:11,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -755877912, now seen corresponding path program 1 times [2023-08-30 09:37:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431362694] [2023-08-30 09:37:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:11,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431362694] [2023-08-30 09:37:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431362694] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308981003] [2023-08-30 09:37:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:11,460 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 09:37:11,464 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 09:37:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:11,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:37:11,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:11,585 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 09:37:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:37:11,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:37:11,811 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 09:37:11,995 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 09:37:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:12,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:37:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308981003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:37:14,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:37:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:37:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274306731] [2023-08-30 09:37:14,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:37:14,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:37:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:37:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=775, Unknown=6, NotChecked=0, Total=930 [2023-08-30 09:37:17,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:37:18,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 09:37:18,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 199 transitions, 3091 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:18,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:18,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 09:37:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:23,149 INFO L130 PetriNetUnfolder]: 669/1515 cut-off events. [2023-08-30 09:37:23,149 INFO L131 PetriNetUnfolder]: For 24625/24625 co-relation queries the response was YES. [2023-08-30 09:37:23,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11475 conditions, 1515 events. 669/1515 cut-off events. For 24625/24625 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8812 event pairs, 120 based on Foata normal form. 28/1543 useless extension candidates. Maximal degree in co-relation 11396. Up to 874 conditions per place. [2023-08-30 09:37:23,164 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 178 selfloop transitions, 182 changer transitions 0/360 dead transitions. [2023-08-30 09:37:23,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 360 transitions, 6207 flow [2023-08-30 09:37:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 09:37:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 09:37:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1736 transitions. [2023-08-30 09:37:23,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472 [2023-08-30 09:37:23,168 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1736 transitions. [2023-08-30 09:37:23,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1736 transitions. [2023-08-30 09:37:23,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:23,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1736 transitions. [2023-08-30 09:37:23,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 69.44) internal successors, (1736), 25 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:23,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:23,177 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:23,177 INFO L175 Difference]: Start difference. First operand has 170 places, 199 transitions, 3091 flow. Second operand 25 states and 1736 transitions. [2023-08-30 09:37:23,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 360 transitions, 6207 flow [2023-08-30 09:37:23,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 360 transitions, 6171 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:23,246 INFO L231 Difference]: Finished difference. Result has 210 places, 277 transitions, 5288 flow [2023-08-30 09:37:23,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3079, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5288, PETRI_PLACES=210, PETRI_TRANSITIONS=277} [2023-08-30 09:37:23,247 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2023-08-30 09:37:23,247 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 277 transitions, 5288 flow [2023-08-30 09:37:23,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:23,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:23,248 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:23,261 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 09:37:23,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-30 09:37:23,454 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:37:23,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -445377907, now seen corresponding path program 1 times [2023-08-30 09:37:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833804737] [2023-08-30 09:37:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:23,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833804737] [2023-08-30 09:37:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833804737] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:23,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846961703] [2023-08-30 09:37:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:23,889 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 09:37:23,892 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 09:37:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:24,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:37:24,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:24,007 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 09:37:24,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:37:24,091 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 09:37:24,287 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 09:37:24,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:37:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:24,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:37:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:27,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846961703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:37:27,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:37:27,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 09:37:27,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883356052] [2023-08-30 09:37:27,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:37:27,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:37:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:27,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:37:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=776, Unknown=9, NotChecked=0, Total=930 [2023-08-30 09:37:31,075 WARN L539 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 09:37:32,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 09:37:32,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 277 transitions, 5288 flow. Second operand has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:32,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:32,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 09:37:32,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:32,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-30 09:37:33,045 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))))) is different from false [2023-08-30 09:37:39,492 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 71 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:38:18,200 WARN L222 SmtUtils]: Spent 38.51s on a formula simplification. DAG size of input: 94 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:38:18,243 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-30 09:38:58,978 WARN L222 SmtUtils]: Spent 40.40s on a formula simplification. DAG size of input: 90 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:39:00,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:02,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:05,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:07,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:09,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:11,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:13,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:15,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:15,206 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1042 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))))) is different from false [2023-08-30 09:39:17,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:19,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:23,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:25,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:27,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:29,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:31,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:33,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:35,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:37,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:39,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:41,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:43,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:45,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:47,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:49,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:51,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:53,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:56,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:58,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:00,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:02,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:04,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:06,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:08,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:39,866 WARN L222 SmtUtils]: Spent 31.45s on a formula simplification. DAG size of input: 89 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:40:41,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:43,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:45,901 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2) (< 0 (+ 2147483650 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse2)))))) is different from false [2023-08-30 09:40:47,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, 1] [2023-08-30 09:40:50,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:52,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:52,620 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ .cse6 28 |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse6 |c_~#cache~0.offset|))) (exists ((v_ArrVal_1042 Int)) (= (store .cse0 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3)))))) is different from false [2023-08-30 09:40:52,669 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse9 (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))) (.cse8 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ .cse6 28 |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse6 |c_~#cache~0.offset|))) (exists ((v_ArrVal_1042 Int)) (= (store .cse0 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (or (and .cse7 (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse8) (= |c_~#cache~0.offset| 0) (<= 0 (+ (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) .cse9 (or (and .cse7 .cse9) (not .cse8)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse3)))))) is different from false [2023-08-30 09:40:54,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:56,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:40:58,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:41:00,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:41:00,731 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1042 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (or (and .cse3 (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse4) (= |c_~#cache~0.offset| 0) (<= 0 (+ (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (or (and .cse3 (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))) (not .cse4)) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))))) is different from false [2023-08-30 09:41:00,751 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ 2147483650 (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1))))) is different from false [2023-08-30 09:41:03,867 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1042 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1042) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))))) is different from false [2023-08-30 09:41:11,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:13,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:15,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:19,262 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ .cse5 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_1041 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1041) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1) (< 0 (+ 2147483650 (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ .cse5 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (forall ((v_ArrVal_1045 Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_1042 Int) (v_ArrVal_1045 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1042)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1045) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| .cse1)))))) is different from false [2023-08-30 09:41:26,964 INFO L130 PetriNetUnfolder]: 1672/3663 cut-off events. [2023-08-30 09:41:26,964 INFO L131 PetriNetUnfolder]: For 98929/98929 co-relation queries the response was YES. [2023-08-30 09:41:26,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32174 conditions, 3663 events. 1672/3663 cut-off events. For 98929/98929 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 25977 event pairs, 247 based on Foata normal form. 87/3750 useless extension candidates. Maximal degree in co-relation 32076. Up to 1363 conditions per place. [2023-08-30 09:41:27,004 INFO L137 encePairwiseOnDemand]: 182/200 looper letters, 438 selfloop transitions, 495 changer transitions 0/933 dead transitions. [2023-08-30 09:41:27,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 933 transitions, 17886 flow [2023-08-30 09:41:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-08-30 09:41:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2023-08-30 09:41:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 5309 transitions. [2023-08-30 09:41:27,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31229411764705883 [2023-08-30 09:41:27,013 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 5309 transitions. [2023-08-30 09:41:27,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 5309 transitions. [2023-08-30 09:41:27,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:41:27,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 5309 transitions. [2023-08-30 09:41:27,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 62.45882352941177) internal successors, (5309), 85 states have internal predecessors, (5309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:27,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 200.0) internal successors, (17200), 86 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:27,039 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 200.0) internal successors, (17200), 86 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:27,039 INFO L175 Difference]: Start difference. First operand has 210 places, 277 transitions, 5288 flow. Second operand 85 states and 5309 transitions. [2023-08-30 09:41:27,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 933 transitions, 17886 flow [2023-08-30 09:41:27,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 933 transitions, 17239 flow, removed 272 selfloop flow, removed 4 redundant places. [2023-08-30 09:41:27,393 INFO L231 Difference]: Finished difference. Result has 339 places, 694 transitions, 14109 flow [2023-08-30 09:41:27,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=4812, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=14109, PETRI_PLACES=339, PETRI_TRANSITIONS=694} [2023-08-30 09:41:27,398 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2023-08-30 09:41:27,399 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 694 transitions, 14109 flow [2023-08-30 09:41:27,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 58.45161290322581) internal successors, (1812), 31 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:27,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:41:27,400 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:41:27,409 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 09:41:27,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-30 09:41:27,609 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:41:27,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:41:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1935379416, now seen corresponding path program 1 times [2023-08-30 09:41:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:41:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177786221] [2023-08-30 09:41:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:41:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:41:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:41:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:41:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177786221] [2023-08-30 09:41:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177786221] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:41:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703559339] [2023-08-30 09:41:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:41:28,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:41:28,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:41:28,164 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 09:41:28,166 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 09:41:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:41:28,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:41:28,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:41:28,288 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 09:41:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:41:28,393 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 09:41:28,557 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 09:41:28,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:41:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:28,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:41:29,204 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1121 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 09:41:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703559339] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:41:29,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:41:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-08-30 09:41:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257790361] [2023-08-30 09:41:29,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:41:29,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 09:41:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:41:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 09:41:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=796, Unknown=1, NotChecked=60, Total=1056 [2023-08-30 09:41:29,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 09:41:29,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 694 transitions, 14109 flow. Second operand has 33 states, 33 states have (on average 58.36363636363637) internal successors, (1926), 33 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:29,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:41:29,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 09:41:29,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:41:53,830 INFO L130 PetriNetUnfolder]: 1903/4085 cut-off events. [2023-08-30 09:41:53,830 INFO L131 PetriNetUnfolder]: For 253743/253743 co-relation queries the response was YES. [2023-08-30 09:41:53,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47645 conditions, 4085 events. 1903/4085 cut-off events. For 253743/253743 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29445 event pairs, 115 based on Foata normal form. 124/4209 useless extension candidates. Maximal degree in co-relation 47496. Up to 2087 conditions per place. [2023-08-30 09:41:53,888 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 548 selfloop transitions, 726 changer transitions 0/1274 dead transitions. [2023-08-30 09:41:53,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1274 transitions, 28656 flow [2023-08-30 09:41:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-08-30 09:41:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-08-30 09:41:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4485 transitions. [2023-08-30 09:41:53,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3071917808219178 [2023-08-30 09:41:53,895 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4485 transitions. [2023-08-30 09:41:53,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4485 transitions. [2023-08-30 09:41:53,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:41:53,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4485 transitions. [2023-08-30 09:41:53,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 61.43835616438356) internal successors, (4485), 73 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:53,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 200.0) internal successors, (14800), 74 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:53,913 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 200.0) internal successors, (14800), 74 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:53,913 INFO L175 Difference]: Start difference. First operand has 339 places, 694 transitions, 14109 flow. Second operand 73 states and 4485 transitions. [2023-08-30 09:41:53,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1274 transitions, 28656 flow [2023-08-30 09:41:54,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1274 transitions, 25962 flow, removed 1319 selfloop flow, removed 10 redundant places. [2023-08-30 09:41:54,783 INFO L231 Difference]: Finished difference. Result has 420 places, 1017 transitions, 22181 flow [2023-08-30 09:41:54,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=11541, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=22181, PETRI_PLACES=420, PETRI_TRANSITIONS=1017} [2023-08-30 09:41:54,785 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 388 predicate places. [2023-08-30 09:41:54,785 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 1017 transitions, 22181 flow [2023-08-30 09:41:54,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 58.36363636363637) internal successors, (1926), 33 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:41:54,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:41:54,785 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:41:54,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 09:41:54,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-30 09:41:54,989 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:41:54,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:41:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -754393667, now seen corresponding path program 1 times [2023-08-30 09:41:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:41:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811461900] [2023-08-30 09:41:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:41:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:41:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:41:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:41:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811461900] [2023-08-30 09:41:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811461900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:41:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837352711] [2023-08-30 09:41:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:41:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:41:55,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:41:55,761 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 09:41:55,768 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 09:41:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:41:55,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 09:41:55,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:41:56,023 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 09:41:56,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:41:56,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 09:41:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:56,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:41:58,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:41:58,434 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 20 treesize of output 21 [2023-08-30 09:41:58,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:41:58,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2023-08-30 09:41:58,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-08-30 09:41:58,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:41:58,472 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 34 treesize of output 38 [2023-08-30 09:41:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:41:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837352711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:41:58,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:41:58,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 09:41:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527302401] [2023-08-30 09:41:58,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:41:58,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:41:58,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:41:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:41:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=808, Unknown=1, NotChecked=0, Total=930 [2023-08-30 09:42:01,360 WARN L539 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 09:42:03,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:05,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 [1] [2023-08-30 09:42:08,087 WARN L539 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 09:42:09,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:11,643 WARN L539 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 09:42:13,945 WARN L539 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 09:42:16,811 WARN L539 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 09:42:16,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 200 [2023-08-30 09:42:16,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 1017 transitions, 22181 flow. Second operand has 31 states, 31 states have (on average 71.45161290322581) internal successors, (2215), 31 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:16,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:42:16,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 200 [2023-08-30 09:42:16,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:42:24,645 INFO L130 PetriNetUnfolder]: 2556/5458 cut-off events. [2023-08-30 09:42:24,646 INFO L131 PetriNetUnfolder]: For 372008/372008 co-relation queries the response was YES. [2023-08-30 09:42:24,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66799 conditions, 5458 events. 2556/5458 cut-off events. For 372008/372008 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 41593 event pairs, 186 based on Foata normal form. 44/5502 useless extension candidates. Maximal degree in co-relation 66628. Up to 1316 conditions per place. [2023-08-30 09:42:24,725 INFO L137 encePairwiseOnDemand]: 187/200 looper letters, 825 selfloop transitions, 985 changer transitions 0/1810 dead transitions. [2023-08-30 09:42:24,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1810 transitions, 41766 flow [2023-08-30 09:42:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-08-30 09:42:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2023-08-30 09:42:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 5696 transitions. [2023-08-30 09:42:24,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37473684210526315 [2023-08-30 09:42:24,737 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 5696 transitions. [2023-08-30 09:42:24,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 5696 transitions. [2023-08-30 09:42:24,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:42:24,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 5696 transitions. [2023-08-30 09:42:24,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 74.94736842105263) internal successors, (5696), 76 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:24,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 200.0) internal successors, (15400), 77 states have internal predecessors, (15400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:24,758 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 200.0) internal successors, (15400), 77 states have internal predecessors, (15400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:24,758 INFO L175 Difference]: Start difference. First operand has 420 places, 1017 transitions, 22181 flow. Second operand 76 states and 5696 transitions. [2023-08-30 09:42:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1810 transitions, 41766 flow [2023-08-30 09:42:27,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1810 transitions, 36543 flow, removed 2535 selfloop flow, removed 13 redundant places. [2023-08-30 09:42:27,076 INFO L231 Difference]: Finished difference. Result has 515 places, 1396 transitions, 29642 flow [2023-08-30 09:42:27,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=18823, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=29642, PETRI_PLACES=515, PETRI_TRANSITIONS=1396} [2023-08-30 09:42:27,077 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 483 predicate places. [2023-08-30 09:42:27,077 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 1396 transitions, 29642 flow [2023-08-30 09:42:27,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.45161290322581) internal successors, (2215), 31 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:27,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:42:27,078 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:42:27,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 09:42:27,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:27,279 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:42:27,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:42:27,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1613697630, now seen corresponding path program 1 times [2023-08-30 09:42:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:42:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909873783] [2023-08-30 09:42:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:42:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:42:27,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909873783] [2023-08-30 09:42:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909873783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:42:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714265733] [2023-08-30 09:42:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:42:27,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:42:27,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 09:42:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:27,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:42:27,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:42:27,856 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 09:42:27,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:42:27,939 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 09:42:28,116 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 09:42:28,181 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 09:42:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:28,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:42:28,668 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 Int) (v_ArrVal_1279 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1279) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1282) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647))) is different from false [2023-08-30 09:42:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:28,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714265733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:42:28,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:42:28,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 09:42:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57604833] [2023-08-30 09:42:28,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:42:28,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:42:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:42:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:42:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=660, Unknown=1, NotChecked=54, Total=870 [2023-08-30 09:42:28,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 09:42:28,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1396 transitions, 29642 flow. Second operand has 30 states, 30 states have (on average 58.5) internal successors, (1755), 30 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:28,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:42:28,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 09:42:28,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:42:36,631 WARN L539 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 09:42:40,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:46,491 INFO L130 PetriNetUnfolder]: 3173/6731 cut-off events. [2023-08-30 09:42:46,492 INFO L131 PetriNetUnfolder]: For 378538/378538 co-relation queries the response was YES. [2023-08-30 09:42:46,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80916 conditions, 6731 events. 3173/6731 cut-off events. For 378538/378538 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 52453 event pairs, 479 based on Foata normal form. 102/6833 useless extension candidates. Maximal degree in co-relation 80716. Up to 4543 conditions per place. [2023-08-30 09:42:46,612 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 1188 selfloop transitions, 853 changer transitions 0/2041 dead transitions. [2023-08-30 09:42:46,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 2041 transitions, 47722 flow [2023-08-30 09:42:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-08-30 09:42:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2023-08-30 09:42:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 5572 transitions. [2023-08-30 09:42:46,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30615384615384617 [2023-08-30 09:42:46,622 INFO L72 ComplementDD]: Start complementDD. Operand 91 states and 5572 transitions. [2023-08-30 09:42:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 5572 transitions. [2023-08-30 09:42:46,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:42:46,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 91 states and 5572 transitions. [2023-08-30 09:42:46,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 92 states, 91 states have (on average 61.23076923076923) internal successors, (5572), 91 states have internal predecessors, (5572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:46,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 92 states, 92 states have (on average 200.0) internal successors, (18400), 92 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:46,648 INFO L81 ComplementDD]: Finished complementDD. Result has 92 states, 92 states have (on average 200.0) internal successors, (18400), 92 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:46,648 INFO L175 Difference]: Start difference. First operand has 515 places, 1396 transitions, 29642 flow. Second operand 91 states and 5572 transitions. [2023-08-30 09:42:46,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 2041 transitions, 47722 flow [2023-08-30 09:42:49,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 2041 transitions, 43551 flow, removed 1492 selfloop flow, removed 26 redundant places. [2023-08-30 09:42:49,767 INFO L231 Difference]: Finished difference. Result has 622 places, 1803 transitions, 38469 flow [2023-08-30 09:42:49,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=26858, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=501, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=38469, PETRI_PLACES=622, PETRI_TRANSITIONS=1803} [2023-08-30 09:42:49,768 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 590 predicate places. [2023-08-30 09:42:49,768 INFO L495 AbstractCegarLoop]: Abstraction has has 622 places, 1803 transitions, 38469 flow [2023-08-30 09:42:49,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 58.5) internal successors, (1755), 30 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:49,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:42:49,769 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:42:49,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 09:42:49,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:49,973 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:42:49,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:42:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1957562990, now seen corresponding path program 2 times [2023-08-30 09:42:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:42:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459123912] [2023-08-30 09:42:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:42:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:42:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459123912] [2023-08-30 09:42:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459123912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:42:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623740129] [2023-08-30 09:42:50,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:42:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:42:50,369 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:42:50,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 09:42:50,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:42:50,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:42:50,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 09:42:50,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:42:50,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:42:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:50,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:42:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623740129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:42:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:42:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 09:42:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294423791] [2023-08-30 09:42:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:42:50,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:42:50,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:42:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:42:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-08-30 09:42:50,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 09:42:50,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 1803 transitions, 38469 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:50,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:42:50,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 09:42:50,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:42:54,166 INFO L130 PetriNetUnfolder]: 2619/5599 cut-off events. [2023-08-30 09:42:54,166 INFO L131 PetriNetUnfolder]: For 313108/313108 co-relation queries the response was YES. [2023-08-30 09:42:54,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67333 conditions, 5599 events. 2619/5599 cut-off events. For 313108/313108 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 42342 event pairs, 587 based on Foata normal form. 4/5603 useless extension candidates. Maximal degree in co-relation 67094. Up to 4838 conditions per place. [2023-08-30 09:42:54,267 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 1452 selfloop transitions, 110 changer transitions 0/1562 dead transitions. [2023-08-30 09:42:54,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 1562 transitions, 37105 flow [2023-08-30 09:42:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:42:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:42:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 576 transitions. [2023-08-30 09:42:54,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-30 09:42:54,269 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 576 transitions. [2023-08-30 09:42:54,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 576 transitions. [2023-08-30 09:42:54,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:42:54,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 576 transitions. [2023-08-30 09:42:54,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:54,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:54,272 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:54,272 INFO L175 Difference]: Start difference. First operand has 622 places, 1803 transitions, 38469 flow. Second operand 6 states and 576 transitions. [2023-08-30 09:42:54,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 1562 transitions, 37105 flow [2023-08-30 09:42:56,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 1562 transitions, 35365 flow, removed 780 selfloop flow, removed 25 redundant places. [2023-08-30 09:42:57,005 INFO L231 Difference]: Finished difference. Result has 577 places, 1471 transitions, 30440 flow [2023-08-30 09:42:57,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=29973, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=30440, PETRI_PLACES=577, PETRI_TRANSITIONS=1471} [2023-08-30 09:42:57,007 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 545 predicate places. [2023-08-30 09:42:57,007 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 1471 transitions, 30440 flow [2023-08-30 09:42:57,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:57,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:42:57,007 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:42:57,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 09:42:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-30 09:42:57,213 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:42:57,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:42:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash -918518172, now seen corresponding path program 2 times [2023-08-30 09:42:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:42:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625052414] [2023-08-30 09:42:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:42:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:42:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625052414] [2023-08-30 09:42:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625052414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:42:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022525263] [2023-08-30 09:42:57,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:42:57,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:57,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:42:57,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:42:57,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 09:42:57,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:42:57,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:42:57,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:42:57,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:42:57,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 09:42:57,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:42:57,925 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 09:42:58,037 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 09:42:58,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:42:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:58,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:43:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022525263] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:43:03,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:43:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-30 09:43:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233999210] [2023-08-30 09:43:03,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:43:03,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:43:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:43:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:43:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=699, Unknown=7, NotChecked=0, Total=870 [2023-08-30 09:43:05,250 WARN L539 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 09:43:07,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 [1] [2023-08-30 09:43:08,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 09:43:08,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 1471 transitions, 30440 flow. Second operand has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:08,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:43:08,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 09:43:08,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:43:08,665 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1437 Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1437)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1438) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (exists ((v_ArrVal_1437 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1437) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1435) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1438) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-30 09:43:17,899 INFO L130 PetriNetUnfolder]: 2978/6389 cut-off events. [2023-08-30 09:43:17,899 INFO L131 PetriNetUnfolder]: For 307930/307930 co-relation queries the response was YES. [2023-08-30 09:43:17,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73240 conditions, 6389 events. 2978/6389 cut-off events. For 307930/307930 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 50428 event pairs, 405 based on Foata normal form. 35/6424 useless extension candidates. Maximal degree in co-relation 73016. Up to 4349 conditions per place. [2023-08-30 09:43:18,011 INFO L137 encePairwiseOnDemand]: 184/200 looper letters, 1194 selfloop transitions, 764 changer transitions 0/1958 dead transitions. [2023-08-30 09:43:18,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 1958 transitions, 45451 flow [2023-08-30 09:43:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-30 09:43:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-30 09:43:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3079 transitions. [2023-08-30 09:43:18,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3421111111111111 [2023-08-30 09:43:18,014 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3079 transitions. [2023-08-30 09:43:18,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3079 transitions. [2023-08-30 09:43:18,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:43:18,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3079 transitions. [2023-08-30 09:43:18,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 68.42222222222222) internal successors, (3079), 45 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:18,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 200.0) internal successors, (9200), 46 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:18,024 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 200.0) internal successors, (9200), 46 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:18,024 INFO L175 Difference]: Start difference. First operand has 577 places, 1471 transitions, 30440 flow. Second operand 45 states and 3079 transitions. [2023-08-30 09:43:18,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 1958 transitions, 45451 flow [2023-08-30 09:43:20,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 1958 transitions, 45237 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 09:43:20,733 INFO L231 Difference]: Finished difference. Result has 645 places, 1767 transitions, 40434 flow [2023-08-30 09:43:20,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=30292, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=40434, PETRI_PLACES=645, PETRI_TRANSITIONS=1767} [2023-08-30 09:43:20,735 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 613 predicate places. [2023-08-30 09:43:20,735 INFO L495 AbstractCegarLoop]: Abstraction has has 645 places, 1767 transitions, 40434 flow [2023-08-30 09:43:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:20,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:43:20,736 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:43:20,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 09:43:20,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:43:20,936 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:43:20,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:43:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 706246574, now seen corresponding path program 3 times [2023-08-30 09:43:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:43:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164768633] [2023-08-30 09:43:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:43:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:43:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:43:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:43:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164768633] [2023-08-30 09:43:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164768633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:43:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462360982] [2023-08-30 09:43:21,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:43:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:43:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:43:21,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:43:21,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 09:43:21,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:43:21,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:43:21,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:43:21,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:43:21,502 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 09:43:21,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:43:21,632 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 09:43:21,782 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 09:43:21,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:43:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:22,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:43:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462360982] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:43:30,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:43:30,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:43:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808891952] [2023-08-30 09:43:30,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:43:30,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:43:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:43:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:43:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=743, Unknown=10, NotChecked=0, Total=930 [2023-08-30 09:43:31,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 09:43:31,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 1767 transitions, 40434 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:31,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:43:31,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 09:43:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:43:35,968 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1519 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1515) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1519) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1519 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1519))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1517 Int) (v_ArrVal_1519 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1517)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1519) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1519 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1519)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ .cse0 |c_~#cache~0.offset|)))))) is different from false [2023-08-30 09:43:42,351 INFO L130 PetriNetUnfolder]: 3840/8228 cut-off events. [2023-08-30 09:43:42,351 INFO L131 PetriNetUnfolder]: For 493610/493610 co-relation queries the response was YES. [2023-08-30 09:43:42,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102940 conditions, 8228 events. 3840/8228 cut-off events. For 493610/493610 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 65635 event pairs, 519 based on Foata normal form. 107/8335 useless extension candidates. Maximal degree in co-relation 102688. Up to 5295 conditions per place. [2023-08-30 09:43:42,508 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 1487 selfloop transitions, 957 changer transitions 0/2444 dead transitions. [2023-08-30 09:43:42,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 2444 transitions, 62170 flow [2023-08-30 09:43:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 09:43:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 09:43:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2246 transitions. [2023-08-30 09:43:42,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3509375 [2023-08-30 09:43:42,511 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2246 transitions. [2023-08-30 09:43:42,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2246 transitions. [2023-08-30 09:43:42,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:43:42,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2246 transitions. [2023-08-30 09:43:42,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 70.1875) internal successors, (2246), 32 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:42,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 200.0) internal successors, (6600), 33 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:42,519 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 200.0) internal successors, (6600), 33 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:42,519 INFO L175 Difference]: Start difference. First operand has 645 places, 1767 transitions, 40434 flow. Second operand 32 states and 2246 transitions. [2023-08-30 09:43:42,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 2444 transitions, 62170 flow [2023-08-30 09:43:47,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 2444 transitions, 60886 flow, removed 580 selfloop flow, removed 4 redundant places. [2023-08-30 09:43:47,410 INFO L231 Difference]: Finished difference. Result has 694 places, 2191 transitions, 55169 flow [2023-08-30 09:43:47,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=39326, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=576, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=55169, PETRI_PLACES=694, PETRI_TRANSITIONS=2191} [2023-08-30 09:43:47,413 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 662 predicate places. [2023-08-30 09:43:47,413 INFO L495 AbstractCegarLoop]: Abstraction has has 694 places, 2191 transitions, 55169 flow [2023-08-30 09:43:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:47,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:43:47,413 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:43:47,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 09:43:47,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:43:47,619 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:43:47,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:43:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -57265058, now seen corresponding path program 4 times [2023-08-30 09:43:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:43:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330182309] [2023-08-30 09:43:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:43:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:43:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:43:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:43:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330182309] [2023-08-30 09:43:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330182309] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:43:48,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703937694] [2023-08-30 09:43:48,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 09:43:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:43:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:43:48,069 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:43:48,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 09:43:48,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 09:43:48,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:43:48,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:43:48,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:43:48,226 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 09:43:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:43:48,339 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 09:43:48,445 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 09:43:48,687 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 09:43:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:48,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:43:49,252 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1598 Int) (v_ArrVal_1595 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1595) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1598) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|))) is different from false [2023-08-30 09:43:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:43:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703937694] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:43:49,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:43:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:43:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911954916] [2023-08-30 09:43:49,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:43:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:43:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:43:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:43:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=711, Unknown=1, NotChecked=56, Total=930 [2023-08-30 09:43:49,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 09:43:49,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 2191 transitions, 55169 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:43:49,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:43:49,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 09:43:49,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:44:02,541 INFO L130 PetriNetUnfolder]: 4775/10269 cut-off events. [2023-08-30 09:44:02,541 INFO L131 PetriNetUnfolder]: For 746885/746885 co-relation queries the response was YES. [2023-08-30 09:44:02,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139705 conditions, 10269 events. 4775/10269 cut-off events. For 746885/746885 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 84190 event pairs, 417 based on Foata normal form. 162/10431 useless extension candidates. Maximal degree in co-relation 139430. Up to 5369 conditions per place. [2023-08-30 09:44:02,780 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 1495 selfloop transitions, 1508 changer transitions 0/3003 dead transitions. [2023-08-30 09:44:02,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 3003 transitions, 82305 flow [2023-08-30 09:44:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-30 09:44:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-30 09:44:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2555 transitions. [2023-08-30 09:44:02,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548611111111111 [2023-08-30 09:44:02,784 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2555 transitions. [2023-08-30 09:44:02,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2555 transitions. [2023-08-30 09:44:02,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:44:02,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2555 transitions. [2023-08-30 09:44:02,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 70.97222222222223) internal successors, (2555), 36 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:02,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 200.0) internal successors, (7400), 37 states have internal predecessors, (7400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:02,792 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 200.0) internal successors, (7400), 37 states have internal predecessors, (7400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:02,792 INFO L175 Difference]: Start difference. First operand has 694 places, 2191 transitions, 55169 flow. Second operand 36 states and 2555 transitions. [2023-08-30 09:44:02,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 3003 transitions, 82305 flow [2023-08-30 09:44:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 3003 transitions, 80761 flow, removed 768 selfloop flow, removed 2 redundant places. [2023-08-30 09:44:10,575 INFO L231 Difference]: Finished difference. Result has 749 places, 2682 transitions, 73610 flow [2023-08-30 09:44:10,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=53885, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=73610, PETRI_PLACES=749, PETRI_TRANSITIONS=2682} [2023-08-30 09:44:10,578 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 717 predicate places. [2023-08-30 09:44:10,578 INFO L495 AbstractCegarLoop]: Abstraction has has 749 places, 2682 transitions, 73610 flow [2023-08-30 09:44:10,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:10,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:44:10,579 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:44:10,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 09:44:10,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-30 09:44:10,784 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:44:10,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:44:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2048396458, now seen corresponding path program 5 times [2023-08-30 09:44:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:44:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086981730] [2023-08-30 09:44:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:44:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:44:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:11,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:44:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086981730] [2023-08-30 09:44:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086981730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:44:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080688599] [2023-08-30 09:44:11,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 09:44:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:44:11,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:44:11,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 09:44:11,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 09:44:11,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:44:11,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 09:44:11,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:44:11,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:44:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:11,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:44:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080688599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:44:11,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:44:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 09:44:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695723759] [2023-08-30 09:44:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:44:11,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 09:44:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:44:11,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 09:44:11,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-08-30 09:44:11,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 09:44:11,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 2682 transitions, 73610 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:11,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:44:11,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 09:44:11,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:44:21,340 INFO L130 PetriNetUnfolder]: 4717/10159 cut-off events. [2023-08-30 09:44:21,340 INFO L131 PetriNetUnfolder]: For 786865/786865 co-relation queries the response was YES. [2023-08-30 09:44:21,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144686 conditions, 10159 events. 4717/10159 cut-off events. For 786865/786865 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 83176 event pairs, 1141 based on Foata normal form. 6/10165 useless extension candidates. Maximal degree in co-relation 144388. Up to 8873 conditions per place. [2023-08-30 09:44:21,596 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 2568 selfloop transitions, 116 changer transitions 0/2684 dead transitions. [2023-08-30 09:44:21,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 2684 transitions, 78290 flow [2023-08-30 09:44:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 09:44:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 09:44:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-30 09:44:21,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492 [2023-08-30 09:44:21,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-30 09:44:21,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-30 09:44:21,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:44:21,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-30 09:44:21,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:21,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:21,600 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:21,600 INFO L175 Difference]: Start difference. First operand has 749 places, 2682 transitions, 73610 flow. Second operand 5 states and 492 transitions. [2023-08-30 09:44:21,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 2684 transitions, 78290 flow [2023-08-30 09:44:30,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 2684 transitions, 76302 flow, removed 940 selfloop flow, removed 8 redundant places. [2023-08-30 09:44:30,574 INFO L231 Difference]: Finished difference. Result has 747 places, 2640 transitions, 70329 flow [2023-08-30 09:44:30,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=70002, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70329, PETRI_PLACES=747, PETRI_TRANSITIONS=2640} [2023-08-30 09:44:30,576 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 715 predicate places. [2023-08-30 09:44:30,577 INFO L495 AbstractCegarLoop]: Abstraction has has 747 places, 2640 transitions, 70329 flow [2023-08-30 09:44:30,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:30,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:44:30,577 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:44:30,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 09:44:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:30,778 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:44:30,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:44:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -318032408, now seen corresponding path program 6 times [2023-08-30 09:44:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:44:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612047363] [2023-08-30 09:44:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:44:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:44:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:44:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612047363] [2023-08-30 09:44:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612047363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:44:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557165134] [2023-08-30 09:44:31,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 09:44:31,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:31,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:44:31,164 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:44:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 09:44:31,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 09:44:31,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:44:31,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 09:44:31,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:44:31,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:44:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:31,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:44:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557165134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:44:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:44:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 09:44:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67496756] [2023-08-30 09:44:31,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:44:31,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:44:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:44:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:44:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-08-30 09:44:31,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 09:44:31,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 2640 transitions, 70329 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:31,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:44:31,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 09:44:31,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:44:39,845 INFO L130 PetriNetUnfolder]: 4330/9387 cut-off events. [2023-08-30 09:44:39,845 INFO L131 PetriNetUnfolder]: For 688347/688347 co-relation queries the response was YES. [2023-08-30 09:44:40,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130837 conditions, 9387 events. 4330/9387 cut-off events. For 688347/688347 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 76296 event pairs, 1034 based on Foata normal form. 4/9391 useless extension candidates. Maximal degree in co-relation 130539. Up to 8160 conditions per place. [2023-08-30 09:44:40,060 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 2289 selfloop transitions, 133 changer transitions 0/2422 dead transitions. [2023-08-30 09:44:40,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 2422 transitions, 69296 flow [2023-08-30 09:44:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:44:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:44:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2023-08-30 09:44:40,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2023-08-30 09:44:40,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2023-08-30 09:44:40,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2023-08-30 09:44:40,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:44:40,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2023-08-30 09:44:40,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:40,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:40,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:40,063 INFO L175 Difference]: Start difference. First operand has 747 places, 2640 transitions, 70329 flow. Second operand 6 states and 588 transitions. [2023-08-30 09:44:40,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 2422 transitions, 69296 flow [2023-08-30 09:44:47,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 2422 transitions, 68524 flow, removed 184 selfloop flow, removed 34 redundant places. [2023-08-30 09:44:47,445 INFO L231 Difference]: Finished difference. Result has 681 places, 2325 transitions, 61700 flow [2023-08-30 09:44:47,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=61040, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61700, PETRI_PLACES=681, PETRI_TRANSITIONS=2325} [2023-08-30 09:44:47,447 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 649 predicate places. [2023-08-30 09:44:47,447 INFO L495 AbstractCegarLoop]: Abstraction has has 681 places, 2325 transitions, 61700 flow [2023-08-30 09:44:47,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:47,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:44:47,448 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:44:47,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 09:44:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:47,649 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:44:47,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:44:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065106, now seen corresponding path program 7 times [2023-08-30 09:44:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:44:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636785359] [2023-08-30 09:44:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:44:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:44:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:44:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636785359] [2023-08-30 09:44:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636785359] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:44:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464794754] [2023-08-30 09:44:48,073 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 09:44:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:44:48,075 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:44:48,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 09:44:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:48,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:44:48,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:44:48,238 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 09:44:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:44:48,341 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 09:44:48,547 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 09:44:48,641 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 09:44:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:48,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:44:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464794754] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:44:53,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:44:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 09:44:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611848567] [2023-08-30 09:44:53,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:44:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 09:44:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:44:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 09:44:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=802, Unknown=6, NotChecked=0, Total=992 [2023-08-30 09:44:55,539 WARN L539 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 09:44:57,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 09:44:57,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 2325 transitions, 61700 flow. Second operand has 32 states, 32 states have (on average 64.40625) internal successors, (2061), 32 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:57,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:44:57,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 09:44:57,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:44:58,705 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)) |c_~#cache~0.base|) .cse2 v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse3))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (< (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1828) .cse2 v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse3) (< (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1831))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))))) is different from false [2023-08-30 09:45:04,321 WARN L539 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 09:45:08,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| 1)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)) |c_~#cache~0.base|) .cse2 v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse3))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (< (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1828) .cse2 v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1831 Int)) (= (store .cse4 0 v_ArrVal_1831) .cse5)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1828 Int)) (= (store .cse4 0 v_ArrVal_1828) .cse5)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse3) (< (select (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1831))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))))) is different from false [2023-08-30 09:45:11,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:17,878 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-30 09:45:20,512 WARN L539 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 09:45:28,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:45:32,692 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1828 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1828) (select |c_#memory_int| 1))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse1) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1831))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))))) is different from false [2023-08-30 09:45:35,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:38,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:40,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:43,154 WARN L539 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 09:45:45,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:47,311 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 (+ .cse6 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= .cse2 (store .cse3 .cse4 0)) (or (<= (+ .cse4 28) .cse5) (= .cse2 .cse3)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1828 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse6 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse7 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1828)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1831))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) .cse5)))) is different from false [2023-08-30 09:45:49,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:51,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:45:59,035 WARN L539 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 09:46:01,979 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int) (v_ArrVal_1827 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1827) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (< (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| .cse0) (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 2147483647))))) is different from false [2023-08-30 09:46:29,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:46:38,906 INFO L130 PetriNetUnfolder]: 5123/11139 cut-off events. [2023-08-30 09:46:38,906 INFO L131 PetriNetUnfolder]: For 817610/817610 co-relation queries the response was YES. [2023-08-30 09:46:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156863 conditions, 11139 events. 5123/11139 cut-off events. For 817610/817610 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 95142 event pairs, 743 based on Foata normal form. 97/11236 useless extension candidates. Maximal degree in co-relation 156592. Up to 6757 conditions per place. [2023-08-30 09:46:39,183 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 1812 selfloop transitions, 1627 changer transitions 0/3439 dead transitions. [2023-08-30 09:46:39,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 3439 transitions, 99627 flow [2023-08-30 09:46:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-08-30 09:46:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2023-08-30 09:46:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 5702 transitions. [2023-08-30 09:46:39,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33940476190476193 [2023-08-30 09:46:39,187 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 5702 transitions. [2023-08-30 09:46:39,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 5702 transitions. [2023-08-30 09:46:39,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:46:39,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 5702 transitions. [2023-08-30 09:46:39,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 67.88095238095238) internal successors, (5702), 84 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:39,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 200.0) internal successors, (17000), 85 states have internal predecessors, (17000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:39,207 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 200.0) internal successors, (17000), 85 states have internal predecessors, (17000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:39,207 INFO L175 Difference]: Start difference. First operand has 681 places, 2325 transitions, 61700 flow. Second operand 84 states and 5702 transitions. [2023-08-30 09:46:39,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 3439 transitions, 99627 flow [2023-08-30 09:46:47,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 3439 transitions, 99484 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-08-30 09:46:48,058 INFO L231 Difference]: Finished difference. Result has 809 places, 3020 transitions, 88773 flow [2023-08-30 09:46:48,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=61557, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=88773, PETRI_PLACES=809, PETRI_TRANSITIONS=3020} [2023-08-30 09:46:48,061 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 777 predicate places. [2023-08-30 09:46:48,061 INFO L495 AbstractCegarLoop]: Abstraction has has 809 places, 3020 transitions, 88773 flow [2023-08-30 09:46:48,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 64.40625) internal successors, (2061), 32 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:48,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:46:48,061 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:46:48,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-30 09:46:48,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:46:48,268 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:46:48,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:46:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1485100586, now seen corresponding path program 3 times [2023-08-30 09:46:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:46:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702880976] [2023-08-30 09:46:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:46:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:46:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:46:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:46:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:46:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702880976] [2023-08-30 09:46:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702880976] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:46:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783708123] [2023-08-30 09:46:48,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:46:48,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:46:48,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:46:48,685 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:46:48,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-30 09:46:48,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:46:48,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:46:48,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:46:48,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:46:48,838 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 09:46:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:46:48,920 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 09:46:49,111 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 09:46:49,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:46:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:46:49,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:46:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:46:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783708123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:46:50,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:46:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 09:46:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664047654] [2023-08-30 09:46:50,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:46:50,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:46:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:46:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:46:50,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=734, Unknown=3, NotChecked=0, Total=870 [2023-08-30 09:46:53,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:46:56,753 WARN L539 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 09:46:57,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 09:46:57,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 3020 transitions, 88773 flow. Second operand has 30 states, 30 states have (on average 58.5) internal successors, (1755), 30 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:57,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:46:57,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 09:46:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:47:02,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 [1] [2023-08-30 09:47:05,583 WARN L539 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 09:47:12,727 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1907 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse1) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1907) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store .cse2 |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store .cse2 |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1909)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1910))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3)))))) is different from false [2023-08-30 09:47:19,062 WARN L222 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 76 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:47:23,665 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (exists ((v_ArrVal_1909 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1909) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1907 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1907) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|))) (or (and .cse1 (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse2) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3))) (= |c_~#cache~0.offset| 0) (or (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) .cse1) (not .cse2)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1909)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1910))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 09:47:25,167 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse8 (+ .cse5 28 |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) .cse3 (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_1909 Int)) (= (store .cse0 0 v_ArrVal_1909) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1907 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1907) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|))) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse5 |c_~#cache~0.offset|))) (or (and .cse6 (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse7) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse8))) (= |c_~#cache~0.offset| 0) (or (and .cse3 .cse6) (not .cse7)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1909)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1910))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse8))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) is different from false [2023-08-30 09:47:26,419 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (exists ((v_ArrVal_1909 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1909) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1907 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1907) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1909)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1910))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 09:47:34,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1907 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1907) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1910) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1910 Int)) (or (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1910)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse2))))) is different from false [2023-08-30 09:47:57,431 INFO L130 PetriNetUnfolder]: 5718/12492 cut-off events. [2023-08-30 09:47:57,431 INFO L131 PetriNetUnfolder]: For 1099778/1099778 co-relation queries the response was YES. [2023-08-30 09:47:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190409 conditions, 12492 events. 5718/12492 cut-off events. For 1099778/1099778 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 109481 event pairs, 788 based on Foata normal form. 142/12634 useless extension candidates. Maximal degree in co-relation 190090. Up to 8672 conditions per place. [2023-08-30 09:47:57,796 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 2402 selfloop transitions, 1402 changer transitions 0/3804 dead transitions. [2023-08-30 09:47:57,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 3804 transitions, 118178 flow [2023-08-30 09:47:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2023-08-30 09:47:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2023-08-30 09:47:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 6064 transitions. [2023-08-30 09:47:57,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30626262626262624 [2023-08-30 09:47:57,803 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 6064 transitions. [2023-08-30 09:47:57,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 6064 transitions. [2023-08-30 09:47:57,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:47:57,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 6064 transitions. [2023-08-30 09:47:57,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 61.25252525252525) internal successors, (6064), 99 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:57,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 200.0) internal successors, (20000), 100 states have internal predecessors, (20000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:57,827 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 200.0) internal successors, (20000), 100 states have internal predecessors, (20000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:57,827 INFO L175 Difference]: Start difference. First operand has 809 places, 3020 transitions, 88773 flow. Second operand 99 states and 6064 transitions. [2023-08-30 09:47:57,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 3804 transitions, 118178 flow [2023-08-30 09:48:11,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 3804 transitions, 114728 flow, removed 1371 selfloop flow, removed 26 redundant places. [2023-08-30 09:48:12,022 INFO L231 Difference]: Finished difference. Result has 927 places, 3428 transitions, 103382 flow [2023-08-30 09:48:12,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=85500, PETRI_DIFFERENCE_MINUEND_PLACES=783, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=103382, PETRI_PLACES=927, PETRI_TRANSITIONS=3428} [2023-08-30 09:48:12,025 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 895 predicate places. [2023-08-30 09:48:12,025 INFO L495 AbstractCegarLoop]: Abstraction has has 927 places, 3428 transitions, 103382 flow [2023-08-30 09:48:12,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 58.5) internal successors, (1755), 30 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:12,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:48:12,026 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:48:12,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-30 09:48:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-30 09:48:12,232 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:48:12,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:48:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1754638108, now seen corresponding path program 4 times [2023-08-30 09:48:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:48:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319758195] [2023-08-30 09:48:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:48:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:48:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:48:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:48:12,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319758195] [2023-08-30 09:48:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319758195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:48:12,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993612210] [2023-08-30 09:48:12,563 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 09:48:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:48:12,573 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:48:12,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-30 09:48:12,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 09:48:12,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:48:12,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 09:48:12,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:48:12,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:48:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:12,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:48:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993612210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:48:12,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:48:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 09:48:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070008252] [2023-08-30 09:48:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:48:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:48:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:48:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:48:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-08-30 09:48:12,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 09:48:12,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 3428 transitions, 103382 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:12,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:48:12,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 09:48:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:48:27,110 INFO L130 PetriNetUnfolder]: 4099/9087 cut-off events. [2023-08-30 09:48:27,110 INFO L131 PetriNetUnfolder]: For 841391/841391 co-relation queries the response was YES. [2023-08-30 09:48:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141882 conditions, 9087 events. 4099/9087 cut-off events. For 841391/841391 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 75546 event pairs, 1040 based on Foata normal form. 6/9093 useless extension candidates. Maximal degree in co-relation 141546. Up to 7743 conditions per place. [2023-08-30 09:48:27,496 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 2236 selfloop transitions, 69 changer transitions 0/2305 dead transitions. [2023-08-30 09:48:27,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 2305 transitions, 73487 flow [2023-08-30 09:48:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:48:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:48:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2023-08-30 09:48:27,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775 [2023-08-30 09:48:27,498 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 573 transitions. [2023-08-30 09:48:27,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 573 transitions. [2023-08-30 09:48:27,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:48:27,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 573 transitions. [2023-08-30 09:48:27,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:27,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:27,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:27,500 INFO L175 Difference]: Start difference. First operand has 927 places, 3428 transitions, 103382 flow. Second operand 6 states and 573 transitions. [2023-08-30 09:48:27,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 2305 transitions, 73487 flow [2023-08-30 09:48:37,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 2305 transitions, 67603 flow, removed 1013 selfloop flow, removed 112 redundant places. [2023-08-30 09:48:37,428 INFO L231 Difference]: Finished difference. Result has 669 places, 2252 transitions, 61467 flow [2023-08-30 09:48:37,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=61329, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61467, PETRI_PLACES=669, PETRI_TRANSITIONS=2252} [2023-08-30 09:48:37,430 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 637 predicate places. [2023-08-30 09:48:37,430 INFO L495 AbstractCegarLoop]: Abstraction has has 669 places, 2252 transitions, 61467 flow [2023-08-30 09:48:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:37,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:48:37,430 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:48:37,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-30 09:48:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-30 09:48:37,631 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 09:48:37,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:48:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1991882922, now seen corresponding path program 1 times [2023-08-30 09:48:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:48:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478325445] [2023-08-30 09:48:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:48:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:48:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:48:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:48:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478325445] [2023-08-30 09:48:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478325445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:48:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666235616] [2023-08-30 09:48:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:48:38,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:38,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:48:38,181 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:48:38,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-30 09:48:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:48:38,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 09:48:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:48:38,354 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 09:48:38,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:48:38,458 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 09:48:38,611 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 09:48:38,786 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 09:48:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:38,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:48:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666235616] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:48:48,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:48:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-30 09:48:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173453926] [2023-08-30 09:48:48,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:48:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 09:48:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:48:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 09:48:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=947, Unknown=5, NotChecked=0, Total=1122 [2023-08-30 09:48:50,754 WARN L539 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 09:48:52,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 [1] Killed by 15